Greedy triangulation
Jump to navigation
Jump to search
The greedy triangulation is a method to compute a polygon triangulation or a point set triangulation using a greedy algorithm, which adds edges one by one to the solution in strict increasing order by length, with the condition that an edge cannot cut a previously inserted edge.[1][2]
References
- ↑ Template:Citation Chapter 3: Polygon Triangulation: pp.103.
- ↑ Template:Citation