We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
We define corner points in an image as the intersections among detected straight line segments, and propose an algorithm that detects corners from such a definition. Our corner det...
Andres Solis Montero, Milos Stojmenovic, Amiya Nay...
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
We discuss the problem of generating text that preserves certain ambiguities, a capability that is useful in applications such as machine translation. We show that it is relativel...
This paper presents a cooperative decentralized path-planning algorithm for a group of autonomous agents that provides guaranteed collisionfree trajectories in real-time. The algo...