Relative neighborhood graphs in the Li-metric

Abstract The relative neighborhood graph of a set of n points in the plane under the L 1 -metric is considered. An algorithm that runs in O ( n log n ) time for constructing the relative neighborhood graph based on the Delaunay triangulation is presented, improving a previously known algorithm that runs in O ( n 2 log n ) time.

[1]  Dan E. Willard,et al.  New Data Structures for Orthogonal Queries. , 1979 .

[2]  Dan E. Willard,et al.  New Data Structures for Orthogonal Range Queries , 1985, SIAM J. Comput..

[3]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[4]  Roderick Urquhart,et al.  Some properties of the planar Euclidean relative neighbourhood graph , 1983, Pattern Recognit. Lett..

[5]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[6]  Jon Louis Bentley,et al.  Data Structures for Range Searching , 1979, CSUR.

[7]  Joseph O'Rourke.  Computing the relative neighborhood graph in the L1 and Linfinity metrics , 1982, Pattern Recognit..

[8]  George S. Lueker,et al.  A Data Structure for Dynamic Range Queries , 1982, Inf. Process. Lett..

[9]  Godfried T. Toussaint,et al.  PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[10]  D. Coppersmith,et al.  An elementary proof of nonexistence of isometries between l p k and l q k , 1979 .

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

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

[13]  Chak-Kuen Wong,et al.  Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications , 1980, SIAM J. Comput..

[14]  Hermann A. Maurer,et al.  Efficient worst-case data structures for range searching , 1978, Acta Informatica.