@CONFERENCE\{IMM2007-05297,
    author       = "F. Anton and D. Mioc and C. Gold",
    title        = "The Voronoi diagram of circles made easy",
    year         = "2007",
    month        = "jul",
    keywords     = "Voronoi diagram, Delaunay graph, Vornoi diagram of circles, exact computation",
    booktitle    = "International Symposium on Voronoi Diagrams in Science and Engineering",
    volume       = "",
    series       = "",
    editor       = "",
    publisher    = "{IEEE} Computer Society",
    organization = "",
    address      = "School of Computing, University of Glamorgan, Pontypridd, Wales, {UK}",
    note         = "Further details to come",
    url          = "http://www2.compute.dtu.dk/pubdb/pubs/5297-full.html",
    abstract     = "Proximity queries among circles could be effec- 
tively 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 Delau- 
nay 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 eigenval- 
ues of a two by two matrix."
}