Maximum-width empty square and rectangular annulus
From MaRDI portal
Abstract: An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty annulus problem asks to find an annulus of a certain shape with the maximum possible width that avoids a given set of points in the plane. This problem can also be interpreted as the problem of finding an optimal location of a ring-shaped obnoxious facility among the input points. In this paper, we study square and rectangular variants of the maximum-width empty anuulus problem, and present first nontrivial algorithms. Specifically, our algorithms run in and time for computing a maximum-width empty axis-parallel square and rectangular annulus, respectively. Both algorithms use only space.
Recommendations
Cited in
(8)- Finding the maximum empty axis-parallel rectangular annulus
- Minimum Width Rectangular Annulus
- The Largest Empty Annulus Problem
- Minimum-width annulus with outliers: circular, square, and rectangular cases
- Maximum-width empty square and rectangular annulus
- Maximum-width rainbow-bisecting empty annulus
- On the minimum-area rectangular and square annulus problem
- Largest empty circle centered on a query line
This page was built for publication: Maximum-width empty square and rectangular annulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919657)