Revision as of 20:59, 1 August 2010 edit RuppertsAlgorithm (talk \| contribs) 115 edits Switching to journal reference ← Previous edit		Revision as of 21:00, 1 August 2010 edit undo Citation bot (talk \| contribs) Bots 5,864,789 edits m Citations: [178]Tweaked: doi. User-activated. Next edit →
Line 33: Jim Ruppert discovered this algorithm in the early 1990s.<ref>{{cite journal \| doi=10.1006/jagm.1995.1021 \| 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 journal\| doi=10.1142/S0218195905001592\| first1=Gary \| last1=Miller \| first2=Steven \| last2=Pav \| first3=Noel \| last3=Walkington \| title=When and why Delaunay refinement algorithms work \| journal=International Journal of Computational Geometry and Applications \| year=2005 \| volume=15 \| issue=1 \| pages=~~25-54~~25–54}}</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.

Ruppert's algorithm: Difference between revisions