The complexity of geodesic spanners

DOI10.4230/LIPICS.SOCG.2023.16MaRDI QIDQ6620503zbMATH OpenFDO

Authors Sarita de Berg, Marc Van Kreveld, Frank Staals

Publication date 16 October 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2023.16

zbMATH Keywords

complexitygeodesic distancepolygonal domainsimple polygonspanner

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The complexity of geodesic spanners
• Geometric Spanners for Points Inside a Polygonal Domain
• Spanners for geodesic graphs and visibility graphs
• Geodesic spanners for points on a polyhedral terrain
• Geodesic spanners for points on a polyhedral terrain

Cited in

(5)

• On algorithmic complexity of imprecise spanners
• Spanners under the Hausdorff and Fréchet distances
• The complexity of geodesic spanners
• A divide-and-conquer based preprocessing for routing in a simple polygon
• The complexity of geodesic spanners using Steiner points

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

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