Elsevier

Parallel Computing

Volume 15, Issues 1–3, September 1990, Pages 277-289
Parallel Computing

Short communication
A systolic algorithm for hidden surface removal

https://doi.org/10.1016/0167-8191(90)90050-JGet rights and content

Abstract

With the advent of VLSI it has become possible to map parallel algorithms for compute-bound problems directly on silicon. Systolic architecture is very good candidate for VLSI implementation because of its regular and simple design, and regular communication pattern. In this paper, a systolic algorithm and corresponding systolic architecture, a linear systolic array, for the scanline-based hidden surface removal problem in three-dimensional computer graphics have been proposed. The algorithm is based on the concept of sample spans or intervals. The worst case time taken by the algorithm is O(n), n being the number of segments in a scanline. The time taken by the algorithm for a given scene depends on the scene itself, and on an average considerable improvement over the worst case behaviour is expected. A pipeline scheme for handling the I/O process has also been proposed which is suitable for VLSI implementation of the algorithm.

References (4)

There are more references available in the full text version of this article.

Cited by (2)

  • Image analysis and computer vision: 1991

    1992, CVGIP: Image Understanding
View full text