A Randomized Algorithm for Closest-Point Queries
- 1 August 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (4), 830-847
- https://doi.org/10.1137/0217052
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- How to search in historyInformation and Control, 1985
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- On the complexity ofd- dimensional Voronoi diagramsArchiv der Mathematik, 1980
- Voronoi diagrams from convex hullsInformation Processing Letters, 1979
- Multidimensional Searching ProblemsSIAM Journal on Computing, 1976
- Random Subdivisions of Space into CrystalsThe Annals of Mathematical Statistics, 1962