HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces

Nicolas Bonichon 1, 2 Cyril Gavoille 1, 2 Nicolas Hanusse 1, 2 David Ilcinkas 1, 2
2 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
CNRS - Centre National de la Recherche Scientifique : UMR5800, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Inria Bordeaux - Sud-Ouest, Université Sciences et Technologies - Bordeaux 1
Abstract : $\Theta_k$-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to a factor depending on the cone number $k$ and the dimension of the space. TD-Delaunay graphs, a.k.a. triangular-distance Delaunay triangulations introduced by Chew, have been shown to be plane $2$-spanners of the 2D Euclidean complete graph, i.e., the distance in the TD-Delaunay graph between any two points is no more than twice the distance in the plane. Orthogonal surfaces are geometric objects defined from independent sets of points of the Euclidean space. Orthogonal surfaces are well studied in combinatorics (orders, integer programming) and in algebra. From orthogonal surfaces, geometric graphs, called geodesic embeddings can be built. In this paper, we introduce a specific subgraph of the $\TG$-graph defined in the 2D Euclidean space, namely the $\DTG$-graph, composed of the even-cone edges of the $\TG$-graph. Our main contribution is to show that these graphs are exactly the TD-Delaunay graphs, and are strongly connected to the geodesic embeddings of orthogonal surfaces of coplanar points in the 3D Euclidean space. Using these new bridges between these three fields, we establish: Every $\TG$-graph is the union of two spanning TD-Delaunay graphs. In particular, $\TG$-graphs are $2$-spanners of the Euclidean graph, and the bound of~$2$ on the stretch factor is best possible. It was not known that $\Theta_6$-graphs are $t$-spanners for some constant $t$, and $\Theta_7$-graphs were only known to be $t$-spanners for $t \approx 7.562$. Every plane triangulation is TD-Delaunay realizable, i.e., every combinatorial plane graph for which all its interior faces are triangles is the TD-Delaunay graph of some point set in the plane. Such realizability property does not hold for classical Delaunay triangulations.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download

Contributor : Cyril Gavoille Connect in order to contact the contributor
Submitted on : Tuesday, February 9, 2010 - 5:43:34 PM
Last modification on : Monday, December 20, 2021 - 4:50:11 PM
Long-term archiving on: : Thursday, October 18, 2012 - 2:50:37 PM


Files produced by the author(s)


  • HAL Id : hal-00454565, version 1



Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas. Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. 2010. ⟨hal-00454565⟩



Record views


Files downloads