A geometric spanner of segments

DOI10.1142/S0218195910003190MaRDI QIDQ5305063zbMATH OpenOpenAlexFDO

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

Publication date 19 March 2010

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195910003190

zbMATH Keywords

approximation algorithmscomputational geometryminimum sizesegment spannerspanning networkSteiner points

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Geometric Spanner of Segments
• Geometric Spanner of Objects under L 1 Distance
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• Geometric Spanner Networks
• scientific article; zbMATH DE number 1263225

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
• Geometric Spanner Networks
• Optimal spanners for axis-aligned rectangles

Cited in

(7)

• Light orthogonal networks with constant geometric dilation
• Local geometric spanners
• Geometric Spanner Networks
• Geometric Spanner of Objects under L 1 Distance
• Spanners of Complete k-Partite Geometric Graphs
• Geometric Spanner of Segments
• On algorithmic complexity of imprecise spanners

This page was built for publication: A geometric spanner of segments

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