Euclidean chains and their shortcuts

DOI10.1016/j.tcs.2012.03.021zbMath1417.05142OpenAlexW2155175290MaRDI QIDQ391221

Boting Yang

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.021

zbMATH Keywords

diametercomputational geometryEuclidean graph

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (8)

Minimizing the continuous diameter when augmenting a geometric tree with a shortcut ⋮ Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees ⋮ Shortcuts for the circle ⋮ Shortcut sets for plane Euclidean networks (extended abstract) ⋮ Computing optimal shortcuts for networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Shortcut sets for the locus of plane Euclidean networks

Cites Work

• Unnamed Item
• Facility location and the geometric minimum-diameter spanning tree.
• Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree
• Algorithms for Reporting and Counting Geometric Intersections
• Comments on “algorithms for reporting and counting geometric intersections”
• Minimum Diameter Spanning Trees and Related Problems

This page was built for publication: Euclidean chains and their shortcuts