Ruppert's algorithm: Difference between revisions

Revision as of 05:09, 25 June 2008

Revision as of 19:14, 7 August 2008

Line 1:

In [[mesh generation]], '''Ruppert's algorithm''', also known as '''Delaunay refinement''', is an [[algorithm]] for creating quality [[Delaunay triangulation]]s. The algorithm takes a [[piecewise linear]] system (PLS) and returns a conforming 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.

The algorithm consists of two main operations.

Line 13:

Ruppert's algorithm can be naturally extended to three dimensions, however its output guarantees are somewhat weaker due to the sliver type tetrahedron.

In two dimensions, the poor-quality threshold must be at least &radic;<span style = "text-decoration:overline">''2''</span>. This means that any triangle which contains some angle less than about 20.7 degrees is poor-quality.

== See also ==