{"citation":{"apa":"Edelsbrunner, H., &#38; Mücke, E. (1994). Three-dimensional alpha shapes. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/174462.156635\">https://doi.org/10.1145/174462.156635</a>","chicago":"Edelsbrunner, Herbert, and Ernst Mücke. “Three-Dimensional Alpha Shapes.” <i>ACM Transactions on Graphics</i>. ACM, 1994. <a href=\"https://doi.org/10.1145/174462.156635\">https://doi.org/10.1145/174462.156635</a>.","ista":"Edelsbrunner H, Mücke E. 1994. Three-dimensional alpha shapes. ACM Transactions on Graphics. 13(1), 43–72.","ieee":"H. Edelsbrunner and E. Mücke, “Three-dimensional alpha shapes,” <i>ACM Transactions on Graphics</i>, vol. 13, no. 1. ACM, pp. 43–72, 1994.","mla":"Edelsbrunner, Herbert, and Ernst Mücke. “Three-Dimensional Alpha Shapes.” <i>ACM Transactions on Graphics</i>, vol. 13, no. 1, ACM, 1994, pp. 43–72, doi:<a href=\"https://doi.org/10.1145/174462.156635\">10.1145/174462.156635</a>.","short":"H. Edelsbrunner, E. Mücke, ACM Transactions on Graphics 13 (1994) 43–72.","ama":"Edelsbrunner H, Mücke E. Three-dimensional alpha shapes. <i>ACM Transactions on Graphics</i>. 1994;13(1):43-72. doi:<a href=\"https://doi.org/10.1145/174462.156635\">10.1145/174462.156635</a>"},"extern":"1","year":"1994","title":"Three-dimensional alpha shapes","date_created":"2018-12-11T12:06:34Z","page":"43 - 72","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/10.1145/174462.156635"}],"publist_id":"2088","publisher":"ACM","acknowledgement":"National Science Foundation under grant CCR-8921421 and  Alan T. Waterman award, grant CCR-9118874.","quality_controlled":"1","publication_status":"published","month":"01","language":[{"iso":"eng"}],"scopus_import":"1","day":"01","type":"journal_article","publication":"ACM Transactions on Graphics","_id":"4037","volume":13,"status":"public","doi":"10.1145/174462.156635","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"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.","lang":"eng"}],"date_published":"1994-01-01T00:00:00Z","date_updated":"2022-06-02T12:00:42Z","issue":"1","oa_version":"None","oa":1,"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"full_name":"Mücke, Ernst","first_name":"Ernst","last_name":"Mücke"}],"article_processing_charge":"No","intvolume":"        13"}