scispace - formally typeset
Journal ArticleDOI

Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints

N. P. Weatherill, +1 more
- 30 Jun 1994 - 
- Vol. 37, Iss: 12, pp 2005-2039
TLDR
A method is described which constructs three-dimensional unstructured tetrahedral meshes using the Delaunay triangulation criterion, and the efficiency of the proposed procedure reduces the computer time for the generation of realistic un Structured Tetrahedral grids to the order of minutes on workstations of modest computational capabilities.
Abstract
A method is described which constructs three-dimensional unstructured tetrahedral meshes using the Delaunay triangulation criterion. Several automatic point creation techniques will be highlighted and an algorithm will be presented which can ensure that, given an initial surface triangulation which bounds a domain, a valid boundary conforming assembly of tetrahedra will be produced. Statistics of measures of grid quality are presented for several grids. The efficiency of the proposed procedure reduces the computer time for the generation of realistic unstructured tetrahedral grids to the order of minutes on workstations of modest computational capabilities.

read more

Citations
More filters
Journal ArticleDOI

TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator

TL;DR: The essential algorithms and techniques used to develop TetGen are presented, including an efficient tetrahedral mesh data structure, a set of enhanced local mesh operations, and filtered exact geometric predicates, which can robustly handle arbitrary complex 3D geometries and is fast in practice.

A Survey of Unstructured Mesh Generation Technology.

TL;DR: A brief survey of some of the fundamental algorithms in unstructured mesh generation is presented, including a discussion and categorization of triangle, tetrahedral, quadrilateral and hexahedral mesh generation methods currently in use in academia and industry.
Proceedings ArticleDOI

Filling holes in meshes

TL;DR: A method for filling holes in unstructured triangular meshes with arbitrary holes in oriented connected manifold meshes that interpolate the shape and density of the surrounding mesh.
Journal ArticleDOI

Tetrahedral mesh optimisation and adaptivity for steady-state and transient finite element calculations

TL;DR: The paper presents applications of the method to complex, steady-state and time-dependent problems which highlight its anisotropic, feature-capturing abilities.
Book ChapterDOI

Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations

Hang Si, +1 more
TL;DR: A method to decompose an arbitrary 3D piecewise linear complex (PLC) into a constrained Delaunay tetrahedralization (CDT) by updating the input PLC into another PLC which is topologically and geometrically equivalent to the original one and does have a CDT.
References
More filters
Journal ArticleDOI

Adaptive remeshing for compressible flow computations

TL;DR: An adaptive mesh procedure for improving the quality of steady state solutions of the Euler equations in two dimensions is described, implemented in conjunction with a finite element solution algorithm, using linear triangular elements, and an explicit time-stepping scheme.
Journal ArticleDOI

Generation of three-dimensional unstructured grids by the advancing-front method

TL;DR: This technique has been shown to be effective for the generation of unstructured grids in two dimensions, but its extension to three-dimensional regions required algorithms to define the surface and suitable data structures that avoid excessive CPU-time overheads for the search operations involved.
Related Papers (5)