Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain

DOI10.1016/j.cma.2004.11.022zbMath1093.65017MaRDI QIDQ2495793

Yanyan Li

Publication date: 30 June 2006

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cma.2004.11.022

zbMATH Keywords

numerical examples; Delaunay triangulation; tetrahedral mesh; sphere packing; frontal surface; descend by rotation; unbounded 3D domain

Mathematics Subject Classification ID

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)

Related Items

A fast and practical method to pack spheres for mesh generation, Parallel Delaunay triangulation in three dimensions, A novel three-dimensional mesh deformation method based on sphere relaxation, New 3D geometrical deposition methods for efficient packing of spheres based on tangency

Uses Software

• Q-Morph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear programming algorithm to test for jamming in hard-sphere packings
• The dimensional family approach in (hyper)sphere packing: A typological study of new patterns, structures, and interdimensional functions
• Automatic mesh generator with specified boundary
• Automatic mesh generation on a regular background grid.
• 3D Delaunay mesh generation coupled with an advancing-front approach
• A remeshing algorithm based on bubble packing method and its application to large deformation problems.
• Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
• Monte Carlo study of the sphere packing problem
• Linear-size nonobtuse triangulation of polygons
• Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models
• Generation of finite element mesh with variable size over an unbounded 2D domain
• Fast Delaunay triangulation in three dimensions
• A new scheme for the generation of a graded quadrilateral mesh
• Delaunay triangulation of non-convex planar domains
• The integrity of geometrical boundaries in the two-dimensional delaunay triangulation
• An apporach to automatic three-dimensional finite element mesh generation
• A new mesh generation scheme for arbitrary planar domains
• Generation of three‐dimensional unstructured grids by the advancing‐front method
• A new approach to the development of automatic quadrilateral mesh generation
• Volume discretization into tetrahedra—II. 3D triangulation by advancing front approach
• Finite element mesh generation over analytical curved surfaces
• Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
• Faster Circle Packing with Application to Nonobtuse Triangulation
• Optimization of tetrahedral meshes based on element shape measures
• Filling domains with disks: an advancing front approach
• Orbits of Orbs: Sphere Packing Meets Penrose Tilings
• QUADRILATERAL MESHING BY CIRCLE PACKING
• ANISOTROPIC TRIANGULATION OF PARAMETRIC SURFACES VIA CLOSE PACKING OF ELLIPSOIDS
• Hexagonal and trigonal sphere packings. II. Bivariant lattice complexes
• STUDY OF THE UNEQUAL SPHERES PACKING PROBLEM: AN APPLICATION TO RADIOSURGERY TREATMENT