Algorithms for proximity problems in higher dimensions
- 1 January 1996
- journal article
- Published by Elsevier BV in Computational Geometry
- Vol. 5 (5), 277-291
- https://doi.org/10.1016/0925-7721(95)00009-7
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Shallow interdistance selection and interdistance enumerationPublished by Springer Science and Business Media LLC ,2005
- Provably good mesh generationJournal of Computer and System Sciences, 1994
- An Optimal Algorithm for Selection in a Min-HeapInformation and Computation, 1993
- Selecting distances in the planeAlgorithmica, 1993
- ENUMERATING INTERDISTANCES IN SPACEInternational Journal of Computational Geometry & Applications, 1992
- Fixed-radius near neighbors search algorithms for points and segmentsInformation Processing Letters, 1990
- L-infinity interdistance selection by parametric searchInformation Processing Letters, 1989
- 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
- Time bounds for selectionJournal of Computer and System Sciences, 1973