Three-dimensional unstructured mesh generation. III: Volume meshes

DOI10.1016/0045-7825(95)00918-3MaRDI QIDQ1371881zbMATH OpenOpenAlexFDO

Authors R. W. Lewis, Yao Zheng, D. T. Gethin

Publication date 14 December 1997

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(95)00918-3

zbMATH Keywords

algorithminterior point creationnon-convex geometriesnumerical experimentsperformancesmoothingsurface meshestriangulationunstructured mesh generationvolume meshes

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Recommendations

• Three-dimensional unstructured mesh generation. II: Surface meshes
• On advancing front mesh generation in three dimensions
• scientific article; zbMATH DE number 1748481
• NETGEN: An advancing front 2D/3D-mesh generator based on abstract rules

Cites work

• A paradigm for robust geometric algorithms
• An apporach to automatic three-dimensional finite element mesh generation
• Automatic mesh generator with specified boundary
• Constructing strongly convex approximate hulls with inaccurate primitives
• Constructing strongly convex hulls using exact or rounded arithmetic
• Delaunay triangulation in computational fluid dynamics
• Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation
• Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
• Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
• FEView: An interactive visualization tool for finite elements
• Relationship between tetrahedron shape measures
• Shape reconstruction and volume meshing for complex solids
• The integrity of geometrical boundaries in the two-dimensional delaunay triangulation
• Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation
• Three-dimensional unstructured mesh generation. II: Surface meshes
• Three‐dimensional adaptive finite element computations and applications to non‐Newtonian fluids
• Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation

Cited in

(13)

• Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation
• Three-dimensional unstructured mesh generation. II: Surface meshes
• Unstructured tetrahedral mesh quality analysis using an interactive haptic and visual interface
• A novel approach of three-dimensional hybrid grid methodology. I: Grid generation.
• Algorithm for three-dimensional curved block cutting analysis in solid modeling
• Improved boundary constrained tetrahedral mesh generation by shell transformation
• Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation
• Efficient unstructured quadrilateral mesh generation
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
• Automatic metric advancing front triangulation over curved surfaces
• Size complexity of volume meshes vs. surface meshes
• scientific article; zbMATH DE number 862654 (Why is no real title available?)
• Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time

Describes a project that uses

Uses Software

• Forms library
• FEView

This page was built for publication: Three-dimensional unstructured mesh generation. III: Volume meshes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1371881)