Three-dimensional alpha shapes

From MaRDI portal
Publication:4296530

DOI10.1145/174462.156635zbMATH Open0806.68107arXivmath/9410208OpenAlexW2078290150WikidataQ56813887 ScholiaQ56813887MaRDI QIDQ4296530FDOQ4296530


Authors: E. P. Mücke, Herbert Edelsbrunner Edit this on Wikidata


Publication date: 19 June 1994

Published in: ACM Transactions on Graphics (Search for Journal in Brave)

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 alpha-shapes of a finite point set in Real3. Each shape is a well-defined polytope, derived from the Delaunay triangulation of the point set, with a parameter alphainReal 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.


Full work available at URL: https://arxiv.org/abs/math/9410208




Recommendations





Cited In (only showing first 100 items - show all)





This page was built for publication: Three-dimensional alpha shapes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296530)