Revision as of 23:31, 4 November 2007 edit RuppertsAlgorithm (talk \| contribs) 115 edits No edit summary ← Previous edit		Revision as of 23:40, 4 November 2007 edit undo RuppertsAlgorithm (talk \| contribs) 115 edits No edit summary Next edit →
Line 1: 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