4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007) (2007)

University of Glamorgan, Pontypridd, Wales

July 9, 2007 to July 11, 2007

ISBN: 0-7695-2869-4

pp: 15-24

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISVD.2007.37

Fran?ois Anton , Technical University of Denmark, Denmark

Darka Mioc , University of New Brunswick, Canada

Christopher Gold , University of Glamorgan, UK

ABSTRACT

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.

INDEX TERMS

null

CITATION

F. Anton, C. Gold and D. Mioc, "The Voronoi diagram of circles made easy,"

*4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)(ISVD)*, University of Glamorgan, Pontypridd, Wales, 2007, pp. 15-24.

doi:10.1109/ISVD.2007.37

CITATIONS