Skip to main content
. Author manuscript; available in PMC: 2013 May 1.
Published in final edited form as: Comput Aided Des. 2012 May 1;44(5):400–412. doi: 10.1016/j.cad.2012.01.002

Figure 2.

Figure 2

A two dimensional illustration of our tetrahedral generation algorithm. Note that the octree subdivision is adaptive in our algorithm. However, we do not show the adaptivity here for simplicity. (a) Computing the signs for each BCC grid; (b) Calculating the cutting points; (c) Detecting the “too close” cutting points; (d) Snapping the “too close” cutting points to the corresponding BCC lattice grids; (e) Decomposing the boundary polyhedra into tetrahedra; (f) Obtaining the final tetrahedral mesh.