Abstract
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in triangulation is maximized. We prove an \(\Omega(\sqrt{n})\) lower bound on the approximation factor for several heuristics: maximum greedy triangulation, maximum greedy spanning tree triangulation and maximum spanning tree triangulation. We then propose the Spoke Triangulation algorithm, which approximates the maximum weight triangulation for points in general position within a factor of almost four in O(nlog n) time. The proof is simpler than the previous work. We also prove that Spoke Triangulation approximates the maximum weight triangulation of a convex polygon within a factor of two.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chin F, Qian J, Wang C (2004) Progress on maximum weight triangulation of a point set. In Proceedings of the annual international conference on computing and combinatorics (COCOON), pp 53–61
de Berg M (2003) Personal communication
Heath L, Pemmaraju S (1994) New results for the minimum weight triangulation problem. Algorithmica 12(6):533–552
Hu S (2003) A constant approximation algorithm for maximum weight triangulation. In Proceedings of Canadian conference on computational geometry (CCCG), pp 150–154
Levcopoulos C, Krznaric D (1996) Tight lower bounds for minimum weight-triangulation heuristics. Inf Proc Lett 57(3):129–135
Levcopoulos C, Krznaric D (1998a) Quasi-greedy triangulations approximating the minimum weight triangulation. J Algorithms 27(2):303–338
Levcopoulos C, Krznaric D (1998b) A linear-time approximation scheme for minimum weight triangulation of convex polygons. Algorithmica 21(3):285–311
Lingas A (1987) A new heuristic for the minimum weight triangulation. SIAM J Algebr Discrete Methods 8:646–658
Mulzer W, Rote G (2006) Minimum weight triangulation is NP-hard. In Proceedings of the 22nd annual ACM symposium on computational geometry (SoCG), pp 1–10
Plaisted D, Hong J (1987) A heuristic triangulation algorithm. J Algorithms 8(3):405–437
Qian J, Wang C (2004) A linear-time approximation scheme for the maximum weight triangulations of a convex polygon. Algorithmica 161–172
Remy J, Steger A (2006) A quasi-polynomial time approximation scheme for minimum weight triangulation. In Proceedings of the 38th ACM symposium on theory of computing (STOC), pp 316–325
Scott P, Awyong P (2000) Inequalities for convex sets. J Inequal Pure Appl Math 1(1):6
Wang C, Chin F, Yang B (1999) Maximum weight triangulation and graph drawing. Inf Proc Lett 70(1):17–22
Author information
Authors and Affiliations
Corresponding author
Additional information
Preliminary version of this paper (Hu 2003) appeared in CCCG’03.
Rights and permissions
About this article
Cite this article
Hu, S. An almost four-approximation algorithm for maximum weight triangulation. J Comb Optim 19, 31–42 (2010). https://doi.org/10.1007/s10878-008-9158-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-008-9158-9