Revision as of 23:40, 4 November 2007 edit RuppertsAlgorithm (talk \| contribs) 115 edits No edit summary ← Previous edit		Revision as of 00:17, 23 December 2007 edit undo BetacommandBot (talk \| contribs) 931,490 edits add uncat, added uncategorised tag using AWB Next edit →
Line 1: {{uncategorized\|date=December 2007}} 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.▼ ▲'''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. Line 17 ⟶ 19: * [[Delaunay Triangulation]] * [[Voronoi diagram]] * [[~~Polygon_mesh~~Polygon mesh]] == References ==

Ruppert's algorithm: Difference between revisions