Chew's second algorithm

In mesh generation, Chew's second algorithm is an algorithm for creating quality constrained Delaunay triangulations. The algorithm takes a piecewise linear system (PLS) and returns a constrained Delaunay triangulation of only quality triangles. A triangle is considered poor-quality if it has a circumradius to shortest edge ratio larger than some prescribed threshold. It is a Delaunay refinement algorithm like the prototypical Ruppert's algorithm.

^[1] ^[2]

Chew's second algorithm is the default quality mesh generator implemented in the freely available Triangle package.

References

^ Shewchuk, Jonathan (2002). "Delaunay refinement algorithms for triangular mesh generation". Computational Geometry: Theory and Applications. 22 (1–3): 21–74.
^ Chew, L. Paul (1993). "Guaranteed-quality mesh generation for curved surfaces". Proceedings of the Ninth Annual Symposium on Computational Geometry. pp. 274–280. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)

External links

Shewchuk, Jonathan. "Triangle: A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator". Retrieved April 2010. {{cite web}}: Check date values in: |accessdate= (help)

[1] Shewchuk, Jonathan (2002). "Delaunay refinement algorithms for triangular mesh generation". Computational Geometry: Theory and Applications. 22 (1–3): 21–74.

[2] Chew, L. Paul (1993). "Guaranteed-quality mesh generation for curved surfaces". Proceedings of the Ninth Annual Symposium on Computational Geometry. pp. 274–280. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)

[1]

[2]