𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hidden line elimination for isooriented rectangles

✍ Scribed by K. Mehlhorn; S. Näher; C. Uhrig

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
631 KB
Volume
35
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Hidden-line algorithm for curved surface
Hidden-line algorithm for curved surfaces
✍ L. Li 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 446 KB

A hidden-line algorithm for displaying curved surfaces by line drawing is presented. The algorithm divides the screen plane into small rectangles, unlike Ohno's algorithm, which divides the screen space into small 3D boxes and exploits quadrilateral coherence and depth coherence. The present algorit

Hidden-line algorithm for scenes of high
Hidden-line algorithm for scenes of high complexity
✍ Martin Wittram 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 587 KB

The programs are written in FORTRAN and are very short and simple. The computation time of the algorithm is short enough to handle scenes of high complexity. Hidden-line and hidden-surface problems have been discussed so often and solved in so many ways 1'2'3, that it might seem that they have been