Geometric Spanner of Segments

DOI10.1007/978-3-540-77120-3_9MaRDI QIDQ5387747zbMATH OpenOpenAlexFDO

Authors Yang Yang, Yongding Zhu, Jinhui Xu, Naoki Katoh

Publication date 27 May 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77120-3_9

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A geometric spanner of segments
• Geometric Spanner of Objects under L 1 Distance
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• Local geometric spanners
• Geometric Spanner Networks

Cites work

• Classes of graphs which approximate the complete Euclidean graph
• Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• scientific article; zbMATH DE number 4070353 (Why is no real title available?)
• scientific article; zbMATH DE number 1263225 (Why is no real title available?)
• Optimal spanners for axis-aligned rectangles
• Sparse geometric graphs with small dilation

Cited in

(8)

• Light orthogonal networks with constant geometric dilation
• Local geometric spanners
• A lower bound for computing geometric spanners
• Geometric Spanner Networks
• Geometric Spanner of Objects under L 1 Distance
• A geometric spanner of segments
• Lower bounds for computing geometric spanners and approximate shortest paths
• On algorithmic complexity of imprecise spanners

This page was built for publication: Geometric Spanner of Segments

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