An Exact Incremental Hidden Surface RemovalAlgorithm

dc.contributor.authorKuijk, A.A.M.en_US
dc.contributor.authorHagen, P.J. W. tenen_US
dc.contributor.authorAkman, V.en_US
dc.contributor.editorFons Kuijk and Wolfgang Strasseren_US
dc.date.accessioned2014-02-06T14:01:44Z
dc.date.available2014-02-06T14:01:44Z
dc.date.issued1987en_US
dc.description.abstractThis 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.description.seriesinformationEurographics Workshop on Graphics Hardwareen_US
dc.identifier.isbn3-540-50109-6en_US
dc.identifier.issn1727-3471en_US
dc.identifier.urihttps://doi.org/10.2312/EGGH/EGGH87/021-037en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectRaster Graphicsen_US
dc.subjectOverlap Separationen_US
dc.subjectRepresentationen_US
dc.subjectIncremental Operationsen_US
dc.subjectVLSIen_US
dc.titleAn Exact Incremental Hidden Surface RemovalAlgorithmen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
021-037.pdf
Size:
781.61 KB
Format:
Adobe Portable Document Format