✦ LIBER ✦

Space-optimal hidden line elimination for rectangles

✍ Scribed by Nectarios Kitsios; Athanasios Tsakalidis

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 530 KB
Volume: 60
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(96)00161-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hidden line elimination for isooriented

Hidden line elimination for isooriented rectangles

✍ K. Mehlhorn; S. Näher; C. Uhrig 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 631 KB

Space reduction and an extension for a h

Space reduction and an extension for a hidden line elimination algorithm

✍ Nectarios Kitsios; Athanasios Tsakalidis 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 695 KB

A fast line-sweep algorithm for hidden l

A fast line-sweep algorithm for hidden line elimination

✍ Otto Nurmi 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 519 KB

A hidden line elimination method for cur

A hidden line elimination method for curved surfaces

✍ Yoshio Ohno 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 708 KB

An algorithm for displaying curved surfaces with hidden lines eliminated Is described. The surfaces are displayed as rectangular grids of straight segments which approximate those surfaces. The algorithm is essentially one of brute force. However, it divides the screen space into Enall 3D boxes to r

New algorithms for special cases of the

New algorithms for special cases of the hidden line elimination problem

✍ Ralf Hartmut Güting; Thomas Ottmann 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 91 KB

An optimal time and minimal space algori

An optimal time and minimal space algorithm for rectangle intersection problems

✍ D. T. Lee 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 478 KB