@article{4128,
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, "alpha-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 optimalO(n log n)algorithm that constructsalpha-shapes is developed.},
author = {Herbert Edelsbrunner and Kirkpatrick, David G and Seidel, Raimund},
journal = {IEEE Transactions on Information Theory},
number = {4},
pages = {551 -- 559},
publisher = {IEEE},
title = {{On the shape of a set of points in the plane}},
doi = {10.1109/TIT.1983.1056714 },
volume = {29},
year = {1983},
}