Computing largest empty circles with location constraints

DOI10.1007/BF01008046MaRDI QIDQ3039008zbMATH OpenOpenAlexFDO

Authors Godfried Toussaint

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

zbMATH Keywords

computational geometryconvex hullfacility locationpolygonsplanar geometrylargest empty circle problem

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Inventory, storage, reservoirs (90B05)

Cites work

• scientific article; zbMATH DE number 3945378 (Why is no real title available?)
• A Note on Locating a Set of Points in a Planar Subdivision
• Algorithms for Reporting and Counting Geometric Intersections
• Applications of a Planar Separator Theorem
• Optimal Search in Planar Subdivisions

Cited in

(22)

• Locating two obnoxious facilities using the weighted maximin criterion
• Maximum-width empty square and rectangular annulus
• Largest empty circle centered on a query line
• On finding a widest empty 1-corner corridor
• Planar expropriation problem with non-rigid rectangular facilities
• Approximating generalized distance functions on weighted triangulated surfaces with applications
• On the Computational Complexity of Linear Discrepancy
• Locational optimization problems solved through Voronoi diagrams
• The obnoxious facility location game with dichotomous preferences
• Local calculation of Voronoi diagrams
• A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
• Undesirable facility location with minimal covering objectives
• Computing an obnoxious anchored segment.
• On finding widest empty curved corridors
• Computing circular separability
• An O\((n \log{}n)\) algorithm for a maxmin location problem
• A bird's eye-view of min-max and max-min functionals
• On Computing a Largest Empty Arbitrarily Oriented Rectangle
• Locating an obnoxious plane
• Computing obnoxious 1-corner polygonal chains
• The generalized yolk point
• THE LARGEST EMPTY ANNULUS PROBLEM

This page was built for publication: Computing largest empty circles with location constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3039008)