Toughness and Delaunay triangulations
 Michael B. Dillencourt
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
We show that nondegenerate Delaunay triangulations satisfy a combinatorial property called 1toughness. A graphG is1tough if for any setP of vertices,c(G−P)≤G, wherec(G−P) is the number of components of the graph obtained by removingP and all attached edges fromG, and G is the number of vertices inG. This property arises in the study of Hamiltonian graphs: all Hamiltonian graphs are 1tough, but not conversely. We also show that all Delaunay triangulationsT satisfy the following closely related property: for any setP of vertices the number of interior components ofT−P is at most P−2, where an interior component ofT−P is a component that contains no boundary vertex ofT. These appear to be the first nontrivial properties of a purely combinatorial nature to be established for Delaunay triangulations. We give examples to show that these bounds are best possible and are independent of one another. We also characterize the conditions under which a degenerate Delaunay triangulation can fail to be 1tough. This characterization leads to a proof that all graphs that can be realized as polytopes inscribed in a sphere are 1tough. One consequence of the toughness results is that all Delaunay triangulations and all inscribable graphs have perfect matchings.
 Akl, S. G. (1983) A note on Euclidean matchings, triangulations, and spanning trees. Journal of Combinatorics, Information and System Sciences 8: pp. 169174
 Ash, P. F., Bolker, E. D. (1985) Recognizing Dirichlet tessellations. Geometriae Dedicata 19: pp. 175206
 Ash, P. F., Bolker, E. D. (1986) Generalized Dirichlet tesselations. Geometriae Dedicata 20: pp. 209243
 Barefoot, C. A., Entringer, R., Swart, H. (1987) Vulnerability in graphs—a comparative survey. Journal of Combinatorial Mathematics and Combinatorial Computing 1: pp. 1322
 Barnette, D., Jucovič, E. (1970) Hamiltonian circuits on 3polytopes. Journal of Combinatorial Theory 9: pp. 5459
 D. Bauer, S. L. Hakimi, and E. Schmeichel. Recognizing tough graphs is NPhard.Discrete Mathematics, to appear.
 Bermond, J. C. Hamiltonian graphs. In: Beineke, L. W., Wilson, R. J. eds. (1978) Selected Topics in Graph Theory. Academic Press, London, pp. 127167
 Boissonnat, J.D. (1984) Geometric structures for threedimensional storage representation. ACM Transactions on Graphics 3: pp. 256286
 J.D. Boissonnat. Private Communication.
 Bondy, J. A., Murty, U. S. R. (1976) Graph Theory with Applications. NorthHolland, New York
 Brown, K. Q. (1979) Voronoi diagrams from convex hulls. Information Processing Letters 9: pp. 223228
 Chang, R. C., Lee, T. C. T. (1984) On the average length of Delaunay triangulations. BIT 24: pp. 269273
 Chvátal, V. (1973) Tough graphs and Hamiltonian circuits. Discrete Mathematics 5: pp. 215228
 Chvátal, V. Hamiltonian cycles. In: Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., Shmoys, D. B. eds. (1985) The Traveling Salesman Problem. Wiley, New York, pp. 403429
 Coxeter, H. S. M. (1969) Introduction to Geometry. Wiley, New York
 R. W. Dawes and M. G. Rodrigues. Properties of 1tough graphs.Journal of Combinatorial Mathematics and Combinatorial Computing, to appear.
 L. De Floriani, B. Falcidieno, C. Pienovi, and G. Nagy. On sorting triangles in a Delaunay tessellation.Algorithmica, to appear.
 Delaunay, B. (1934) Sur la sphère vide. Izvestia Akademia Nauk SSSR, VII Seria, Otdelenie Matematicheskii i Estestvennyka Nauk 7: pp. 793800
 Dillencourt, M. B. (1987) Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations. Information Processing Letters 24: pp. 339342
 Dillencourt, M. B. (1987) A nonHamiltonian, nondegenerate Delaunay triangulation. Information Processing Letters 25: pp. 149151
 Dillencourt, M. B. (1988) GraphTheoretical Properties of Algorithms Involving Delaunay Triangulations. University of Maryland, College Park, MD
 Dillencourt, M. B. (1989) An upper bound on the shortness exponent of inscribable graphs. Journal of Combinatorial Theory, Series B 46: pp. 6683
 M. B. Dillencourt. An upper bound on the shortness exponent of 1tough, maximal planar graphs.Discrete Mathematics, to appear.
 Dillencourt, M. B. (1990) Realizability of Delaunay triangulations. Information Processing Letters 33: pp. 283287
 D. P. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. InProceedings of the 28th IEEE Symposium on the Foundations of Computer Science, pp. 20–26, Los Angeles, CA, October 1987.
 Edelsbrunner, H. (1987) Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science, Vol. 10. SpringerVerlag, Berlin
 Edelsbrunner, H. (1989) An acyclicity theorem for cell complexes ind dimensions. Proceedings of the Fifth ACM Symposium on Computational Geometry. Saarbrücken, West Germany, pp. 145151
 Edelsbrunner, H., Seidel, R. (1986) Voronoi diagrams and arrangements. Discrete and Computational Geometry 1: pp. 2544
 Grünbaum, B. (1967) Convex Polytopes. Wiley Interscience, New York
 Grünbaum, B., Shephard, G. C. (1987) Some problems on polyhedra. Journal of Geometry 29: pp. 182190
 Kantabutra, V. (1983) Traveling salesman cycles are not always subgraphs of Voronoi duals. Information Processing Letters 16: pp. 1112
 Keil, J. M., Gutwin, C. A. (1989) The Delaunay triangulation closely approximates the complete Euclidean graph. Proceedings of the 1989 Workshop on Algorithms and Data Structures (WADS '89). SpringerVerlag, Berlin, pp. 4756
 Kirkpatrick, D. G. (1980) A note on Delaunay and optimal triangulations. Information Processing Letters 10: pp. 127128
 Lee, D. T., Preparata, F. P. (1984) Computational geometry—a survey. IEEE Transactions on Computers 33: pp. 10721101
 Lingas, A. (1986) The greedy and Delaunay triangulations are not bad in the average case. Information Processing Letters 22: pp. 2531
 E. L. Lloyd. On triangulations of a set of points in the plane. InProceedings of the Eighteenth Annual IEEE Symposium on the Foundations of Computing, pp. 228–240, Providence, RI, October 1977.
 Manacher, G. K., Zobrist, A. L. (1979) Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation. Information Processing Letters 9: pp. 3134
 Mathieu, C. (1987) Some problems in computational geometry. Algorithmica 2: pp. 131133
 Newman, M. H. A. (1951) Elements of the Topology of Plane Sets of Points. Cambridge University Press, Cambridge
 Nishizeki, T. (1980) A 1tough Nonhamiltonian maximal planar graph. Discrete Mathematics 30: pp. 305307
 Ore, O. (1967) The FourColor Problem. Academic Press, New York
 O'Rourke, J. (1986) The computational geometry column. Computer Graphics 20: pp. 232234
 O'Rourke, J., Booth, H., Washington, R. (1987) Connectthedots: A new heuristic. Computer Vision, Graphics, and Image Processing 39: pp. 258266
 Preparata, F. P., Shamos, M. I. (1985) Computational Geometry: An Introduction. SpringerVerlag, New York
 Shamos, M. I. (1978) Computational Geometry. Yale University, New Haven, CT
 Tutte, W. T. (1947) The factorization of linear graphs. Journal of the London Mathematical Society 22: pp. 107111
 Whitney, H. (1931) A theorem on graphs. Annals of Mathematics 32: pp. 378390
 Title
 Toughness and Delaunay triangulations
 Journal

Discrete & Computational Geometry
Volume 5, Issue 1 , pp 575601
 Cover Date
 19901201
 DOI
 10.1007/BF02187810
 Print ISSN
 01795376
 Online ISSN
 14320444
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Authors

 Michael B. Dillencourt ^{(1)}
 Author Affiliations

 1. Center for Automation Research and Institute of Advanced Computer Studies, University of Maryland, 20742, College Park, MD, USA