Lazy constrained tetrahedralization

@inproceedings{ConraudRM1995b,
 abstract = { A new method is proposed for forcing a tetrahedral mesh to respect given triangles. Starting with a tetrahedralization of the triangles vertices, differences between surface mesh and volume mesh are computed and then partitioned into "acceptable" and "unacceptable" subsets. Usual refining mesh techniques are only applied on the "unacceptable" subset, leading to what we cal1 lazy constrained tetrahedralization. The partitioning phase is combinatorial!y made. },
 author = { Conraud, Joël },
 booktitle = { 12th gOcad Meeting },
 month = { "october" },
 publisher = { ASGA },
 title = { Lazy constrained tetrahedralization },
 year = { 1995 }
}