Filters

2015 - 20162

More filters

2019 - 201912020 - 20221
Reset filters

Settings

Type: Text × Subject: tetrahedralisation ×

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    On Tetrahedralisations of Reduced Chazelle Polyhedra with Interior Steiner Points
    (Amsterdam [u.a.] : Elsevier, 2016) Si, Hang; Goerigk, Nadja
    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.
  • Thumbnail Image
    Item
    On tetrahedralisations of reduced Chazelle polyhedra with interior Steiner points
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2015) Si, Hang; Goerigk, Nadja
    The polyhedron constructed by Chazelle, known as Chazelle polyhedron [4], is an important example in many partitioning problems. In this paper, we study the problem of tetrahedralising a Chazelle polyhedron without modifying its exterior boundary. It is motivated by a crucial step in 3d finite element mesh generation in which a set of arbitrary boundary constraints (edges or faces) need to be entirely preserved. We first reduce the volume of a Chazelle polyhedron by removing the regions that are tetrahedralisable. This leads to a 3d polyhedron which may not be tetrahedralisable unless extra points, so-called Steiner points, are added. We call it a reduced Chazelle polyhedron. We define a set of interior Steiner points that ensures the existence of a tetrahedralisation of the reduced Chazelle polyhedron. Our proof uses a natural correspondence that any sequence of edge flips converting one triangulation of a convex polygon into another gives a tetrahedralization of a 3d polyhedron which have the two triangulations as its boundary. Finally, we exhibit a larger family of reduced Chazelle polyhedra which includes the same combinatorial structure of the Schönhardt polyhedron. Our placement of interior Steiner points also applies to tetrahedralise polyhedra in this family.