2006 | OriginalPaper | Buchkapitel
Upper Bound on Dilation of Triangulations of Cyclic Polygons
verfasst von : Narayanasetty Amarnadh, Pinaki Mitra
Erschienen in: Computational Science and Its Applications - ICCSA 2006
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.