The region approach for computing relative neighbourhood graphs in the Lp metric
- 1 June 1988
- journal article
- Published by Springer Nature in Computing
- Vol. 40 (2) , 147-161
- https://doi.org/10.1007/bf02247943
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Filtering Search: A New Approach to Query-AnsweringSIAM Journal on Computing, 1986
- Batched dynamic solutions to decomposable searching problemsJournal of Algorithms, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Scaling and related techniques for geometry problemsPublished by Association for Computing Machinery (ACM) ,1984
- The Relative Neighborhood Graph, with an Application to Minimum Spanning TreesJournal of the ACM, 1983
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Two-Dimensional Voronoi Diagrams in theLp-MetricJournal of the ACM, 1980
- Efficient worst-case data structures for range searchingActa Informatica, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- An Elementary Proof of Nonexistence of Isometries between ℓpk and ℓqkIBM Journal of Research and Development, 1979