BSP-Assisted constrained tetrahedralization

Proceedings, 12th International Meshing Roundtable, Sandia National Laboratories, pp.251-260, Sept. 2003

MESHING
RESEARCH
CORNER

12th International Meshing Roundtable
September 14-17, 2003
Santa Fe, New Mexico, U.S.A.

BioMedIA Lab, CSIRO ICT Centre, Sydney, Australia
University of New South Wales, Sydney, Australia
Bhautik.Joshi@csiro.au; Sebastien.Ourselin@csiro.au

Abstract
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them together. We generate a Binary Space Partition (BSP) tree from the triangular faces of a polyhedron and use this to identify the convex subpolyhedra in the polyhedron. Each convex subpolyhedron is tetrahedralized individually. Using an original merging process, the boundaries between these subpolyhedra are joined and tetrahedralized, ensuring that no tetrahedra are created outside of the original polyhedron in the merging process.

Download Full Paper (PDF Format)