Ruppert's algorithm: Difference between revisions

Revision as of 15:15, 15 April 2010

Revision as of 18:33, 29 April 2010

Line 33:

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-585 | volume=18}}</ref>

Since then, various small improvements have been made.<ref>{{cite conference | firstfirst1=Gary | lastlast1=Miller | coauthorsfirst2=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-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.