On Tetrahedralisations of Reduced Chazelle Polyhedra with Interior Steiner Points. (2016)

• Record Type: Journal Article
• Authors: Si, Hang; Goerigk, Nadja
• Is Part Of: Procedia engineering. Volume 163(2016)
• Page Start: 33
• Page End: 45
• Publication Date: 2016
• Subjects: Non-convex polyhedron -- Indecomposable polyhedron -- tetrahedralisation -- Chazelle polyhedron -- Schönhardt polyhedron -- Steiner points -- edge flip; Engineering -- Congresses; Engineering -- Periodicals; Engineering; Conference proceedings; Periodicals; 620.005
• DOI: 10.1016/j.proeng.2016.11.013
• Languages: English
• ISSNs: 1877-7058

Abstract

Abstract: The non-convex polyhedron constructed by Chazelle, known as the Chazelle polyhedron [4], establishes a quadratic lower bound on the minimum number of convex pieces for the 3d polyhedron partitioning problem. In this paper, we study the problem of tetrahedralising the Chazelle polyhedron without modifying its exterior boundary. It is motivated by a crucial step in tetrahedral mesh generation in which a set of arbitrary constraints (edges or faces) need to be entirely preserved. The goal of this study is to gain more knowledge about the family of 3d indecomposable polyhedra which needs additional points, so-called Steiner points, to be tetrahedralised. The requirement of only using interior Steiner points for the Chazelle polyhedron is extremely challenging. We first "cut off" the volume of the Chazelle polyhedron by removing the regions that are tetrahedralisable. This leads to a 3d non-convex polyhedron whose vertices are all in the two slightly shifted saddle surfaces which are used to construct the Chazelle polyhedron. We call it the reduced Chazelle polyhedron . It is an indecomposable polyhedron. We then give a set of ( N + 1) 2 interior Steiner points that ensures the existence of a tetrahedralisation of the reduced Chazelle polyhedron with 4( N + 1) vertices. The proof is done by transforming a 3d tetrahedralisation problem into a 2d edge flip problem. In particular, we design an edge splitting and flipping algorithm and prove that it gives to a tetrahedralisation of the reduced Chazelle polyhedron.