Degree Four Plane Spanners: Simpler and Better
Iyad Kanj, Ljubomir Perkovi\'c, and Duru T\"urko\v{g}lu

TL;DR
This paper presents a simple, efficient method to construct plane spanners with maximum degree 4 and stretch factor at most 20, improving previous bounds and revealing structural properties of Delaunay triangulations based on equilateral-triangle distance.
Contribution
It introduces a new approach using equilateral-triangle distance Delaunay triangulations to build plane spanners with optimal degree and stretch factor bounds, simplifying previous methods.
Findings
Constructs a plane spanner with degree at most 4 and stretch factor at most 20 in O(n log n) time.
Matches the smallest known maximum degree bound of 4, improving the stretch factor from 156.82 to 20.
When points are in convex position, the maximum degree is at most 3, which is tight.
Abstract
Let be a set of points embedded in the plane, and let be the complete Euclidean graph whose point-set is . Each edge in between two points is realized as the line segment , and is assigned a weight equal to the Euclidean distance . In this paper, we show how to construct in time a plane spanner of of maximum degree at most 4 and stretch factor at most 20. This improves a long sequence of results on the construction of plane spanners of . Our result matches the smallest known upper bound of 4 by Bonichon et al. on the maximum degree of plane spanners of , while significantly improving their stretch factor upper bound from 156.82 to 20. The construction of our spanner is based on Delaunay triangulations defined with respect to the equilateral-triangle distance, and uses a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
