Ruppert's algorithm: Difference between revisions

Revision as of 00:05, 22 February 2012

Revision as of 20:26, 31 May 2012

Line 54:

17 '''end''' Ruppert.

== Practical Usageusage ==

Without modification Ruppert's algorithm is guaranteed to terminate and generate a quality mesh for non-acute input and any poor-quality threshold less than about 20.7 degrees. To relax these restrictions various small improvements have been made. By relaxing the quality requirement near small input angles, the algorithm can be extended to handle any straight-line input.<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}}</ref> Curved input can also be meshed using similar techniques.<ref>{{cite conference