Generalized sweeping line spanners

DOI10.1016/j.tcs.2024.114390OpenAlexW4390770465MaRDI QIDQ6201325

Keenan Lee, André van Renssen

Publication date: 20 February 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114390

zbMATH Keywords

computational geometryspannersobstaclessweeping line\( \Theta \)-graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• On plane geometric spanners: a survey and open problems
• Theta-3 is connected
• Ordered theta graphs
• Improved bounds on the spanning ratio of the theta-5-graph
• Towards tight bounds on theta-graphs: more is not always better
• On plane constrained bounded-degree spanners
• Bounded-degree spanners in the presence of polygonal obstacle
• The \(\varTheta_5\)-graph is a spanner
• On the Stretch Factor of the Theta-4 Graph
• Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
• Geometric Spanner Networks
• Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints
• Generalized sweeping line spanners

This page was built for publication: Generalized sweeping line spanners