Publication:4344904
From MaRDI portal
DOI<3519::AID-NME12>3.0.CO;2-O 10.1002/(SICI)1097-0207(19961030)39:20<3519::AID-NME12>3.0.CO;2-OzbMath0881.73128MaRDI QIDQ4344904
Publication date: 19 February 1998
Delaunay triangulationnon-convex geometrynon-manifold topologyautomatic mesh generalizationtetrahedral mesh geometrytopological compatibility
Finite element methods applied to problems in solid mechanics (74S05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items
An efficient optimization procedure for tetrahedral meshes by chaos search algorithm, 2D and 3D finite element meshing and remeshing
Cites Work
- Construction of three-dimensional Delaunay triangulations using local transformations
- Finite element mesh generation methods: A review and classification
- Constrained Delaunay triangulations
- An apporach to automatic three-dimensional finite element mesh generation
- Selective refinement: A new strategy for automatic node placement in graded triangular meshes
- Geometry-based fully automatic mesh generation and the delaunay triangulation
- Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
- Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation
- The advancing‐front mesh generation method revisited
- A combined octree/delaunay method for fully automatic 3‐D mesh generation
