Toughness and Delaunay triangulations

Authors:
M. Dillencourt
Affiliations:
Computer Science Department, University of Maryland, College Park, MD and PAR Government Systems Corporation, 1840 Michael Faraday Drive, Suite 300, Reston, VA
Venue:
SCG '87 Proceedings of the third annual symposium on Computational geometry
Year:
1987

Citing 6
Cited 3

Computational geometry: an introduction

Computational geometry: an introduction
Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations

Information Processing Letters
A non-Hamiltonian, nondegenerate Delaunay Triangulation

Information Processing Letters
Voronoi diagrams and arrangements

SCG '85 Proceedings of the first annual symposium on Computational geometry
Geometric structures for three-dimensional shape representation

ACM Transactions on Graphics (TOG)
Computational geometry.

Computational geometry.

Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
Matching points with circles and squares

JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Squares

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that nondegenerate Delaunay triangulations satisfy a combinatorial property called 1-toughness. A graph with set of sites S is 1-tough if for any set P ⊆ S, c(S - P) ≤ |S|, where c(S - P) is the number of components of the subgraph induced by the complement of P and |P| is the number of sites in P. We also show that, under the same conditions, the number of interior components of S - P is at most |P| - 2. 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 can be attained, and we state and prove several corollaries. In particular, we show that maximal planar graphs inscribable in a sphere are 1-tough.