Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models (Q1912141)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models |
scientific article; zbMATH DE number 873991
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models |
scientific article; zbMATH DE number 873991 |
Statements
Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models (English)
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
0 references
0.9025039
0 references
0.88156784
0 references
0.87950045
0 references
0.8690124
0 references
