DocumentCode :
936912
Title :
On the shape of a set of points in the plane
Author :
Edelsbrunner, Herbert ; Kirkpatrick, David G. ; Seidel, Raimund
Volume :
29
Issue :
4
fYear :
1983
fDate :
7/1/1983 12:00:00 AM
Firstpage :
551
Lastpage :
559
Abstract :
A generalization of the convex hull of a finite set of points in the plane is introduced and analyzed. This generalization leads to a family of straight-line graphs, " 
-shapes," which seem to capture the intuitive notions of "fine shape" and "crude shape" of point sets. It is shown that a-shapes are subgraphs of the closest point or furthest point Delaunay triangulation. Relying on this result an optimal 
algorithm that constructs -shapes is developed.
-shapes," which seem to capture the intuitive notions of "fine shape" and "crude shape" of point sets. It is shown that a-shapes are subgraphs of the closest point or furthest point Delaunay triangulation. Relying on this result an optimal algorithm that constructs -shapes is developed.Keywords :
Geometry; Image analysis, shape; Image shape analysis; Computer science; Concrete; Helium; Logic; Nearest neighbor searches; Pattern recognition; Shape; Sorting; Terminology; Visualization;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1983.1056714
Filename :
1056714
Link To Document :
