Upper Bound on Dilation of Triangulations of Cyclic Polygons
Given a planar graph G, the dilation between two points of a Euclidean graph is defined as the ratio of the length of the shortest path between the points to the Euclidean distance between the points. The dilation of a graph is defined as the maximum over all vertex pairs (u,v) of the dilation between u and v. In this paper we consider the upper bound on the dilation of triangulation over the set of vertices of a cyclic polygon. We have shown that if the triangulation is a fan (i.e. every edge of the triangulation starts from the same vertex), the dilation will be at most approximately 1.48454. We also show that if the triangulation is a star the dilation will be at most 1.18839.
KeywordsShort Path Planar Graph Delaunay Triangulation Convex Polygon Arbitrary Vertex
Unable to display preview. Download preview PDF.
- 3.Mulzer, W.: Minimum dilation triangulations for the regular n-gon. Diploma Thesis. Freie universitat Berlin (2004)Google Scholar
- 4.Eppstein, D.: Spanning trees and Spanners. In: Sack, J.R., Urrutia, J. (eds.) Handbook of computational Geometry, pp. 425–465. Elsevier, Amsterdam (1999)Google Scholar
- 5.Keil, J.M., Gutwin, C.A.: The Delaunay triangulation closely approximates the complete Euclidean graph. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol. 382, pp. 47–56. Springer, Heidelberg (1989)Google Scholar