Paper
30 December 1994 Iterative algorithm for computing the shape of a finite set of points
Mahmound Melkemi, D. Vandorpe
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
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Pattern recognition

Analytical research

Biological research

Computer vision technology

Image processing algorithms and systems

Image segmentation

Back to Top