Computing largest empty circles with location constraints
From MaRDI portal
Publication:3039008
DOI10.1007/BF01008046zbMath0525.90039OpenAlexW1969583227MaRDI QIDQ3039008
Publication date: 1983
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01008046
convex hullfacility locationcomputational geometrypolygonsplanar geometrylargest empty circle problem
Inventory, storage, reservoirs (90B05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items
Computing circular separability ⋮ Local calculation of Voronoi diagrams ⋮ A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty ⋮ On finding a widest empty 1-corner corridor ⋮ On finding widest empty curved corridors ⋮ On Computing a Largest Empty Arbitrarily Oriented Rectangle ⋮ THE LARGEST EMPTY ANNULUS PROBLEM ⋮ A bird's eye-view of min-max and max-min functionals ⋮ The obnoxious facility location game with dichotomous preferences ⋮ Approximating generalized distance functions on weighted triangulated surfaces with applications ⋮ Computing an obnoxious anchored segment. ⋮ The generalized yolk point ⋮ On the Computational Complexity of Linear Discrepancy ⋮ An O\((n \log{}n)\) algorithm for a maxmin location problem ⋮ Largest empty circle centered on a query line ⋮ Planar expropriation problem with non-rigid rectangular facilities ⋮ Locating an obnoxious plane ⋮ Maximum-width empty square and rectangular annulus ⋮ Undesirable facility location with minimal covering objectives ⋮ Locational optimization problems solved through Voronoi diagrams ⋮ Computing obnoxious 1-corner polygonal chains ⋮ Locating two obnoxious facilities using the weighted maximin criterion
Cites Work
