Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees

We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dynamic algorithms for a number of geometric problems, including closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, diameter, and Euclidean minimum spanning tree.

• Type: Conference
• Year: 1992
• Where: FOCS
• Authors: Pankaj K. Agarwal, David Eppstein, Jirí Matousek
• Keywords: Data Structures, Dynamic Data Structures, Euclidean Minimum Spanning Tree, FOCS 1992, Theoretical Computer Science