Shallow interdistance selection and interdistance enumeration
- 22 November 2005
- book chapter
- Published by Springer Nature
- p. 117-128
- https://doi.org/10.1007/bfb0028255
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Enumerating k distances for n points in the planePublished by Association for Computing Machinery (ACM) ,1991
- Fixed-radius near neighbors search algorithms for points and segmentsInformation Processing Letters, 1990
- Selecting distances in the planePublished by Association for Computing Machinery (ACM) ,1990
- AnO(n logn) algorithm for the all-nearest-neighbors ProblemDiscrete & Computational Geometry, 1989
- L-infinity interdistance selection by parametric searchInformation Processing Letters, 1989
- Some techniques for geometric searching with implicit set representationsActa Informatica, 1987
- Computational GeometryPublished by Springer Nature ,1985
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982
- The complexity of finding fixed-radius near neighborsInformation Processing Letters, 1977