Ruppert's algorithm: Difference between revisions

Revision as of 18:33, 29 April 2010

Revision as of 16:43, 19 May 2010

Line 32:

"Ruppert's algorithm for two-dimensional quality mesh generation is perhaps the first theoretically guaranteed meshing algorithm to be truly satisfactory in practice."<ref>{{cite web | last = Shewchuk | first = Jonathan | title = Ruppert's Delaunay Refinement Algorithm | url = http://www.cs.cmu.edu/~quake/tripaper/triangle3.html | accessdate = April 2010}}</ref>

Jim Ruppert discovered this algorithm in the early 1990s.<ref>{{cite journal | first=Jim | last=Ruppert | title=A Delaunay refinement algorithm for quality 2-dimensional mesh generation | journal=Journal of Algorithms | year=1995 | issue=3 | pages= 548-585548–585 | volume=18}}</ref>

Since then, various small improvements have been made.<ref>{{cite conference | first1=Gary | last1=Miller | first2=Steven | last2=Pav | first3=Noel | last3=Walkington | title=When and why Ruppert's algorithm works | booktitle=Proceedings of the 12th International Meshing Roundtable | year=2003 | pages=91-10291–102}}</ref>

An extension of Ruppert's algorithm in two dimensions is implemented in the freely available (yet non-[[Free software|free]]) [http://www.cs.cmu.edu/~quake/triangle.html Triangle] package.