Title :
Fast algorithm for computing the shape of a set of digital points
Author :
Melkemi, M. ; Vandorpe, D.
Author_Institution :
LIGIA-LISPI, Univ. Claude Bernard, Villeurbanne, France
Abstract :
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
Keywords :
computational complexity; computational geometry; image recognition; Delaunay triangulation; O(m2) complexity; digital Voronoi tessellation; digital points; fast algorithm; shape computation; subgraph; Computational geometry; Computer applications; Digital images; Image reconstruction; Image segmentation; Joining processes; Pattern recognition; Shape;
Conference_Titel :
Image Processing, 1994. Proceedings. ICIP-94., IEEE International Conference
Conference_Location :
Austin, TX
Print_ISBN :
0-8186-6952-7
DOI :
10.1109/ICIP.1994.413406
