On the spanning ratio of gabriel graphs and β-skeletons

SIAM Journal on Discrete Mathematics

Volumn 20, Issue 2, 2006, Pages 412-427

  Bose, Prosenjit ^a   Devroye, Luc ^b   Evans, William ^c   Kirkpatrick, David ^c  

^a CARLETON UNIVERSITY   (Canada)

^b MCGILL UNIVERSITY   (Canada)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

skeletons; Computational geometry; Gabriel graph; Geometric spanners; Probabilistic analysis; Proximity graphs; Spanners

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES; DISTANCE MEASUREMENT; PROBABILISTIC LOGICS; RANDOM PROCESSES; SET THEORY;

GABRIEL GRAPH; GEOMETRIC SPANNERS; PROBABILISTIC ANALYSIS; PROXIMITY GRAPHS;

GRAPH THEORY;

EID: 34249008092     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197318088     Document Type: Article

References (16)

1. J. A. BONDY AND U. S. R. MURTY, Graph theory with applications, Elsevier, New York, 1976.
2. L. P. CHEW, There is a planar graph almost as good as the complete graph, in Proceedings of the 2nd Annual ACM Symposium on Computational Geometry, New York, 1986, pp. 169-177.
3. L. P. CHEW, There are planar graphs almost as good as the complete graph, J. Comput. System Sci., 39 (1989), pp. 205-219.
4. L. DEVROYE, The expected size of some graphs in computational geometry, Comput. Math. Appl., 15 (1988), pp. 53-64.
5. D. P. DOBKIN, S. J. FRIEDMAN, AND K. J. SUPOWIT, Delaunay graphs are almost as good as complete graphs, in Proceedings of the 28th Annual Symposium on the Foundations of Computer Science, Los Angeles, 1987, pp. 20-26. Also in Discrete Comput. Geom., 5 (1990), pp. 399-407.
6. D. EPPSTEIN, Beta-skeletons have unbounded dilation, Comput. Geom., 23 (2002), pp. 43-52.
7. D. EPPSTEIN, Spanning trees and spanners, Handbook of Computational Geometry, North-Holland, Amsterdam, 2000, pp. 425-461.
8. K. R. GABRIEL AND R. R. SOKAL, A new statistical approach to geographic variation analysis, Systematic Zoology, 18 (1969), pp. 259-278.
9. J. W. JAROMCZYK AND G. T. TOUSSAINT, Relative neighborhood graphs and their relatives, in Proceedings of the IEEE, 80 (1992), pp. 1502-1517.
10. J. M. KEIL AND C. A. GUTWIN, The Delaunay triangulation closely approximates the complete Euclidean graph, in Proceedings of the 1st Workshop Algorithms Data Struct., Ottawa, Canada, Lecture Notes in Computer Science 382, Springer-Verlag, 1989, pp. 47-56.
11. J. M. KEIL AND C. A. GUTWIN, Classes of graphs which approximate the complete Euclidean graph, Discrete Comput. Geom., 7 (1992), pp. 13-28.
12. D. G. KIRKPATRICK AND J. D. RADKE, A framework for computational morphology, Comput. Geom., G. T. Toussaint, ed., Elsevier, Amsterdam, 1985, pp. 217-248.
13. D. W. MATULA AND R. R. SOKAL, Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane, Geograph. Anal., 12 (1980), pp. 205-222.
14. C. MCDIARMID, On the method of bounded differences, in Surveys in Combinatorics, London Math. Soc. Lecture Note Ser. 141, Cambridge University Press, Cambridge, UK, 1989, pp. 148-188.
15. F. P. PREPARATA AND M. I. SHAMOS, Computational geometry. An introduction, Springer-Verlag, New York, 1985.
16. G. T. TOUSSAINT, The relative neighborhood graph of a finite planar set, Pattern Recognition, 12 (1980), pp. 261-268.