A New Scan Line Algorithm for the Rendering of CGS Trees

dc.contributor.author	Pueyo, Xavier	en_US
dc.contributor.author	Mendoza, Joan Carles	en_US
dc.date.accessioned	2015-10-05T07:55:25Z
dc.date.available	2015-10-05T07:55:25Z
dc.date.issued	1987	en_US
dc.identifier.issn	1017-4656	en_US
dc.identifier.uri	http://dx.doi.org/10.2312/egtp.19871027	en_US
dc.description.abstract	A 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.publisher	Eurographics Association	en_US
dc.title	A New Scan Line Algorithm for the Rendering of CGS Trees	en_US
dc.description.seriesinformation	EG 1987-Technical Papers	en_US
dc.identifier.doi	10.2312/egtp.19871027	en_US