Relative neighborhood graphs in the Li-metric
- 31 December 1985
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 18 (5) , 327-332
- https://doi.org/10.1016/0031-3203(85)90023-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- New Data Structures for Orthogonal Range QueriesSIAM Journal on Computing, 1985
- Some properties of the planar Euclidean relative neighbourhood graphPattern Recognition Letters, 1983
- The Relative Neighborhood Graph, with an Application to Minimum Spanning TreesJournal of the ACM, 1983
- Computing the relative neighborhood graph in the L1 and L∞ metricsPattern Recognition, 1982
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- Efficient worst-case data structures for range searchingActa Informatica, 1980
- Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage ApplicationsSIAM Journal on Computing, 1980
- The relative neighbourhood graph of a finite planar setPattern Recognition, 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