Voronoi diagrams are important in many applications that range from theoretical computing to computational geometry, to computer graphics and computer vision. The relatively new problem of computing the Voronoi diagram for a set of geometry primitives with non-zero areas, rather than a set of points, is considerably more challenging. This paper deals with the case when the geometry primitives are a set of disks. Applications of these include pattern generation and circle packing.

The technique proposed in the paper is an intelligent extension of the existing work with a focus on being topologically sound. This paper is interesting not only for researchers in computational geometry, computer graphics, and computer vision, but also software developers and numerical simulation practitioners, due to the application of Voronoi diagrams with domain tessellation and meshing.