Ruppert's algorithm: Difference between revisions

Revision as of 00:17, 23 December 2007

Revision as of 14:28, 23 December 2007

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.

Line 25 ⟶ 24:

* G. L. Miller, S. E. Pav, and N. J. Walkington. When and why Ruppert's algorithm works. In Proceedings of the 12th International Meshing Roundtable, pages 91-102. Sandia National Laboratory, September 2003.

* J. Ruppert. A delaunay refinement algorithm for quality 2-dimensional mesh generation, 1995.

[[Category:Geometric algorithms]]