Beta-skeletons have unbounded dilation

A fractal construction shows that, for any β > 0, the β-skeleton of a point set can have arbitrarily large dilation. In particular this applies to the Gabriel graph.

[1]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[2]  David Eppstein,et al.  Spanning Trees and Spanners , 2000, Handbook of Computational Geometry.

[3]  Boting Yang,et al.  A Tight Bound for ß-SKeleton of Minimum Weight Triangulations , 1999, WADS.

[4]  Ruei-Chuan Chang,et al.  The K-Gabriel Graphs and Their Applications , 1990, SIGAL International Symposium on Algorithms.

[5]  J. Mark Keil,et al.  Computing a Subgraph of the Minimum Weight Triangulation , 1994, Comput. Geom..

[6]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[7]  Paul Chew,et al.  There are Planar Graphs Almost as Good as the Complete Graph , 1989, J. Comput. Syst. Sci..

[8]  Remco C. Veltkamp,et al.  The gamma-neighborhood Graph , 1992, Comput. Geom..

[9]  Matthew Dickerson,et al.  A (usually?) connected subgraph of the minimum weight triangulation , 1996, SCG '96.

[10]  Boting Yang.  A Better Subgraph of the Minimum Weight Triangulation , 1995, COCOON.

[11]  Yin-Feng Xu,et al.  Approaching the largest β-skeleton within a minimum weight triangulation , 1996, SCG '96.

[12]  Boting Yang.  A Better Subgraph of the Minimum Weight Triangulation , 1995, Inf. Process. Lett..

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

[14]  J. Sack,et al.  Handbook of computational geometry , 2000 .

[15]  Carl Gutwin,et al.  The Delauney Triangulation Closely Approximates the Complete Euclidean Graph , 1989, WADS.

[16]  Paul Chew,et al.  There is a planar graph almost as good as the complete graph , 1986, SCG '86.

[17]  David Eppstein,et al.  The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction , 1998, Graph. Model. Image Process..

[18]  David P. Dobkin,et al.  Delaunay graphs are almost as good as complete graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[19]  Gautam Das,et al.  WHICH TRIANGULATIONS APPROXIMATE THE COMPLETE GRAPH? , 2022 .

[20]  David P. Dobkin,et al.  Delaunay graphs are almost as good as complete graphs , 1990, Discret. Comput. Geom..