Great post! One thing to note with tetrahedral decomposition is that while you can always triangulate non-self-intersecting 2D boundaries into triangulations, u

Great post! One thing to note with tetrahedral decomposition is that while you can always triangulate non-self-intersecting 2D boundaries into triangulations, using just the boundary verts, this doesn't extend to 3D boundaries and tetrahedral decompositions. You will sometimes need to add extra 'steiner' vertices. Maybe not directly relevant to the context in the link, but it's something I found unintuitive, and a trap to watch out for. See http://www.ics.uci.edu/~eppstein/junkyard/untetra/ http://www.ics.uci.edu/~eppstein/junkyard/untetra/, and https://en.wikipedia.org/wiki/Sch%C3%B6nhardt_polyhedron https://en.wikipedia.org/wiki/Sch%C3%B6nhardt_polyhedron for some concrete examples.