A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
- 31 August 1994
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 4 (4) , 199-208
- https://doi.org/10.1016/0925-7721(94)90018-3
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Relative neighborhood graphs and their relativesProceedings of the IEEE, 1992
- Relative neighborhood graphs in three dimensionsComputational Geometry, 1992
- Computing the constrained relative neighborhood graphs and constrained gabriel graphs in Euclidean planePattern Recognition, 1991
- A note on relative neighborhood graphsPublished by Association for Computing Machinery (ACM) ,1987
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- A Framework for Computational MorphologyPublished by Elsevier ,1985
- The Relative Neighborhood Graph, with an Application to Minimum Spanning TreesJournal of the ACM, 1983
- 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
- The relative neighbourhood graph of a finite planar setPattern Recognition, 1980