✦ LIBER ✦

Three-coloring the vertices of a triangulated simple polygon

✍ Scribed by A.A. Kooshesh; B.M.E. Moret

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 47 KB
Volume: 25
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(92)90093-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Diagonal coloring of the vertices of tri

Diagonal coloring of the vertices of triangulations

✍ Oleg V. Borodin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 112 KB

## In the diagonal coloring of triangulations, not only adjacent vertices are colored differently but also any vertices z, w if there exist faces [xyz] and [WY]. An upper bound for the minimal number of colors needed to diagonally color any triangulation of a surface with Euler characteristic N is

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

Computing the convex hull of a simple po

Computing the convex hull of a simple polygon

✍ Chern-Lin Chen 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 337 KB

Optimally Computing the Shortest Weakly

Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon

✍ Danny Z. Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Given an n-vertex simple polygon P, the problem of computing the shortest weakly visible subedge of P is that of finding a shortest line segment s on the Ž . boundary of P such that P is weakly visible from s if s exists . In this paper, we present new geometric observations that are useful for solv

Finding the convex hull of a simple poly

Finding the convex hull of a simple polygon in linear time

✍ S.Y. Shin; T.C. Woo 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Calculating the electric potential of ma

Calculating the electric potential of macromolecules: A simple method for molecular surface triangulation

✍ Xiang Zhexin; Shi Yunyu; Xu Yingwu 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 415 KB

An improved version of the "marching-cube" method' is proposed for molecular surface triangulation. This new algorithm involves fewer and simpler basic building blocks and avoids the artificial gaps of the original one. Moreover, to make it applicable to the boundary element method, the procedures f