Rectangular point location and the dynamic closest pair problem
- 1 January 1991
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 364-374
- https://doi.org/10.1007/3-540-54945-5_80
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Shallow interdistance selection and interdistance enumerationPublished by Springer Nature ,2005
- Enumerating k distances for n points in the planePublished by Association for Computing Machinery (ACM) ,1991
- Dynamic fractional cascadingAlgorithmica, 1990
- AnO(n logn) algorithm for the all-nearest-neighbors ProblemDiscrete & Computational Geometry, 1989
- Dynamically computing the maxima of decomposable functions, with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Rectangular Point Location in d Dimensions with ApplicationsThe Computer Journal, 1986