On the minimum-area rectangular and square annulus problem
From MaRDI portal
Publication:827319
DOI10.1016/j.comgeo.2020.101697zbMath1468.68261arXiv1904.06832OpenAlexW3045520220MaRDI QIDQ827319
Publication date: 7 January 2021
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.06832
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
Empty squares in arbitrary orientation among points ⋮ Maximum-width empty square and rectangular annulus
Cites Work
- Unnamed Item
- Minimum-width rectangular annulus
- Finding the upper envelope of n line segments in O(n log n) time
- A new algorithm for the largest empty rectangle problem
- On the maximum empty rectangle problem
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
- Computing a minimum-width square or rectangular annulus with outliers
- Computing a minimum-width square annulus in arbitrary orientation
- Efficient randomized algorithms for some geometric optimization problems
- Approximating extent measures of points
- Computing the Largest Empty Rectangle
- Applications of Parametric Searching in Geometric Optimization
- Largest empty rectangle among a point set
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- THE LARGEST EMPTY ANNULUS PROBLEM
- Minimum-width annulus with outliers: circular, square, and rectangular cases
- Maximum-width empty square and rectangular annulus
This page was built for publication: On the minimum-area rectangular and square annulus problem