MAXIMIZING A VORONOI REGION: THE CONVEX CASE

DOI10.1142/S0218195905001786zbMath1093.68654OpenAlexW2134408180MaRDI QIDQ5709135

Rolf Klein, Raimund Seidel, Frank Dehne

Publication date: 29 November 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195905001786

zbMATH Keywords

optimizationComputational geometryVoronoi diagramlocational planning

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

The discrete Voronoi game in \(\mathbb{R}^2\) ⋮ Solving the \(k\)-influence region problem with the GPU ⋮ Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand ⋮ Optimal strategies for the one-round discrete Voronoi game on a line ⋮ Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location ⋮ Witness (Delaunay) graphs ⋮ The 1-dimensional discrete Voronoi game

Cites Work

• The one-round Voronoi game
• Competitive facility location: the Voronoi game
• Existence of equilibrium configurations of competitive firms on an infinite two-dimensional space
• Unnamed Item

This page was built for publication: MAXIMIZING A VORONOI REGION: THE CONVEX CASE