Maximum-width empty square and rectangular annulus
From MaRDI portal
Publication:5918102
DOI10.1016/j.comgeo.2021.101747OpenAlexW2962856853MaRDI QIDQ5918102
Arpita Baral, Priya Ranjan Sinha Mahapatra, Sang Won Bae
Publication date: 16 September 2021
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.06217
lower envelopesegment dragging queryorthogonal range queryrectangular empty annulussquare empty annulus
Related Items (1)
Cites Work
- Unnamed Item
- Minimum-width rectangular annulus
- Finding the upper envelope of n line segments in O(n log n) time
- Widest empty L-shaped corridor
- On the minimum-area rectangular and square annulus problem
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
- On finding a widest empty 1-corner corridor
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
- Computing a minimum-width square annulus in arbitrary orientation
- Computing largest empty circles with location constraints
- Applications of Parametric Searching in Geometric Optimization
- THE LARGEST EMPTY ANNULUS PROBLEM
This page was built for publication: Maximum-width empty square and rectangular annulus