THE LARGEST EMPTY ANNULUS PROBLEM
From MaRDI portal
Publication:4818587
DOI10.1142/S0218195903001207zbMath1093.68127OpenAlexW2105525115MaRDI QIDQ4818587
No author found.
Publication date: 29 September 2004
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195903001207
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Discrete location and assignment (90B80)
Related Items (10)
On the minimum-area rectangular and square annulus problem ⋮ On finding a widest empty 1-corner corridor ⋮ On finding widest empty curved corridors ⋮ Minimum-width rectangular annulus ⋮ Dispersing facilities on planar segment and circle amidst repulsion ⋮ Locating a semi-obnoxious covering facility with repelling polygonal regions ⋮ Minimum Width Rectangular Annulus ⋮ Locating an obnoxious plane ⋮ Maximum-width empty square and rectangular annulus ⋮ Computing obnoxious 1-corner polygonal chains
Cites Work
- Widest empty L-shaped corridor
- Computing circular separability
- Fitting a set of points by a circle
- Computing the smallest \(k\)-enclosing circle and related problems
- Location of an Obnoxious Route
- Computing largest empty circles with location constraints
- Computational Geometry in C
- The K-dense corridor problems
- Applications of Parametric Searching in Geometric Optimization
- Approximation by circles
This page was built for publication: THE LARGEST EMPTY ANNULUS PROBLEM
