Content deleted Content added
←Created page with 'Ruppert's algorithm is an algorithm for creating quality Delaunay triangulations. The algorithm takes a piecewise linear system (PLS) and returns a conforming,...' |
No edit summary |
||
Line 13:
Ruppert's algorithm can be naturally extended to three dimensions, however its output guarantees are somewhat weaker due to the sliver type tetrahedron.
== See also ==
* [[Delaunay Triangulation]]
* [[Voronoi diagram]]
* [[Polygon_mesh]]
== References ==
| |||