On the spanning ratio of gabriel graphs and β-skeletons

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2286, Issue , 2002, Pages 479-493

  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

[No Author keywords available]

Indexed keywords

GEOMETRY; GRAPHIC METHODS; MUSCULOSKELETAL SYSTEM; PROBABILITY DISTRIBUTIONS;

CONNECTED GRAPH; DELAU-NAY TRIANGULATIONS; EUCLIDEAN DISTANCE; EUCLIDEAN PLANES; MINIMUM SPANNING TREES; PROXIMITY GRAPHS; RELATIVE NEIGHBORHOOD GRAPHS; UNIFORM DISTRIBUTION;

TREES (MATHEMATICS);

EID: 84937400913     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45995-2_42     Document Type: Conference Paper

References (16)

1. J.A. Bondy and U.S.R. Murty. Graph theory with applications. North Holland, 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 Computional Geometry, pages 169–177, 1986.
3. L.P. Chew. There are planar graphs almost as good as the complete graph. Journal of Computers and Systems Sciences, 39: 205–219, 1989.
4. L. Devroye. The expected size of some graphs in computational geometry. Computers and Mathematics with Applications, 15: 53–64, 1988.
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, pages 20–26, 1987. Also in Discrete and Computational Geometry, vol. 5, pp. 399–407, 1990.
6. D. Eppstein. Beta-skeletons have unbounded dilation, Tech. Report 96-15, Dept. of Comp. Sci, University of California, Irvine, 1996.
7. D. Eppstein. Spanning trees and spanners, Handbook of Computational Geometry (J. Sack and J. Urrutia eds.), North Holland, pp. 425–462, 2000.
8. K.R. Gabriel and R.R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18: 259–278, 1969.
9. J. W. Jaromczyk and G. T. Toussaint. Relative neighborhood graphs and their relatives. Proceedings of the IEEE, 80(9), pp. 1502-1517, 1992.
10. J.M. Keil and C.A. Gutwin. The Delaunay triangulation closely approximates the complete Euclidean graph. In Proc. 1st Workshop Algorithms Data Struct., volume 382 of Lecture Notes in Computer Science, pages 47–56. Springer-Verlag, 1989.
11. J.M. Keil and C.A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete and Computational Geometry, 7: 13–28, 1992.
12. D. G. Kirkpatrick and J. D. Radke. A framework for computational morphology. Computational Geometry, G. T. Toussaint, Elsevier, Amsterdam, 217-248, 1985.
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. Geographical Analysis, 12: 205–222, 1980.
14. C. McDiarmid. On the method of bounded differences. Surveys in Combinatorics, 141: 148–188, 1989.
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: 261-268, 1980.