Issue No. 10 - October (1997 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.625128
<p><b>Abstract</b>—The Voronoi diagram (VD) is a popular tool for partitioning the support of an image. An algorithm is presented for constructing VD when the seed set, which determines the Voronoi regions, can be modified by adding <it>and</it> removing seeds. The number of pixels and seeds revisited for updating the diagram and the neighbor relationships among seeds is minimized. A result on cocircular seeds is presented. The adjacency, or <it>dual</it>, graph of the VD is readily obtained. The use of the algorithm for constructing <it>skeletons by influence zones</it> is demonstrated.</p>
Incremental method, degenerate seed configuration, image segmentation, Euclidean distance function, point-location problem.
R. E. Sequeira and F. J. Prêteux, "Discrete Voronoi Diagrams and the SKIZ Operator: A Dynamic Algorithm," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 19, no. , pp. 1165-1170, 1997.