{"article_type":"original","publisher":"Elsevier","year":"1990","day":"01","date_published":"1990-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0747717108800685?via%3Dihub"}],"title":"Tetrahedrizing point sets in three dimensions","quality_controlled":"1","scopus_import":"1","issue":"3-4","oa_version":"Published Version","publist_id":"2061","intvolume":" 10","language":[{"iso":"eng"}],"page":"335 - 347","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa":1,"article_processing_charge":"No","acknowledgement":"Research of the first author is supported by Amoco Fnd. Fac. Dec. Comput. Sci. 1-6-44862, the second author is supported by NSF Grant ECS 84-10902, and research of the third author is supported in part by ONR Grant N00014-85K0570 and by NSF Grant DMS 8504322.","citation":{"ieee":"H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in three dimensions,” Journal of Symbolic Computation, vol. 10, no. 3–4. Elsevier, pp. 335–347, 1990.","short":"H. Edelsbrunner, F. Preparata, D. West, Journal of Symbolic Computation 10 (1990) 335–347.","ama":"Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. 1990;10(3-4):335-347. doi:10.1016/S0747-7171(08)80068-5","mla":"Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation, vol. 10, no. 3–4, Elsevier, 1990, pp. 335–47, doi:10.1016/S0747-7171(08)80068-5.","apa":"Edelsbrunner, H., Preparata, F., & West, D. (1990). Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. Elsevier. https://doi.org/10.1016/S0747-7171(08)80068-5","ista":"Edelsbrunner H, Preparata F, West D. 1990. Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. 10(3–4), 335–347.","chicago":"Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation. Elsevier, 1990. https://doi.org/10.1016/S0747-7171(08)80068-5."},"date_created":"2018-12-11T12:06:42Z","month":"01","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"last_name":"Preparata","full_name":"Preparata, Franco","first_name":"Franco"},{"last_name":"West","full_name":"West, Douglas","first_name":"Douglas"}],"doi":"10.1016/S0747-7171(08)80068-5","_id":"4060","publication_status":"published","publication":"Journal of Symbolic Computation","abstract":[{"text":"This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in a tetrahedrization of n points in general position in three dimensions, i.e. such that no four points are co-planar, It also presents an algorithm that in O(n log n) time constructs a tetrahedrization of a set of n points consisting of at most 3n-11 tetrahedra.","lang":"eng"}],"volume":10,"date_updated":"2022-02-23T10:10:35Z","type":"journal_article","extern":"1","publication_identifier":{"eissn":["1095-855X"],"issn":["0747-7171"]}}