On approximation behavior and implementation of the greedy triangulation for convex planar point sets

作者： A Lingas

关键词: Polygon triangulation 、 Combinatorics 、 Delaunay triangulation 、 Pitteway triangulation 、 Convex hull 、 Convex set 、 Minimum-weight triangulation 、 Point set triangulation 、 Mathematics 、 Triangulation (social science)

摘要: Manacher and Zorbrist conjectured that the greedy triangulation heuristic for minimum weight of n-point planar point sets yields solutions within an O(ne), e