Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models (Q1912141): Difference between revisions

This paper introduces a recursive spatial decomposition (RSD) tetrahedrization procedure, based on the domain Delaunay tetrahedrization (DDT) method that has an optimal average-case computational complexity. A complete description of the RSD/DDT mesh generation algorithm is presented along with a comparison with existing techniques as well as examples that demonstrate the robustness and efficiency of the method.