--- res: bibo_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 article introduces the formal notion of the family of alpha-shapes of a finite point set in R3. Each shape is a well-defined polytope, derived from the Delaunay triangulation of the point set, with a parameter alpha is-an-element-of R 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(n2), worst case. A robust implementation of the algorithm is discussed, and several applications in the area of scientific computing are mentioned.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Herbert foaf_name: Edelsbrunner, Herbert foaf_surname: Edelsbrunner foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-9823-6833 - foaf_Person: foaf_givenName: Ernst foaf_name: Mücke, Ernst foaf_surname: Mücke bibo_doi: 10.1145/174462.156635 bibo_issue: '1' bibo_volume: 13 dct_date: 1994^xs_gYear dct_language: eng dct_publisher: ACM@ dct_title: Three-dimensional alpha shapes@ ...