Revision as of 06:18, 24 December 2007 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits m →See also ← Previous edit		Revision as of 02:24, 27 January 2008 edit undo RuppertsAlgorithm (talk \| contribs) 115 edits No edit summary Next edit →
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. The algorithm consists of two main operations.

Ruppert's algorithm: Difference between revisions