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

DOI10.1016/0045-7825(93)90006-JzbMath0847.73067MaRDI QIDQ1912141

Renato Perucchio, Nickolas S. Sapidis

Publication date: 13 October 1996

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7825(93)90006-j

zbMATH Keywords

optimal average-case computational complexity

Mathematics Subject Classification ID

74S05: Finite element methods applied to problems in solid mechanics

65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs

Related Items

Geometric modeling of spatial constraints: objectives, methods and solid-modeling requirements, Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain, 2D and 3D finite element meshing and remeshing

Cites Work

• Unnamed Item
• Unnamed Item
• Advanced techniques for automatic finite element meshing from solid models
• Delaunay triangulation of arbitrarily shaped planar domains
• Solid/solid classification operations for recursive spatial decomposition and domain triangulation of solid models
• Implementation of a divide-and-conquer method for intersection of parametric surfaces
• Tetrahedrizing point sets in three dimensions
• Automatic mesh generation from solid models based on recursive spatial decompositions
• An algorithm for generating solid elements in objects with holes
• Geometry-based fully automatic mesh generation and the delaunay triangulation
• DOMAIN DELAUNAY TETRAHEDRIZATION OF SOLID MODELS
• Automatic three‐dimensional mesh generation by the finite octree technique
• Graded tetrahedral finite element meshes