The -shape of a finite point set S is a polytope that is uniquely determined by S and a parameter . It expresses the intuitive notion of the ``shape'' of S, and controls the level of detail reflected by the polytope. The original paper on -shapes  defines the concept in . An extension to together with an implementation is reported in . In both papers the relationship between -shapes and Delaunay triangulations  is described in detail and used as the basis of an algorithm for constructing alpha shapes.
These algorithms have been implemented and software for and , complete with graphics interface, is publically available. The respective packages can be obtained via ftp from:
The availability of these implementations, in particular the one in , has led to applications in various areas of science and engineering. Some of these applications are briefly described in .
A question that was repeatedly asked in the past is whether it is possible to construct a shape that represents different levels of detail in different parts of space. This is indeed possible by assigning a weight to each point. Intuitively, a large weight favors and a small weight discourages connections to neighboring points. We refer to the resulting concept as the weighted alpha shape. If all weights are zero, it is the same as the original, unweighted alpha shape. The available software is general enough to handle weights, and this document makes no distinction between weighted and unweighted alpha shapes, unless such a distinction is important.
What are the applications where weights can be beneficial?
Outline. Section 2 introduces complexes and shapes via Voronoi decompositions of spherical ball unions. Section 3 defines alpha shapes and their relationship to the (weighted) Delaunay triangulation. Section 4 discusses metric, combinatorial, and topological properties computed by the software. Section 5 reviews some of the essential design decisions in the implementations.