Computing relative neighbourhood graphs in the plane
- 1 January 1986
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 19 (3) , 221-228
- https://doi.org/10.1016/0031-3203(86)90012-9
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the average length of Delaunay triangulationsBIT Numerical Mathematics, 1984
- Delaunay triangulation and the convex hull ofn points in expected linear timeBIT Numerical Mathematics, 1984
- The average performance analysis of a closest?pair algorithmInternational Journal of Computer Mathematics, 1984
- 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
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the PlaneGeographical Analysis, 1980
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- On the homogeneous planar Poisson point processMathematical Biosciences, 1970