An optimal algorithm for computing angle-constrained spanners

DOI10.20382/JOCG.V3I1A10MaRDI QIDQ2968092zbMATHOpenAlexFDO

Authors Paz Carmi, Michiel Smid

Publication date 9 March 2017

Full work available at URL https://doaj.org/article/9d8f5c1eec9d4f7b9ec5b9851c4c7f16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An optimal algorithm for computing angle-constrained spanners
• Angle-constrained spanners with angle at least \(\pi/3\)
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• Efficient construction of a bounded-degree spanner with low weight
• scientific article; zbMATH DE number 1617269

Cited in

(6)

• A simple and efficient method for accelerating construction of the gap-greedy spanner
• Average stretch factor: how low does it go?
• Vertex Fault-Tolerant Geometric Spanners for Weighted Points
• Angle-constrained spanners with angle at least \(\pi/3\)
• An optimal algorithm for computing angle-constrained spanners
• Vertex fault-tolerant spanners for weighted points in polygonal domains

This page was built for publication: An optimal algorithm for computing angle-constrained spanners

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