UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVES
From MaRDI portal
Publication:4682186
DOI10.1142/S0218195900000152zbMath1074.65514OpenAlexW2147827640MaRDI QIDQ4682186
Publication date: 10 June 2005
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195900000152
numerical methodsmesh generationcomputational geometryrandomized algorithmsDelaunay triangulationsAspect ratioradius-edge ratioweighted Delaunay triangulationswell-spaced points
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Adaptive and quality quadrilateral/hexahedral meshing from volumetric data, A Laguerre Voronoi based scheme for meshing particle systems, Tetrahedral mesh generation based on space indicator functions, Optimal cache-oblivious mesh layouts, An automatic 3D mesh generation method for domains with multiple materials, 3D finite element meshing from imaging data, Surface smoothing and quality improvement of quadrilateral/hexahedral meshes with geometric flow, Quality meshing of implicit solvation models of biomolecular structures, TETRAHEDRON TOPOLOGICAL CHARACTERIZATION WITH APPLICATION IN VOLUMETRIC RECONSTRUCTION, HexDom: polycube-based hexahedral-dominant mesh generation, PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES
Uses Software
Cites Work
- Surface algorithms using bounds on derivatives
- A constrained optimization approach to finite element mesh smoothing
- Anisotropic mesh transformations and optimal error control
- Boolean set operations on non-manifold boundary representation objects
- An apporach to automatic three-dimensional finite element mesh generation
- Mesh Refinement Processes Based on the Generalized Bisection of Simplices
- A new mesh generation scheme for arbitrary planar domains
- A grid generator based on 4-triangles conforming mesh-refinement algorithms
- Laplacian smoothing and Delaunay triangulations
- Convex Decomposition of Polyhedra and Robustness
- Automatic three‐dimensional mesh generation by the finite octree technique
- Paving: A new approach to automated quadrilateral mesh generation
- On the Angle Condition in the Finite Element Method
- Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions
- Mesh Smoothing Using A Posteriori Error Estimates
- Geometric Separators for Finite-Element Meshes
- Three-Dimensional Triangulations from Local Transformations
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- Quality Local Refinement of Tetrahedral Meshes Based on Bisection
- Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations