Computing a minimum-width square annulus in arbitrary orientation
Author:
- 29 March 2018
- journal article
- conference paper
- Published by Elsevier in Theoretical Computer Science
- Vol. 718, 2-13
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Offset polygon and annulus placement problemsComputational Geometry, 2014
- Minimum-width rectangular annulusTheoretical Computer Science, 2013
- An optimal algorithm for finding an enclosing planar rectilinear annulus of minimum widthOperations Research Letters, 2009
- Approximating extent measures of pointsJournal of the ACM, 2004
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUSInternational Journal of Computational Geometry & Applications, 2002
- Offset-polygon annulus placement problemsComputational Geometry, 1998
- Computing constrained minimum-width annuli of point setsComputer-Aided Design, 1998
- Efficient randomized algorithms for some geometric optimization problemsDiscrete & Computational Geometry, 1996
- Applications of Parametric Searching in Geometric OptimizationJournal of Algorithms, 1994
- Finding the upper envelope of n line segments in O(n log n) timeInformation Processing Letters, 1989