A New Scan Line Algorithm for the Rendering of CGS Trees

Simple item page
dc.contributor.authorPueyo, Xavieren_US
dc.contributor.authorMendoza, Joan Carlesen_US
dc.date.accessioned2015-10-05T07:55:25Z
dc.date.available2015-10-05T07:55:25Z
dc.date.issued1987en_US
dc.description.abstractA scan line algorithm is proposed to render CSG modelled solids. Scan planes intersections are obtained by means of a proposed generalisation of Porter’s algorithm. 2-D scan plane primitives are decomposed in a way that provides a more accurate disjointness information then 3-D inclosing boxes and a simple way to class spans. Furtheremore, this scan plane organisation allows the use of most of scan line hidden surface strategies that make use of different types of coherence to speed up the visibility process.en_US
dc.description.seriesinformationEG 1987-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19871027en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19871027en_US
dc.publisherEurographics Associationen_US
dc.titleA New Scan Line Algorithm for the Rendering of CGS Treesen_US
Files
Collections
EG1987 Proceedings (Technical Papers)
EG1987 Proceedings (Technical Papers)