Dynamic half-space range reporting and its applications
- 1 April 1995
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 13 (4), 325-345
- https://doi.org/10.1007/bf01293483
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Ray Shooting and Parametric SearchSIAM Journal on Computing, 1993
- Reporting points in halfspacesComputational Geometry, 1992
- Point Selections and Weak ε-Nets for Convex HullsCombinatorics, Probability and Computing, 1992
- Dynamic half-space reporting, geometric optimization, and minimum spanning treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Euclidean minimum spanning trees and bichromatic closest pairsDiscrete & Computational Geometry, 1991
- Points and triangles in the plane and halving planes in spaceDiscrete & Computational Geometry, 1991
- Solving query-retrieval problems by compacting Voronoi diagramsPublished by Association for Computing Machinery (ACM) ,1990
- Lower bounds on the complexity of polytope range searchingJournal of the American Mathematical Society, 1989
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980