Ruppert's algorithm: Difference between revisions

Revision as of 21:54, 20 June 2009

Revision as of 15:47, 29 March 2010

Line 1:

{{multiple image

| direction = vertical

| width = 500

| footer = Example of Ruppert's algorithm

| image1 = RuppertsAlgorithm-input.png

| alt1 = Ruppert's Algorithm input

| caption1 = PLC input

| image2 = RuppertsAlgorithm-output.png

| alt2 = Ruppert's algorithm output

| caption2 = Output mesh

}}

In [[mesh generation]], '''Ruppert's algorithm''', also known as '''Delaunay refinement''', is an [[algorithm]] for creating quality [[Delaunay triangulation]]s. The algorithm takes a [[piecewise linear]] system (PLS) and returns a conforming Delaunay triangulation of only quality triangles. A triangle is considered poor-quality if it has a circumradius to shortest edge ratio larger than some prescribed threshold.