Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
From MaRDI portal
Publication:655203
DOI10.1007/s10852-010-9142-0zbMath1229.68076MaRDI QIDQ655203
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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
90B80: Discrete location and assignment
Related Items
Cites Work
- Facility location problems in the plane based on reverse nearest neighbor queries
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- The one-round Voronoi game
- Finding a guard that sees most and a shop that sells most
- The Voronoi diagram of curved objects
- MAXIMIZING A VORONOI REGION: THE CONVEX CASE
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item