The Exact Spanning Ratio of the Parallelogram Delaunay Graph
Abstract: Finding the exact spanning ratio of a Delaunay graph has been one of the longstanding open problems in Computational Geometry. Currently there are only four convex shapes for which the exact spanning ratio of their Delaunay graph is known: the equilateral triangle, the square, the regular hexagon and the rectangle. In this paper, we show the exact spanning ratio of the parallelogram Delaunay graph, making the parallelogram the fifth convex shape for which an exact bound is known. The worst-case spanning ratio is exactly $$\frac{\sqrt{2}\sqrt{1+A2+2A\cos(\theta_0)+(A+\cos(\theta_0))\sqrt{1+A2+2A\cos(\theta_0)}}}{\sin(\theta_0)}.$$ where $A$ is the aspect ratio and $\theta_0$ is the non-obtuse angle of the parallelogram. Moreover, we show how to construct a parallelogram Delaunay graph whose spanning ratio matches the above mentioned spanning ratio.
- New and improved spanning ratios for yao graphs. J. Comput. Geom., 6(2):19–53, 2015.
- Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces. In WG, volume 6410 of Lecture Notes in Computer Science, pages 266–278, 2010.
- Tight stretch factors for l11{}_{\mbox{1}}start_FLOATSUBSCRIPT 1 end_FLOATSUBSCRIPT- and l∞{}_{\mbox{{$\infty$}}}start_FLOATSUBSCRIPT ∞ end_FLOATSUBSCRIPT-delaunay triangulations. Comput. Geom., 48(3):237–250, 2015.
- Affine invariant triangulations. Comput. Aided Geom. Des., 91:102039, 2021.
- On the stretch factor of convex delaunay graphs. J. Comput. Geom., 1(1):41–56, 2010.
- On the spanning and routing ratio of theta-four. In SODA, pages 2361–2370. SIAM, 2019.
- Towards tight bounds on theta-graphs: More is not always better. Theor. Comput. Sci., 616:70–93, 2016.
- Constrained generalized delaunay graphs are plane spanners. Comput. Geom., 74:50–65, 2018.
- Almost all delaunay triangulations have stretch factor greater than pi/2. Comput. Geom., 44(2):121–127, 2011.
- Improved bounds on the spanning ratio of the theta-5-graph. In WADS, volume 12808 of Lecture Notes in Computer Science, pages 215–228. Springer, 2021.
- P. Chew. There are planar graphs almost as good as the complete graph. In Symposium on Computational Geometry, pages 169–177, 1986.
- P. Chew. There are planar graphs almost as good as the complete graph. J. Comput. Syst. Sci., 39(2):205–219, 1989.
- Delaunay graphs are almost as good as complete graphs. Discret. Comput. Geom., 5:399–407, 1990.
- Classes of graphs which approximate the complete euclidean graph. Discret. Comput. Geom., 7:13–28, 1992.
- G. Narasimhan and M. H. M. Smid. Geometric spanner networks. Cambridge University Press, 2007.
- Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, Second Edition. Wiley Series in Probability and Mathematical Statistics. Wiley, 2000.
- The stretch factor of hexagon-delaunay triangulations. J. Comput. Geom., 12(2):86–125, 2021.
- The tight spanning ratio of the rectangle delaunay triangulation. In ESA, volume 274 of LIPIcs, pages 99:1–99:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
- G. Xia. The stretch factor of the delaunay triangulation is less than 1.998. SIAM J. Comput., 42(4):1620–1659, 2013.
- G. Xia and L. Zhang. Toward the tight bound of the stretch factor of delaunay triangulations. In CCCG, 2011.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
