Computer Science – Computational Geometry
Scientific paper
2008-06-13
Computer Science
Computational Geometry
Accepted at the conference "17th International Meshing Roundtable", Pittsburgh, Pennsylvania, October 12-15, 2008. Will appear
Scientific paper
A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in which every tetrahedron and every triangle contains its circumcenter in its interior. Such meshes have applications in scientific computing and other fields. We show how to triangulate simple domains using completely well-centered tetrahedra. The domains we consider here are space, infinite slab, infinite rectangular prism, cube and regular tetrahedron. We also demonstrate single tetrahedra with various combinations of the properties of dihedral acuteness, 2-well-centeredness and 3-well-centeredness.
Guoy Damrong
Hirani Anil N.
VanderZee Evan
No associations
LandOfFree
Triangulation of Simple 3D Shapes with Well-Centered Tetrahedra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Triangulation of Simple 3D Shapes with Well-Centered Tetrahedra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Triangulation of Simple 3D Shapes with Well-Centered Tetrahedra will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-494731