๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Bibliography of hidden - line and hidden - surface algorithms

โœ Scribed by J.G Griffiths

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
373 KB
Volume
10
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

โœฆ Synopsis

Bouknight, W J 'A procedure for the generation of 3-D half-toned computer graphics presentations' CACM Vol 13 No 9 (September 1970) pp 527-536 Bouknight, W J and Kelley, K C 'An algorithm for producing half-tone computer graphics presentations with shadows and movable light sources' Proc. AF/P5 $]CC Vol 36 (1970) pp 1-10 Burns, R A 'Simulating the visual environment in real time via software'

๐Ÿ“œ SIMILAR VOLUMES

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

Tape-oriented hidden-line algorithm
Tape-oriented hidden-line algorithm
โœ J.G. Griffiths ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 739 KB
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

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

Removal of hidden lines by recursive sub
Removal of hidden lines by recursive subdivision
โœ S.M. Maghrabi; J.G. Griffiths ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 685 KB

A new hidden-line algorithm is proposed for illustrating objects whose faces are plane or nearly plane polygons. The algorithm shows how the number of comparisons between edges and edges, and between faces and segments can be reduced by recursively subdividing the picture before analysing it. The al