{"citation":{"apa":"Edelsbrunner, H. (1989). Spatial triangulations with dihedral angle conditions (pp. 83–89). Presented at the International Workshop on Discrete Algorithms and Complexity, Institute of the Electronics, Information and Communication Enginneers.","chicago":"Edelsbrunner, Herbert. “Spatial Triangulations with Dihedral Angle Conditions,” 83–89. Institute of the Electronics, Information and Communication Enginneers, 1989.","ista":"Edelsbrunner H. 1989. Spatial triangulations with dihedral angle conditions. International Workshop on Discrete Algorithms and Complexity, 83–89.","ieee":"H. Edelsbrunner, “Spatial triangulations with dihedral angle conditions,” presented at the International Workshop on Discrete Algorithms and Complexity, 1989, pp. 83–89.","mla":"Edelsbrunner, Herbert. <i>Spatial Triangulations with Dihedral Angle Conditions</i>. Institute of the Electronics, Information and Communication Enginneers, 1989, pp. 83–89.","ama":"Edelsbrunner H. Spatial triangulations with dihedral angle conditions. In: Institute of the Electronics, Information and Communication Enginneers; 1989:83-89.","short":"H. Edelsbrunner, in:, Institute of the Electronics, Information and Communication Enginneers, 1989, pp. 83–89."},"date_created":"2018-12-11T12:03:54Z","month":"01","article_processing_charge":"No","acknowledgement":"Research was supported by the National Science Foundation under grant CCR-8714565.  The author thanks Thomas Kerkhoven, Raimund Seidel, and Peter Shor for helpful discussions on the material of this paper. ","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_published":"1989-01-01T00:00:00Z","page":"83 - 89","year":"1989","publisher":"Institute of the Electronics, Information and Communication Enginneers","status":"public","day":"01","language":[{"iso":"eng"}],"date_updated":"2022-02-14T14:34:06Z","publist_id":"2836","type":"conference","extern":"1","publication_status":"published","oa_version":"None","abstract":[{"lang":"eng","text":"We study three types of spatial triangulations: Delaunay triangulations, triangulations with non-obtuse dihedral angles, and KJ-triangulations. The latter satisfy a certain angle condition useful for finite element approximation. We show that the condition for Delaunay triangulations is incomparable with the other two conditions, and that triangulations with non-obtuse dihedral angles are necessarily also KJ-triangulations. These relationships are in sharp contrast to the ones in the planar case. "}],"conference":{"name":"International Workshop on Discrete Algorithms and Complexity"},"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"}],"main_file_link":[{"url":"https://ipsj.ixsq.nii.ac.jp/ej/?action=pages_view_main&active_action=repository_view_main_item_detail&item_id=32670&item_no=1&page_id=13&block_id=8"}],"_id":"3549","title":"Spatial triangulations with dihedral angle conditions","quality_controlled":"1"}