Dynamic half-space reporting, geometric optimization, and minimum spanning trees

Authors:
P. K. Agarwal;D. Eppstein;J. Matousek
Affiliations:
Dept. of Comput. Sci., Duke Univ., Durham, NC, USA;-;-
Venue:
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Year:
1992

Citing 0
Cited 7

Geometric Algorithms for Density-Based Data Clustering

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Quality of EDA CAD Tools: Definitions, Metrics and Directions

ISQED '00 Proceedings of the 1st International Symposium on Quality of Electronic Design
A new approach on indexing mobile objects on the plane

Data & Knowledge Engineering
Approximation algorithms for speeding up dynamic programming and denoising aCGH data

Journal of Experimental Algorithmics (JEA)
Approximate all nearest neighbor search for high dimensional entropy estimation for image registration

Signal Processing
Approximate dynamic programming using halfspace queries and multiscale Monge decomposition

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On some geometric problems of color-spanning sets

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The authors describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, they 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.