✦ LIBER ✦

Hidden-line algorithm for scenes of high complexity

✍ Scribed by Martin Wittram

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 587 KB
Volume: 13
Category: Article
ISSN: 0010-4485
DOI: 10.1016/0010-4485(81)90139-1

No coin nor oath required. For personal study only.

✦ Synopsis

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 analysed sufficiently. Most of the proposed methods however do not provide efficient solutions for highly complex scenes. Moreover it is extremely difficult to find modular hidden-line algorithms for universal application which can be implemented easily. The procedure described here may be faster and shorter than earlier ones. The programs are written in FORTRAN and are very compact.

The algorithm works in the image space only and is therefore independent of data generation and transformation. The method is based on a polyhedral representation of objects to be rendered and applies record-sort techniques to the background store.

Earlier approaches 2 (see also the work of Appel and Loutrell) made use of the following:

📜 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

Bibliography of hidden - line and hidden

Bibliography of hidden - line and hidden - surface algorithms

✍ J.G Griffiths 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 373 KB

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

A ‘hidden line’ algorithm for 3D-reconst

A ‘hidden line’ algorithm for 3D-reconstruction from serial sections — An extension of the NEUREC program package for a microcomputer

✍ Heribert Gras 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 838 KB

An algorithm is described to generate pictures in arbitrary perspective from serially sectioned biological material. Only those parts of the object which lie on a direct line of sight to the observer are included into the computed paper-plot, while hidden lines are omitted. The program was written f

Algorithm for the design of overhead tra

Algorithm for the design of overhead transmission lines

✍ L. Olbrycht 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 526 KB

Algorithmic considerations on the comput

Algorithmic considerations on the computational complexities of digital line extraction problem

✍ Tetsuo Asano; Yasuyuki Kawamura 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB 👁 2 views

An Algorithm for Finding Recurrence Rela

An Algorithm for Finding Recurrence Relations of Binomial Sums and its Complexity

✍ Nobuki Takayama 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 355 KB

A new algorithm to find recurrence relations of binomial sums and a complexity analysis are given. The algorithm is based on the theory of hypergeometric functions and algorithmic method to get contiguity relations of hyperegeometric functions.