Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
DOI10.1007/S10852-010-9142-0zbMATH Open1229.68076OpenAlexW2025032391MaRDI QIDQ655203FDOQ655203
Authors: Bhaswar B. Bhattacharya 
Publication date: 2 January 2012
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/statistics_papers/655
Recommendations
- MAXIMIZING A VORONOI REGION: THE CONVEX CASE
- scientific article; zbMATH DE number 1979535
- scientific article; zbMATH DE number 1766719
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- scientific article; zbMATH DE number 3945378
- Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- The Voronoi diagram of curved objects
- Title not available (Why is that?)
- Facility location problems in the plane based on reverse nearest neighbor queries
- The one-round Voronoi game
- Finding a guard that sees most and a shop that sells most
- MAXIMIZING A VORONOI REGION: THE CONVEX CASE
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655203)
