论文信息 - A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons - 字舞流文

A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons

Abstract In this paper we present a linear-time approximation scheme for determining the maximum weight triangulation of a convex polygon. Our algorithm is simple and can be implemented easily.

Jianbo Qian | Cao An Wang

[1] Christos Levcopoulos,et al. A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons , 1998, Algorithmica.

[2] Christos Levcopoulos,et al. Quasi-greedy triangulations approximating the minimum weight triangulation , 1996, SODA '96.

[3] Peter Gilbert. New Results on Planar Triangulations. , 1979 .

[4] G. Klincsek. Minimal Triangulations of Polygonal Domains , 1980 .

[5] Francis Y. L. Chin,et al. Progress on Maximum Weight Triangulation , 2004, COCOON.

[6] Shiyan Hu. A Constant-Factor Approximation for Maximum Weight Triangulation , 2003 .

[7] Boting Yang,et al. Maximum Weight Triangulation and Graph Drawing , 1999, Inf. Process. Lett..

[8] Andrzej Lingas,et al. On approximation behavior of the greedy triangulation for convex polygons , 2005, Algorithmica.