Quality meshing for polyhedra with small angles

Authors:
Siu-Wing Cheng;Tamal K. Dey;Edgar A. Ramos;Tathagata Ray
Affiliations:
HKUST, Hong Kong;Ohio State U.;UIUC;Ohio State U.
Venue:
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Year:
2004

Citing 13
Cited 10

Provably good mesh generation

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A Delaunay refinement algorithm for quality 2-dimensional mesh generation

SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
A Delaunay based numerical method for three dimensions: generation, formulation, and partition

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Guaranteed-quality Delaunay meshing in 3D (short version)

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Tetrahedral mesh generation by Delaunay refinement

Proceedings of the fourteenth annual symposium on Computational geometry
Mesh generation for domains with small angles

Proceedings of the sixteenth annual symposium on Computational geometry
Quality Mesh Generation in Higher Dimensions

SIAM Journal on Computing
Silver exudation

Journal of the ACM (JACM)
Generating well-shaped Delaunay meshed in 3D

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Geometry and topology for mesh generation

Geometry and topology for mesh generation
Conforming Delaunay triangulations in 3D

Proceedings of the eighteenth annual symposium on Computational geometry
Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Quality Meshing with Weighted Delaunay Refinement

SIAM Journal on Computing

Variational tetrahedral meshing

ACM SIGGRAPH 2005 Papers
On the sizes of Delaunay meshes

Computational Geometry: Theory and Applications
Variational tetrahedral meshing

SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
A generic software design for Delaunay refinement meshing

Computational Geometry: Theory and Applications
On the sizes of Delaunay meshes

Computational Geometry: Theory and Applications
Efficient and good Delaunay meshes from random points

Computer-Aided Design
Horizontal decomposition of triangulated solids for the simulation of dip-coating processes

Computer-Aided Design
Subdividing alpha complex

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Quality tetrahedral mesh generation for macromolecules

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Size competitive meshing without large angles

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm to compute a Delaunay mesh conforming to a polyhedron possibly with small input angles. The radius-edge ratio ofmost output tetrahedra are bounded by a constant, except possibly those that are provably close to small angles. Further, the mesh is graded, that is, edge lengths are at least a constant fraction of the local feature sizes at the edge endpoints. Unlike a previous algorithm, this algorithm is simple to implement as it avoids computing local feature sizes and protective zones explicitly. Our experimental results confirm our claims and show that few skinny tetrahedra remain.