Geometry-based fully automatic mesh generation and the delaunay triangulation

DOI10.1002/NME.1620261109MaRDI QIDQ3813401zbMATH OpenOpenAlexWikidataFDO

Authors William J. Schroeder, Mark S. Shephard

Publication date 1988

Published in International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nme.1620261109

zbMATH Keywords

curved geometryDelaunay triangulationfully automatic mesh generationmesh topology of greater dimensionthree-dimensional planar geometrytopology compatibilitytwo and three dimensions

Mathematics Subject Classification ID

Finite element methods applied to problems in solid mechanics (74S05)

Recommendations

• Automatic mesh generator using the Delaunay-Voronoï principle
• Delaunay refinement algorithms for triangular mesh generation
• Fully automatic mesh generator for 3D domains of any shape
• An integrated approach for automated generation of two/three dimensional finite element grids using spatial occupancy enumeration and delaunay triangulation
• ASPECTS OF 2-D DELAUNAY MESH GENERATION

Cites work

• Computing Dirichlet Tessellations in the Plane

Cited in

(26)

• Automatic mesh generation allowing for efficient a priori and a posteriori mesh refinement
• Automatic triangular mesh generation of trimmed parametric surfaces for finite element analysis
• Delaunay triangulation of arbitrarily shaped planar domains
• An automatic coarse and fine surface mesh generation scheme based on medial axis transform. I: Algorithms
• Automatic two- and three-dimensional mesh generation based on fuzzy knowledge processing
• Delaunay triangulation in computational fluid dynamics
• Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation
• An automatic coarse and fine surface mesh generation scheme based on medial axis transform. II: Implementation
• Solid modeling aspects of three-dimensional fragmentation
• Automatic mesh generator using the Delaunay-Voronoï principle
• Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation
• Characterizing and efficiently computing quadrangulations of planar point sets
• Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation
• On a finite element method with variable element topology
• Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models
• A material based finite element analysis of heterogeneous media involving Dirichlet tessellations
• Generation of three-dimensional Delaunay meshes from weakly structured and inconsistent data
• AN AUTOMATIC TETRAHEDRAL MESH GENERATION SCHEME BY THE ADVANCING FRONT METHOD
• scientific article; zbMATH DE number 1205927 (Why is no real title available?)
• scientific article; zbMATH DE number 1036609 (Why is no real title available?)
• scientific article; zbMATH DE number 1131777 (Why is no real title available?)
• Automatic metric 3D surface mesh generation using subdivision surface geometrical model. Part 1: Construction of underlying geometrical model
• Quadrangulations of planar sets
• Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
• Reliability of automatic 3D mesh generation
• A new front updating solution applied to some engineering problems

This page was built for publication: Geometry-based fully automatic mesh generation and the delaunay triangulation

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