Translator Disclaimer
Paper
30 December 1994 Iterative algorithm for computing the shape of a finite set of points
Author Affiliations +
Abstract
A new method is introduced whereby the shape of a finite set of points in the plane is computed. The shape is approximated by a sequence of sets named k-connected hulls. We present an efficient algorithm for constructing the shape of a set of points. This algorithm is based on the relationship between the k-connected hulls sets an the Voronoi diagram.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mahmound Melkemi and D. Vandorpe "Iterative algorithm for computing the shape of a finite set of points", Proc. SPIE 2315, Image and Signal Processing for Remote Sensing, (30 December 1994); https://doi.org/10.1117/12.196759
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Contour detection combined with depth information
Proceedings of SPIE (December 14 2015)
A new corner detecting method based on contourlet transfrom
Proceedings of SPIE (October 30 2009)
Dynamic generalized Hough transform
Proceedings of SPIE (August 01 1990)
Local level set segmentation method combined with narrow band
Proceedings of SPIE (November 15 2007)

Back to Top