On the minimum-area rectangular and square annulus problem
Author:
- 29 July 2020
- journal article
- research article
- Published by Elsevier in Computational Geometry
- Vol. 92, 101697
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Kyonggi University (2018)
This publication has 16 references indexed in Scilit:
- 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
- THE LARGEST EMPTY ANNULUS PROBLEMInternational Journal of Computational Geometry & Applications, 2003
- Largest empty rectangle among a point setJournal of Algorithms, 2003
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUSInternational Journal of Computational Geometry & Applications, 2002
- Applications of Parametric Searching in Geometric OptimizationJournal of Algorithms, 1994
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness errorComputer-Aided Design, 1992
- A new algorithm for the largest empty rectangle problemAlgorithmica, 1990
- Finding the upper envelope of n line segments in O(n log n) timeInformation Processing Letters, 1989
- On the maximum empty rectangle problemDiscrete Applied Mathematics, 1984