Shortcutting the Diameter of a Polygon
- 14 February 2026
- book chapter
- Published by Springer Nature
- p. 418-431
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Algorithms for radius-optimally augmenting trees in a metric spaceComputational Geometry, 2023
- Augmenting graphs to minimize the radiusComputational Geometry, 2023
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcutComputational Geometry, 2020
- Computing optimal shortcuts for networksEuropean Journal of Operational Research, 2019
- Fast Algorithms for Diameter-Optimally Augmenting Paths2015
- Augmenting Graphs to Minimize the DiameterAlgorithmica, 2014
- Euclidean chains and their shortcutsTheoretical Computer Science, 2013
- CONSTRUCTING OPTIMAL HIGHWAYSInternational Journal of Foundations of Computer Science, 2009
- An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygonsInformation Processing Letters, 2001
- Triangulating a simple polygon in linear timeDiscrete & Computational Geometry, 1991