![]() Polygon Greedy triangulation steps. On each step a new edge (red) is added joining the nearest pair of vertex, without crossing a previously edge | |
Class | Search algorithm |
---|---|
Data structure | |
Worst-case performance | |
Best-case performance |
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]
{{
citation}}
: CS1 maint: multiple names: authors list (
link)
![]() Polygon Greedy triangulation steps. On each step a new edge (red) is added joining the nearest pair of vertex, without crossing a previously edge | |
Class | Search algorithm |
---|---|
Data structure | |
Worst-case performance | |
Best-case performance |
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]
{{
citation}}
: CS1 maint: multiple names: authors list (
link)