| dc.contributor.author | Kuijk, A.A.M. | en_US |
| dc.contributor.author | Hagen, P.J. W. ten | en_US |
| dc.contributor.author | Akman, V. | en_US |
| dc.contributor.editor | Fons Kuijk and Wolfgang Strasser | en_US |
| dc.date.accessioned | 2014-02-06T14:01:44Z | |
| dc.date.available | 2014-02-06T14:01:44Z | |
| dc.date.issued | 1987 | en_US |
| dc.identifier.isbn | 3-540-50109-6 | en_US |
| dc.identifier.issn | 1727-3471 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/EGGH/EGGH87/021-037 | en_US |
| dc.description.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. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Raster Graphics | en_US |
| dc.subject | Overlap Separation | en_US |
| dc.subject | Representation | en_US |
| dc.subject | Incremental Operations | en_US |
| dc.subject | VLSI | en_US |
| dc.title | An Exact Incremental Hidden Surface RemovalAlgorithm | en_US |
| dc.description.seriesinformation | Eurographics Workshop on Graphics Hardware | en_US |
