A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION

DOI10.1142/S0218195901000699zbMath1074.68646WikidataQ57869846 ScholiaQ57869846MaRDI QIDQ4682153

No author found.

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

Delaunay triangulationsunstructured mesh generation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Delaunay refinement for piecewise smooth complexes ⋮ Flow and transport in three-dimensional discrete fracture matrix models using mimetic finite difference on a conforming multi-dimensional mesh ⋮ Delaunay meshing of piecewise smooth complexes without expensive predicates ⋮ Conforming Delaunay triangulations in 3D ⋮ QUALITY MESHING OF POLYHEDRA WITH SMALL ANGLES ⋮ DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D ⋮ A Gabriel-Delaunay triangulation of 2D complex fractured media for multiphase flow simulations ⋮ Unnamed Item ⋮ FraC: a new conforming mesh method for discrete fracture networks ⋮ Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations ⋮ Variable resolution Poisson-disk sampling for meshing discrete fracture networks

Cites Work

• An upper bound for conforming Delaunay triangulations
• Constrained Delaunay triangulations
• Centroidal Voronoi Tessellations: Applications and Algorithms
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation

This page was built for publication: A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION