Iterative algorithm for computing the shape of a finite set of points

Mahmound Melkemi; D. Vandorpe

doi:10.1117/12.196759

30 December 1994 Iterative algorithm for computing the shape of a finite set of points

Mahmound Melkemi, D. Vandorpe

Proceedings Volume 2315, Image and Signal Processing for Remote Sensing; (1994) https://doi.org/10.1117/12.196759
Event: Satellite Remote Sensing, 1994, Rome, Italy

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available