An exact incremental hidden surface removal algorithm

Authors:
A. A. M. Kuijk;P. J. W. ten Hagen;V. Akman
Affiliations:
Department of Interactive Systems, Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands;Department of Interactive Systems, Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands;Department of Interactive Systems, Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands
Venue:
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
Year:
1987

Citing 4
Cited 0

Fundamentals of interactive computer graphics

Fundamentals of interactive computer graphics
A Characterization of Ten Hidden-Surface Algorithms

ACM Computing Surveys (CSUR)
Display Architecture for VLSI-based Graphics Workstations

Advances in Computer Graphics Hardware I (Eurographics'86 Workshop)
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an incremental Hidden Surface Removal Algorithm (HSRA), developed to be embedded in a new architecture for raster graphics described in [1,7]. The algorithm can be classified as "exact" since it operates in object space, rather than image space. It can be classified as "incremental" because this HSRA is able to support addition, removal and changes on a single object or a group of objects. Thus a firm basis for powerful interaction and animation is established. Due to specially designed data structures for both geometric objects as well as storage of these objects, the hidden surface removal calculation on a complete scene will have the same time complexity as existing algorithms. However, the effort needed for incremental changes is much less than any other known algorithm. The data structures as well as the algorithm are designed to exploit parallelism in computation.