loading...
The Voronoi diagram of circles made easy
University of Glamorgan, Pontypridd, Wales July 09-July 11
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISVD.2007.374th International Symposium on Vorono ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fran?ois Anton, Technical University of Denmark, Denmark
Darka Mioc, University of New Brunswick, Canada
Christopher Gold, University of Glamorgan, UK
Proximity queries among circles could be effectively answered if the Delaunay graph for sets of circles could be computed in an efficient and exact way. In this paper, we first show a necessary and sufficient condition of connectivity of the Voronoi diagram of circles. Then, we show how the Delaunay graph of circles (the dual graph of the Voronoi diagram of circles) can be computed exactly, and in a much simpler way, by computing the eigenvalues of a two by two matrix.
Citation:
Fran?ois Anton, Darka Mioc, Christopher Gold, "The Voronoi diagram of circles made easy," isvd, pp.15-24, 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions