Ruppert's algorithm: Difference between revisions

Revision as of 18:04, 30 September 2010

Revision as of 18:07, 30 September 2010

Line 41:

| last1 = Pav | first1 = Steven

| last2 = Walkington | first2 = Noel

| title= Delaunay Refinementrefinement by Cornercorner Loppinglopping

| booktitle= Proceedings of the 14th International Meshing Roundtable

| pages = 165-181

Line 47:

Ruppert's algorithm can be naturally extended to three dimensions, however its output guarantees are somewhat weaker due to the sliver type tetrahedron.

An extension of Ruppert's algorithm in two dimensions is implemented in the freely available [http://www.cs.cmu.edu/~quake/triangle.html Triangle] package. Two variants of Ruppert's algorithm in this package are guaranteed to terminate for a poor-quality threshold of about 26.5 degrees. <ref>{{cite journal | first1=Jonathan | last1=Shewchuk | title=Delaunay Refinementrefinement Algorithmsalgorithms for Triangulartriangular Meshmesh Generationgeneration | journal=Computational Geometry: Theory and Applications | year=2002 | volume=22 | issue=1-3 | pages=21–74}}</ref> In practice these algorithms are successful for poor-quality thresholds over 30 degrees.