An improved upper bound on dilation of regular polygons
From MaRDI portal
Publication:2330038
DOI10.1016/j.comgeo.2019.01.009zbMath1434.52003OpenAlexW2921782433MaRDI QIDQ2330038
Sattar Sattari, Mohammad A. Izadi
Publication date: 18 October 2019
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2019.01.009
Computational aspects related to convexity (52B55) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (2)
Cites Work
- Unnamed Item
- On plane geometric spanners: a survey and open problems
- An exact algorithm for the minimum dilation triangulation problem
- The Stretch Factor of the Delaunay Triangulation Is Less than 1.998
- A plane 1.88-spanner for points in convex position
- Geometric Spanner Networks
- Upper Bound on Dilation of Triangulations of Cyclic Polygons
This page was built for publication: An improved upper bound on dilation of regular polygons