Maximizing a voronoi region: The convex case
Public Deposited- Resource Type
- Creator
- Abstract
Given a set S of s points in the plane, where do we place a new point, p, in order to maximize the area of its region in the Voronoi diagram of S and p? We study the case where the Voronoi neighbors of p are in convex position, and prove that there is at most one local maximum.
- Language
- Publisher
- Identifier
- Citation
- Dehne, F, Klein, R. (Rolf), & Seidel, R. (Raimund). (2002). Maximizing a voronoi region: The convex case. doi:10.1007/3-540-36136-7_54
- Date Created
- 2002-12-01
Relations
- In Collection:
Items
Thumbnail | Title | Date Uploaded | Visibility | Actions |
---|---|---|---|---|
|
Voronoi-Region.pdf | 2022-08-26 | Public | Download |