Mollified Zone Diagrams and Their Computation
The notion of the zone diagram of a finite set of points in the Euclidean plane is an interesting and rich variation of the classical Voronoi diagram, introduced by Asano, Matoušek, and Tokuyama . In this paper, we define mollified versions of zone diagram named territory diagram and maximal territory diagram. A zone diagram is a particular maximal territory diagram satisfying a sharp dominance property. The proof of existence of maximal territory diagrams depends on less restrictive initial conditions and is established via Zorn’s lemma in contrast to the use of fixed-point theory in proving the existence of the zone diagram. Our proof of existence relies on a characterization which allows embedding any territory diagram into a maximal one. Our analysis of the structure of maximal territory diagrams is based on the introduction of a pair of dual concepts we call safe zone and forbidden zone. These in turn give rise to computational algorithms for the approximation of maximal territory diagrams. Maximal territory diagrams offer their own interesting theoretical and computational challenges, as well as insights into the structure of zone diagrams. This paper extends and updates previous work presented in .
Keywordscomputational geometry Voronoi diagram zone diagram mollified zone diagram territory diagram maximal territory diagram
Unable to display preview. Download preview PDF.
- 4.de Biasi, S.C., Kalantari, B., Kalantari, I.: Maximal Zone Diagrams and their Computation. In: ISVD 2010, pp. 171–180. IEEE Computer Society (2010)Google Scholar
- 5.Kalantari, B.: Voronoi Diagrams and Polynomial Root-Finding. In: ISVD 2009, pp. 31–40. IEEE Computer Society (2009)Google Scholar
- 6.Kalantari, B.: Polynomial Root-Finding Methods Whose Basins of Attraction Approximate Voronoi Diagram. Discrete & Computational Geometry (2011), doi:10.1007/s00454-011-9330-3Google Scholar
- 7.Reem, D.: An Algorithm for Computing Voronoi Diagrams of General Generators in General Normed Spaces. In: ISVD 2009, pp. 144–152. IEEE Computer Society (2009)Google Scholar