Chew's second algorithm: Difference between revisions

Revision as of 16:05, 12 October 2010

Revision as of 16:07, 12 October 2010

Line 1:

In [[mesh generation]], '''Chew's second algorithm algorithm''' is an [[algorithm]] for creating quality constrained [[Delaunay triangulation]]s. 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]].

<ref>{{cite journal | first1=Jonathan | last1=Shewchuk | title=Delaunay refinement algorithms for triangular mesh generation | journal=Computational Geometry: Theory and Applications | year=2002 | volume=22 | issue=1-3 | pages=21–74}}</ref>

Chew's second algorithm is the default quality mesh generator implemented in the freely available [http://www.cs.cmu.edu/~quake/triangle.html Triangle] package.

== See also ==

* [[Ruppert's_Algorithm|Ruppert's Algorithm]]

* [[Voronoi diagram]]

* [[Polygon mesh]]

== References ==