You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
30 December 1994Iterative algorithm for computing the shape of a finite set of points
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.
The alert did not successfully save. Please try again later.
Mahmound Melkemi, 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