• Publications
  • Influence
Intersecting Red and Blue Line Segments in Optimal Time and Precision
TLDR
A sweep algorithm is given that uses the minimum arithmetic precision and runs in optimal O(n log n + k) time and O( n) space to output an arrangement with k vertices, or O(N log n) time to determine k.
Testing Homotopy for Paths in the Plane
TLDR
An efficient algorithm to test if two given paths are homotopic; that is, whether they wind around obstacles in the plane in the same way, is presented.
Testing Homotopy for Paths in the Plane
TLDR
An efficient algorithm to test if two given paths are homotopic; that is, whether they wind around obstacles in the plane in the same way, is presented.
Banana spiders: A study of connectivity in 3d combinatorial rigidity
TLDR
It is proved that vertex connectivity cannot be used to construct a combinatorial test for rigidity in 3D by describing a class of mechanisms that increase the vertex connectivity of fle xible graphs to 5, as minimally rigid graphs in3D can be at most 5-connected.
Buffering Fuzzy Maps in GIS
TLDR
This paper presents a variety of algorithms for operations on fuzzy raster maps, focusing on buffer operations for such maps, and shows how widely-available special-purpose hardware can be used for supporting buffer operations in fuzzy geographic information systems (GIS).
Constructing Red-Black Tree Shapes
TLDR
It is shown that any binary tree shape that satisfies the definition of red-black trees can be built using only the insertion algorithm, RB-INSERT, of Cormen et al.
Heaphull?
TLDR
A planar convex hull algorithm, Heaphull, whose main data structure is a kinetic heap, whose best bound on the running time is O(n lg n).