We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

K-Voronoi diagrams computing in arbitrary domains

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

4 Author(s)
Cardenes, R. ; Dept. Ingenieria Telematica, Univ. de Las Palmas de GC, Spain ; Warfield, S.K. ; Mewes, A.J.U. ; Ruiz-Alzola, J.

A novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains is proposed. The algorithm is based on a fast ordered propagation distance transformation called occlusion points propagation geodesic distance transformation (OPPGDT) which is robust and linear in the domain size, and has higher accuracy than other geodesic distance transformations published before. Our approach has proved to have a computational complexity of order O(k.m) with m the domain size and k the order of the diagram. Voronoi diagrams have been extensively used in many areas and we show here that Voronoi diagrams computed in nonconvex domains, are extremely useful for the segmentation of medical images. We validated our algorithm with a set of 2D and 3D synthetic nonconvex domains, and with the segmentation of a medical dataset showing its robustness and performance.

Published in:

Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on  (Volume:2 )

Date of Conference:

14-17 Sept. 2003