The complexity of geodesic spanners using Steiner points

DOI10.4230/LIPICS.ISAAC.2024.25MaRDI QIDQ7260639zbMATH OpenFDO

Authors Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms

Publication date 8 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2024.25

zbMATH Keywords

complexitygeodesic distancepolygonal domainsimple polygonspanner

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• An Optimal Dynamic Spanner for Doubling Metric Spaces
• Constructing plane spanners of bounded degree and low weight
• Efficient Regression in Metric Spaces via Approximate Lipschitz Extension
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Geodesic spanners for points on a polyhedral terrain
• Geometric Spanner Networks
• Geometric Spanners for Points Inside a Polygonal Domain
• scientific article; zbMATH DE number 1263225 (Why is no real title available?)
• scientific article; zbMATH DE number 1775403 (Why is no real title available?)
• Light Euclidean Steiner spanners in the plane
• Narrow-Shallow-Low-Light Trees with and without Steiner Points
• Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
• New Doubling Spanners: Better and Simpler
• On Euclidean vehicle routing with allocation
• On hierarchical routing in doubling metrics
• On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs
• On plane geometric spanners: a survey and open problems
• Optimal Euclidean Spanners
• The complexity of geodesic spanners
• Truly optimal Euclidean spanners

This page was built for publication: The complexity of geodesic spanners using Steiner points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7260639)