Content deleted Content added
ce (extra word, inline external link that's already in EL section), disambiguate piecewise linear |
|||
Line 27:
== Algorithm Description ==
The algorithm begins with a Delaunay triangulation of the input vertices and then consists of two main operations.
* The midpoint of a segment with non-empty diametral circles is inserted into the triangulation.
Line 33:
These operations are repeated until no poor-quality triangles exist and all segments are not encroached.
== Practical Usage ==
| |||