✦ LIBER ✦

Hidden-line problem solved

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 101 KB
Volume: 3
Category: Article
ISSN: 0141-9382
DOI: 10.1016/0141-9382(82)90079-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the hidden line removal problem

✍ William R. Spillers; Kincho H. Law 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 611 KB

A problem solved

✍ Sharon G. Boots 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

A linear-time algorithm for solving the

A linear-time algorithm for solving the strong hidden-line problem in a simple polygon

✍ Godfried T. Toussaint 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Covering Graphs: The Covering Problem So

Covering Graphs: The Covering Problem Solved

✍ Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 238 KB

For every fixed graph H, we determine the H-covering number of K n , for all n>n 0 (H ). We prove that if h is the number of edges of H, and gcd(H )=d is the greatest common divisor of the degrees of H, then there exists n 0 =n 0 (H ), such that for all n>n 0 , Our main tool in proving this result

Hidden line routines

📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 115 KB

Problem-solving environment for line bal

Problem-solving environment for line balancing automated manufacturing systems

✍ Sheng-Jen (“Tony”) Hsieh 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 452 KB