Development and implementation of algorithms for constrained volume triangulations: iterative algorithms

Three main families of iterative algorithms for free and constrained simplicial volume triangulation are described: boundary correction (including ‘octree’ algorithm), Delaunay-based methods and advancing front approach. For each method type an example algorithm is given.