Towards Plane Spanners of Degree 3
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille,, Anil Maheshwari, and Michiel Smid

TL;DR
This paper introduces algorithms for constructing plane spanners with maximum degree 3 for points in convex position, rectangular lattices, and general position, achieving specific stretch factors and linear Steiner points.
Contribution
It provides new algorithms for degree-3 plane spanners with explicit stretch factors for various point configurations, including convex, lattice, and general positions.
Findings
Constructed a plane (3+4π)/3-spanner for convex points with degree 3.
Developed a plane 3√2-spanner for rectangular lattice points with degree 3.
Presented methods to compute degree-3 spanners with linear Steiner points for general position points.
Abstract
Let be a finite set of points in the plane that are in convex position. We present an algorithm that constructs a plane -spanner of whose vertex degree is at most 3. Let be the vertex set of a finite non-uniform rectangular lattice in the plane. We present an algorithm that constructs a plane -spanner for whose vertex degree is at most 3. For points that are in the plane and in general position, we show how to compute plane degree-3 spanners with a linear number of Steiner points.
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.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Numerical Analysis Techniques · graph theory and CDMA systems
