A linear-time construction of the relative neighborhood graph from the Delaunay triangulation

1994/08/01 by Andrzej Lingas · 1 citation
Computer Science · Mathematics · Social Sciences · #Bowyer–Watson algorithm #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Constrained Delaunay triangulation #Data Management and Algorithms #Delaunay triangulation #Geographic Information Systems Studies #Geometry #Graph #Mathematics #Pitteway triangulation #Point set triangulation #Triangulation

paper · doi:10.1016/0925-7721(94)90018-3

crossref issued 1994/08/01 · crossref published 1994/08/01 · crossref published-print 1994/08/01 · openalex publication_date 1994/08/01 · crossref created 2002/07/25 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · openalex updated_date 2025/11/06 · crossref indexed 2026/02/08

Citations

• A linear-time algorithm for a special case of disjoint set union
• The relative neighbourhood graph of a finite planar set
• Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane
• Relative neighborhood graphs and their relatives

Cited by

• Relative neighborhood graph [wikipedia]