DocumentCode :
3173157
Title :
Maximal Zone Diagrams and their Computation
Author :
de Biasi, Sergio Coutinho ; Kalantari, Bahman ; Kalantari, Iraj
Author_Institution :
Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA
fYear :
2010
fDate :
28-30 June 2010
Firstpage :
171
Lastpage :
180
Abstract :
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, Matousek, Tokuyama. Here, we define the more inclusive notion of a maximal zone diagram. The proof of existence of maximal zone diagrams depends on less restrictive initial conditions and is thus conveniently established via Zorn´s lemma in contrast to the use of fixed-point theory in proving the existence of a unique zone diagram. A zone diagram is a particular maximal zone diagram satisfying a unique dominance property. We give a characterization for maximal zone diagrams which allows recognition of maximality of certain subsets called subzone diagrams, as well as that of their iterative improvement toward maximality. Maximal zone diagrams offer their own interesting theoretical and computational challenges.
Keywords :
computational geometry; iterative methods; Euclidean plane; Voronoi diagram; Zorn lemma; dominance property; existence proof; fixed-point theory; maximal zone diagrams; subzone diagrams; unique zone diagram; Character recognition; Computational geometry; Computer science; Euclidean distance; Mathematics; Polynomials; Voronoi diagram; Zorn´s lemma; computational geometry; zone diagram;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Voronoi Diagrams in Science and Engineering (ISVD), 2010 International Symposium on
Conference_Location :
Quebec, QC
Print_ISBN :
978-1-4244-7606-0
Electronic_ISBN :
978-1-4244-7605-3
Type :
conf
DOI :
10.1109/ISVD.2010.10
Filename :
5521422
Link To Document :
بازگشت