Share Email Print

Proceedings Paper

Iterative algorithm for computing the shape of a finite set of points
Author(s): Mahmound Melkemi; D. Vandorpe
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 30 December 1994
PDF: 12 pages
Proc. SPIE 2315, Image and Signal Processing for Remote Sensing, (30 December 1994); doi: 10.1117/12.196759
Show Author Affiliations
Mahmound Melkemi, Univ. Lyon I-Claude Bernard (France)
D. Vandorpe, Univ. Lyon I-Claude Bernard (France)

Published in SPIE Proceedings Vol. 2315:
Image and Signal Processing for Remote Sensing
Jacky Desachy, Editor(s)

© SPIE. Terms of Use
Back to Top