✦ LIBER ✦

A new linear algorithm for triangulating monotone polygons

✍ Scribed by Godfried T Toussaint

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 258 KB
Volume: 2
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(84)90039-4

No coin nor oath required. For personal study only.

📜 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 ⚖ 82 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 ⚖ 520 KB

A linear algorithm for bisecting a polyg

A linear algorithm for bisecting a polygon

✍ Thomas C. Shermer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 465 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

A counterexample to an algorithm for com

A counterexample to an algorithm for computing monotone hulls of simple polygons

✍ Godfried T. Toussaint; Hossam El Gindy 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 241 KB

A simple linear hidden-line algorithm fo

A simple linear hidden-line algorithm for star-shaped polygons

✍ David Rappaport; Godfried T Toussaint 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 287 KB