## Three-dimensional Alpha Shapes (1994)

### Cached

### Download Links

- [arxiv.org]
- [ftp.ncsa.uiuc.edu]
- [www.geom.uiuc.edu]
- [comptop.stanford.edu]
- [www.cs.jhu.edu]
- [www.cs.jhu.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 465 - 34 self |

### BibTeX

@MISC{Edelsbrunner94three-dimensionalalpha,

author = {Herbert Edelsbrunner and Ernst P. Mücke},

title = {Three-dimensional Alpha Shapes},

year = {1994}

}

### Years of Citing Articles

### OpenURL

### Abstract

Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the "shape" of the set. For that purpose, this paper introduces the formal notion of the family of ff-shapes of a finite point set in R³. Each shape is a well-defined polytope, derived from the Delaunay triangulation of the point set, with a parameter ff 2 IR controlling the desired level of detail. An algorithm is presented that constructs the entire family of shapes for a given set of size n in time O(n²), worst case. A robust implementation of the algorithm is discussed and several applications in the area of scientific computing are mentioned.