A GEOMETRIC SPANNER OF SEGMENTS

DOI10.1142/S0218195910003190zbMath1232.65041OpenAlexW2097488966MaRDI QIDQ5305063

Yongding Zhu, Naoki Katoh, Jinhui Xu, Yang Yang

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

Steiner pointscomputational geometryapproximation algorithmsminimum sizespanning networksegment spanner

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: A GEOMETRIC SPANNER OF SEGMENTS