Jump to content

Chew's second algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by RuppertsAlgorithm (talk | contribs) at 16:03, 12 October 2010 (Just a user draft.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mesh generation, Chew's second algorithm 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.

[1]

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

See also

References

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