๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithms for optimal area triangulations of a convex polygon

โœ Scribed by J. Mark Keil; Tzvetalin S. Vassilev

Book ID
108100954
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
472 KB
Volume
35
Category
Article
ISSN
0925-7721

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A linear-time near-optimum-length triang
A linear-time near-optimum-length triangulation algorithm for convex polygons
โœ Vitit Kantabutra ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 400 KB

This paper shows how to compute a short triangulation for a convex polygon in O(n) time, where n is the number of sides of the input polygon. The resulting triangulation is guaranteed to be of a total length that is only a constant factor of the shortest possible.