Preprint
Aug 2026
On the Spanning Ratio of the Greedy Triangulation for Convex Point Sets
The greedy triangulation of a finite planar point set is obtained by considering all segments in nondecreasing order of length and inserting each segment that does not cross an earlier one. Its spanning ratio is known to be bounded by a universal constant, but the standard bound obtained from the diamond and good-polyg...
Prosenjit Bose, J. De Carufel, Anil Maheshwari et al.
· 0 citations