A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
DOI10.1142/S0218195901000699zbMATH Open1074.68646DBLPjournals/ijcga/MurphyMG01WikidataQ57869846 ScholiaQ57869846MaRDI QIDQ4682153FDOQ4682153
Authors:
Publication date: 10 June 2005
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Cites Work
Cited In (15)
- Automatic and efficient hybrid viscous mesh generation based on clipped Voronoi diagrams
- DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D
- FraC: a new conforming mesh method for discrete fracture networks
- QUALITY MESHING OF POLYHEDRA WITH SMALL ANGLES
- Delaunay refinement for piecewise smooth complexes
- Conforming Delaunay triangulations in 3D
- Title not available (Why is that?)
- A Gabriel-Delaunay triangulation of 2D complex fractured media for multiphase flow simulations
- Conforming Delaunay triangulations in 3D
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations
- Variable resolution Poisson-disk sampling for meshing discrete fracture networks
This page was built for publication: A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682153)