By Topic

Voronoi tessellation and Delauney triangulation using Euclidean disk growing in Z/sup 2/

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kotropoulos, C. ; Dept. of Electr. Eng., Thessaloniki Univ., Greece ; Pitas, I. ; Maglara, A.

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.<>

Published in:

Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on  (Volume:5 )

Date of Conference:

27-30 April 1993