Assertion: greedy triangulation | /r/HasProperty | constructed in o(ntime
Facets:
value: from dt(s
type: OTHER
Source sentences:
text: On the other hand, the widely used greedy triangulation, which is obtained by inserting non-crossing edges in increasing length order, can be constructed from DT(S) in O(n) time, by a recent result in Levcopoulos and Krznaric .