✦ LIBER ✦

Minimal tangent visibility graphs

✍ Scribed by Michel Pocchiola; Gert Vegter

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 881 KB
Volume: 6
Category: Article
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00016-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal visibility graphs

✍ Douglas Campbell; John Higgins 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 583 KB

A note on minimal visibility graphs

✍ Xiaojun Shen; Qing Hu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 60 KB

Visibility graphs of towers

✍ Paul Colley; Anna Lubiw; Jeremy Spinrad 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 813 KB

A tower is a polygon consisting of two reflex chains sharing one common endpoint, together with one edge joining the other endpoints of the chains. A linear time algorithm is given to recognize the [vertex] visibility graphs of towers, and these graphs are characterized as bipartite permutation grap

Tangent, normal, and visibility cones on

Tangent, normal, and visibility cones on Bézier surfaces

✍ Deok-Soo Kim; Panos Y. Papalambros; Tony C. Woo 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 686 KB

Minimal graphs

✍ James Eells 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 207 KB

A note on visibility graphs

✍ F Luccio; S Mazzone; C.K Wong 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 602 KB

Given a set S = {s 1, s 2, ..., s,,) of vertical line segments, si, sj see each other ff there is a horizontal line segment which intersects them, but does not intersect any other line segment between them. A ws" ibility graph G of vertices {vl, v2, • .., v,,} is put into a one-to-one correspondenc