✦ LIBER ✦

A linear-time near-optimum-length triangulation algorithm for convex polygons

✍ Scribed by Vitit Kantabutra

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 400 KB
Volume: 49
Category: Article
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(05)80052-2

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A new linear algorithm for intersecting

A new linear algorithm for intersecting convex polygons

✍ Joseph O'Rourke; Chi-Bin Chien; Thomas Olson; David Naddor 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 520 KB

A new linear algorithm for intersecting

A new linear algorithm for intersecting convex polygons

✍ Joseph O'Rourke; Chi-Bin Chien; Thomas Olson; David Naddor 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 82 KB

A new linear algorithm for triangulating

A new linear algorithm for triangulating monotone polygons

✍ Godfried T Toussaint 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 258 KB

On a convex hull algorithm for polygons

On a convex hull algorithm for polygons and its application to triangulation problems

✍ Godfried T. Toussaint; David Avis 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 500 KB

An O(n) algorithm to find a near-optimum

An O(n) algorithm to find a near-optimum partition of a convex polygon

✍ T.C Hu; M.T Shing 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 673 KB

A Simple Linear Time Algorithm for Trian

A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs

✍ H. Bodlaender; T. Kloks 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 560 KB

In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the perfect phylogeny problem from molecular biology and is strongly related with the problem of recog