DocumentCode
1252764
Title
Discrete Voronoi diagrams and the SKIZ operator: a dynamic algorithm
Author
Sequeira, Raul E. ; Prêteux, Fraçnoise J.
Author_Institution
Motorola CIG, Arlington Heights, IL, USA
Volume
19
Issue
10
fYear
1997
fDate
10/1/1997 12:00:00 AM
Firstpage
1165
Lastpage
1170
Abstract
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 and 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 dual, graph of the VD is readily obtained. The use of the algorithm for constructing skeletons by influence zones (SKIZ) is demonstrated
Keywords
computational geometry; image segmentation; SKIZ; SKIZ operator; adjacency; discrete Voronoi diagrams; dynamic algorithm; neighbor relationships; pixels; seeds; skeletons by influence zones; Euclidean distance; Heuristic algorithms; Image coding; Image segmentation; Interpolation; Partitioning algorithms; Pattern recognition; Skeleton; Testing; Virtual reality;
fLanguage
English
Journal_Title
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher
ieee
ISSN
0162-8828
Type
jour
DOI
10.1109/34.625128
Filename
625128
Link To Document