论文信息 - A Linear-time Construction of the Relative Neighborhood Graph From the Delaunay Triangulation

A Linear-time Construction of the Relative Neighborhood Graph From the Delaunay Triangulation

Abstract A very simple linear-time algorithm for constructing the relative neighborhood graph RNG( V ) for a finite set V of points in the plane from the Delaunay triangulation of V is presented. It is extended to include the construction of the so called β -skeletons (generalization of RNG( V )) in the spectrum 1 ⩽ β ⩽ 2 in linear time from the Delaunay triangulation under the metric L p for 1 p p = 2.

Andrzej Lingas | A. Lingas

[1] Ruei-Chuan Chang,et al. Computing the constrained relative neighborhood graphs and constrained gabriel graphs in Euclidean plane , 1991, Pattern Recognit..

[2] D. Matula,et al. Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane , 2010 .

[3] Godfried T. Toussaint,et al. The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[4] P. Agarwal,et al. Relative neighborhood graphs in three dimensions , 1992 .

[5] Kenneth J. Supowit,et al. The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees , 1983, JACM.

[6] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[7] Godfried T. Toussaint,et al. Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.

[8] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..

[9] D. Kirkpatrick,et al. A Framework for Computational Morphology , 1985 .

[10] Jerzy W. Jaromczyk,et al. A note on relative neighborhood graphs , 1987, SCG '87.