Abstract | ||
---|---|---|
Dilation of a set of points on the plane is the lowest possible dilation of a plane spanner on the point set. We show that dilation of vertices of any regular polygon is less than 1.4482. We introduce a method for constructing a triangulation of a regular polygon and prove this bound on its dilation. The upper bound on dilation is shown using mathematical proofs and experimental results. The new upper bound improves the previously known bound of 1.48454. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1016/j.comgeo.2019.01.009 | Computational Geometry |
Keywords | Field | DocType |
Dilation,Regular polygon,Triangulation,Plane spanner | Discrete mathematics,Combinatorics,Dilation (morphology),Vertex (geometry),Upper and lower bounds,Regular polygon,Triangulation (social science),Mathematical proof,Point set,Spanner,Mathematics | Journal |
Volume | ISSN | Citations |
80 | 0925-7721 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sattar Sattari | 1 | 0 | 0.68 |
Mohammad Izadi | 2 | 5 | 2.57 |