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

From MaRDI portal
Revision as of 14:33, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models
scientific article

    Statements

    Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models (English)
    0 references
    0 references
    0 references
    13 October 1996
    0 references
    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.
    0 references
    optimal average-case computational complexity
    0 references

    Identifiers