Spatial triangulations with dihedral angle conditions
Edelsbrunner H. 1989. Spatial triangulations with dihedral angle conditions. International Workshop on Discrete Algorithms and Complexity, 83–89.
Download
No fulltext has been uploaded. References only!
Conference Paper
| Published
| English
Author
Abstract
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.
Publishing Year
Date Published
1989-01-01
Publisher
Institute of the Electronics, Information and Communication Enginneers
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.
Page
83 - 89
Conference
International Workshop on Discrete Algorithms and Complexity
IST-REx-ID
Cite this
Edelsbrunner H. Spatial triangulations with dihedral angle conditions. In: Institute of the Electronics, Information and Communication Enginneers; 1989:83-89.
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.
Edelsbrunner, Herbert. “Spatial Triangulations with Dihedral Angle Conditions,” 83–89. Institute of the Electronics, Information and Communication Enginneers, 1989.
H. Edelsbrunner, “Spatial triangulations with dihedral angle conditions,” presented at the International Workshop on Discrete Algorithms and Complexity, 1989, pp. 83–89.
Edelsbrunner H. 1989. Spatial triangulations with dihedral angle conditions. International Workshop on Discrete Algorithms and Complexity, 83–89.
Edelsbrunner, Herbert. Spatial Triangulations with Dihedral Angle Conditions. Institute of the Electronics, Information and Communication Enginneers, 1989, pp. 83–89.
Link(s) to Main File(s)
Access Level
Closed Access
Google Scholar