By Topic

Fast algorithm for computing the shape of a set of digital points

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

2 Author(s)
Melkemi, M. ; LIGIA-LISPI, Univ. Claude Bernard, Villeurbanne, France ; Vandorpe, D.

This paper presents an efficient algorithm to find the shape of a set of digital points. We compute the true digital Voronoi tessellation in O(m2) complexity. The algorithm needs an m×m image and the coordinates of the n initial points. The shape is then computed, in O(n) expected time, as a subgraph of the Delaunay triangulation

Published in:

Image Processing, 1994. Proceedings. ICIP-94., IEEE International Conference  (Volume:1 )

Date of Conference:

13-16 Nov 1994