Title :
Voronoi tessellation and Delauney triangulation using Euclidean disk growing in Z/sup 2/
Author :
Kotropoulos, C. ; Pitas, I. ; Maglara, A.
Author_Institution :
Dept. of Electr. Eng., Thessaloniki Univ., Greece
Abstract :
A novel approximation of Euclidean distance in Z/sup 2/ is proposed, and a novel algorithm for the computation of Voronoi tessellation and Delauney triangulation is presented based on this approximation. The proposed method has low computational complexity (of order O(1/N)) and allows parallel implementation. Mathematical morphology is used to implement the Voronoi tessellation and the Delauney triangulation.<>
Keywords :
computational complexity; computational geometry; image segmentation; mathematical morphology; parallel algorithms; Delauney triangulation; Euclidean disk growing; Voronoi tessellation; algorithm; approximation of Euclidean distance; computational complexity; mathematical morphology;
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on
Conference_Location :
Minneapolis, MN, USA
Print_ISBN :
0-7803-7402-9
DOI :
10.1109/ICASSP.1993.319739
