Dynamic algorithms for geometric spanners of small diameter: Randomized solutions

DOI10.1016/S0925-7721(99)00014-0zbMath0937.68137OpenAlexW2082551413MaRDI QIDQ1807649

David M. Mount, Sunil Arya, Michiel H. M. Smid

Publication date: 7 March 2000

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00014-0

zbMATH Keywords

\(t\)-spanner path

Mathematics Subject Classification ID

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

Related Items (17)

On the Power of the Semi-Separated Pair Decomposition ⋮ A GEOMETRIC SPANNER OF SEGMENTS ⋮ Ordered theta graphs ⋮ Local routing algorithms on Euclidean spanners with small diameter ⋮ Geometric Spanner of Objects under L 1 Distance ⋮ Vertex Fault-Tolerant Geometric Spanners for Weighted Points ⋮ On the power of the semi-separated pair decomposition ⋮ An Optimal Dynamic Spanner for Doubling Metric Spaces ⋮ A spanner for the day after ⋮ Geometric Spanner of Segments ⋮ Matching point sets with respect to the earth mover's distance ⋮ Conic nearest neighbor queries and approximate Voronoi diagrams ⋮ Unnamed Item ⋮ Vertex fault-tolerant spanners for weighted points in polygonal domains ⋮ Temporal cliques admit sparse spanners ⋮ Fully dynamic geometric spanners ⋮ Temporal Cliques Admit Sparse Spanners

This page was built for publication: Dynamic algorithms for geometric spanners of small diameter: Randomized solutions