Greedy triangulation: Difference between revisions
Jump to navigation
Jump to search
imported>InternetArchiveBot Bluelinking 1 books for verifiability.) #IABot (v2.1alpha3 |
(No difference)
|
Latest revision as of 20:18, 7 September 2019
The Greedy Triangulation is a method to compute a polygon triangulation or a Point set triangulation using a greedy schema, 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