@techreport{R-85-12,
TITLE = {A Linear-Time Heuristic for Minimum Weight Triangulation of Convex Polygons},
AUTHOR = {Andrzej Lingas},
YEAR = {1985},
NUMBER = {R-85-12},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-85-12+abstr},
ABSTRACT = {A simple heuristic for minimum weight triangulation of convex polygons is presented. For a convex polygon with n vertices, the heuristic runs in time O(n), and produces a solution within an O(logn) factor from the minimum. Generalizations of the heuristic to include non-convex polygons are also derived.},
IDANR = {LiTH-IDA-R-85-12},
NOTE = {Also in Proc. of the Allerton Conference on Communication, Control, and Computing, Urbana, Illinois, October, 1985}