Automatic unstructured grid generators
References (106)
- et al.
Adaptive remeshing for compressible flow computations
J. Comp. Phys.
(1987) Finite element mesh generation over curved surfaces
Comp. Sttruc.
(1988)- et al.
Parallel unstructured grid generation
Comp. Meth. Appl. Mech. Eny.
(1992) - et al.
A new algorithm for three-dimensional Voronoi tesselation
J. Comp. Phys.
(1983) - et al.
An implementation of Watson's algorithm for computing 2-dimensional Delaunay triangulation
Adv. Eng. Software
(1984) - et al.
Triangulation of scattered data in 3D space
Comp. Aided Geom. Des.
(1988) Adaptive mesh generation for viscous flows using Delaunay triangulation
J. Comp. Phys.
(1990)- et al.
Fully automatic mesh generation for 3D domains of any shape
Impact of Comput. Sci. Eng.
(1990) - et al.
Automatic mesh generator with specified boundary
Comp. Meth. Appl. Mech. Eng.
(1991) Delaunay triangulation in computation fluid dynamics
Comp. Math. Appl.
(1992)
An adaptive finite element scheme for transient problems in CFD
Comp. Meth. Appl. Mech. Eng.
Three-dimensional fluid-structure interaction using a finite element solver and adaptive remeshing
Comp. Sys. in Eng.
Developments and trends in three-dimensional mesh generation
Appl. Num. Math.
Construction of three-dimensional Delaunay triangulations using local transformations
ComputerAided Geometric Des.
Efficient unstructured mesh generation by means of Delaunay triangulation and Bowyer-Watson algorithm
J. Comp. Phys.
An adaptive finite element solver for transient problems with moving bodies
Comp. Struct.
Recent experiences with error estimation and adaptivity; Part 1: Review of error estimators for scalar elliptic problems
Comp. Meth. Appl. Mech. Eng.
Automatic mesh generation with tetrahedron elements
Int. J. Num. Meth. Eng.
A new mesh Generation scheme for arbitrary planar domains
Int. J. Num. Meth. Eng.
Finite element Euler calculations in three dimensions
Int. J. Num. Eny.
Some useful data structures for the generation of unstructured grids
Comm. Appl. Num. Mech.
Three-dimensional grid generation by the advancing front method
Int. J. Num. Meth. Fluids
The generation of triangular meshes on surfaces
Unstructured finite element mesh generation and adaptive procedures for CFD
AGARD-CP-464
Génération de Maillage Automatique clans les Configurations Tridimensionelles Complexes Utilisation d'une Méthode de ‘Front’
AGARD-CP-464
A new approach to the development of automatic quadrilateral grid generation
Int. J. Num. Meth. Eny.
Generation of unstructured tetrahedral meshes by the advancing front technique
Int. J. Num. Meth. End.
Advancing front mesh generation techniques with application to the finite element method
Direct surface triangulation using the advancing front method
AIAA-95-1686CP
Unstructured surface grid generation on unstructured quilt of patches
AIAA-95-2202
Paving: A new approach to automated quadrilateral mesh generation
Int. J. Num. Meth. Eng.
Seams and wedges in plastering: A 3-D hexahedral mesh generation algorithm
Eng. Comput.
Automatic triangulation of arbitrary planar domains for the finite element method
Int. J. Num. Meth. Eng.
Two algorithms for constructing a Delaunay triangulation
Int. J. Comp. Inf. Sci.
Computing Dirichlet tesselations
The Comput. J.
Computing the N-dimensional Delaunay tesselation with application to Voronoi polytopes
The Comput. J.
An approach to automatic three-dimensional finite element generation
Int. J. Num. Meth. Eng.
Nearest Neighbor Algorithm
Three-dimensional finite element mesh generation using Delaunay tesselations
IEEE Trans. on Magnetics
Three-dimensional mesh generation by triangulation of arbitrary point sets
The generation of unstructured triangular meshes using Delaunay triangulation
Delaunay's mesh of a convex polyhedron in dimension d. Application to arbitrary polyhedra
Int. J. Num. Meth. Eng.
Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
Int. J. Num. Meth. Eng.
The Delaunay triangulation - from the early work in Princeton
A frontal approach for internal node generation in Delaunay triangulations
Int. J. Num. Meth. Eng.
Cited by (137)
A robust workflow for b-rep generation from image masks
2023, Graphical Modelsχ-MeRA: Computationally efficient adaptive mesh refinement of Monte Carlo mesh based tallies
2023, Annals of Nuclear EnergyCitation Excerpt :This example easily shows the increased computational efficiency created through the use of an AMR algorithm. To accomplish this refinement, there are three components of an AMR algorithm: an error indicator, an optimal mesh criteria, and an algorithm to refine and coarsen the mesh as indicated (Löhner, 1997). Taking each of these components in turn, the error indicator, typically computed based on the error associated with the solution method for the partial differential equation (PDE), is used as the value compared to a refinement criteria.
Application of CFD plug-ins integrated into urban and building design platforms for performance simulations: A literature review
2023, Frontiers of Architectural ResearchAn improved contact detection algorithm for bonded particles based on multi-level grid and bounding box in DEM simulation
2020, Powder TechnologyCitation Excerpt :The cost of spatial ordering is positively related to the number of objects n. For systems that cannot make assumptions about the spatial consistency of an object, sorting requires multiple operations. Common spatial sorting methods include: grid subdivision [7], adaptive grid [12], octree method, body based cells, spatial heapsort and other methods. By determining the relative order of the spatial arrangement of the particles, these methods eliminate particles that are too far away from the target particles (the particles are impossible to be in contact with the target object because they are too far from it).
Voxelization-based high-efficiency mesh generation method for parallel CFD code GASFLOW-MPI
2018, Annals of Nuclear EnergyCitation Excerpt :In unstructured meshes, various shapes, like triangle in 2d domains, prism and tetrahedron in 3d domains, are used to construct the mesh. Techniques like the advancing front method and Delaunay triangulation (Löhner, 1997) make it possible for the user to obtain the mesh by a “one-click” operation thus avoiding the complicated multi-parameter tuning. However, a huge number of cells and poor mesh quality often associated with unstructured meshes results in shortcomings with respect to the calculation speed and precision of the computation.
An adaptive mesh refinement method for a medium with discrete fracture network: The enriched Persson's method
2014, Finite Elements in Analysis and DesignCitation Excerpt :Though there also exist various smoothing and improving methods of triangulation, the Laplacian smoothing [9–11], some optimization-based smoothing schemes [12–14], the priori-based approach [15], the geometric element transformation method [16] and so on, most of them cannot handle problems with complex interior fractures. Detailed discussion can be referred in articles [16–18]. Another alternative but different way to construct complex geometries of discrete fracture networks is the meshfree or meshless method.