Publication:4344898
From MaRDI portal
DOI<3407::AID-NME5>3.0.CO;2-C 10.1002/(SICI)1097-0207(19961030)39:20<3407::AID-NME5>3.0.CO;2-CzbMath0883.73086MaRDI QIDQ4344898
No author found.
Publication date: 23 March 1998
convex hull; Delaunay triangulation; acceleration procedures; randomly generated points; HP 735 workstation; layering scheme; Voronoï tesselation
65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
65M50: Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs
76M99: Basic methods in fluid mechanics
74S99: Numerical and other methods in solid mechanics
Related Items
A new point creation scheme for uniform Delaunay triangulation, A Class of Novel Tetrahedron Elements with Curved Surfaces for Three-Dimensional Solid Mechanics Problems with Curved Boundaries, TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator, Tetrahedral mesh optimisation and adaptivity for steady-state and transient finite element calculations, A ten node tetrahedral Cosserat point element (CPE) for nonlinear isotropic elastic materials, Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains, Parallel Delaunay triangulation in three dimensions, Boundary recovery for three dimensional conforming Delaunay triangulation, Adjoint a posteriori error measures for anisotropic mesh optimisation, Solid modeling aspects of three-dimensional fragmentation, Improvement on the 10-node tetrahedral element for three-dimensional problems, Generalized prism grid: a pillar-based unstructured grid for simulation of reservoirs with complicated geological geometries, 3D Delaunay mesh generation coupled with an advancing-front approach, Generation of finite element mesh with variable size over an unbounded 2D domain, Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain, Recent progress in robust and quality Delaunay mesh generation, 2D and 3D finite element meshing and remeshing, Variational surface reconstruction based on Delaunay triangulation and graph cut
Cites Work
- Properties of \(n\)-dimensional triangulations
- Automatic mesh generator with specified boundary
- The integrity of geometrical boundaries in the two-dimensional delaunay triangulation
- Two algorithms for constructing a Delaunay triangulation
- Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
- Computing Dirichlet Tessellations in the Plane
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
- Fully automatic mesh generator for 3D domains of any shape
