Assertion: greedy triangulation | /r/HasAspect | an approximation ratio of θ
Facets:
Source sentences:
text: In this vein, it is known that the Delaunay triangulation has an approximation ratio of Θ ( n ) {\displaystyle \Theta (n)} , and that the greedy triangulation (the triangulation formed by adding edges in order from shortest to longest, at each step including an edge whenever it does not cross an earlier edge) has an approximation ratio of Θ ( n ) {\displaystyle \Theta ({\sqrt {n}})} .