Cross Scanline Algorithm

dc.contributor.author	Tanaka, Toshimitsu	en_US
dc.contributor.author	Talcahashi, Tokiichiro	en_US
dc.date.accessioned	2015-10-05T07:56:30Z
dc.date.available	2015-10-05T07:56:30Z
dc.date.issued	1990	en_US
dc.identifier.issn	1017-4656	en_US
dc.identifier.uri	http://dx.doi.org/10.2312/egtp.19901005	en_US
dc.description.abstract	This paper proposes a new hidden surface removal algorithm which is based on the scanline algorithm but scans in two directions, horizontally and vertically. Named the cross scanline algorithm, it can efficiently detect all polygons and calculate their exact projected areas in each pixel even if the polygons are much smaller than the pixel. Comparisons with the regular sub-scanlines algorithm show that high quality anti-aliased images can be generated.	en_US
dc.publisher	Eurographics Association	en_US
dc.title	Cross Scanline Algorithm	en_US
dc.description.seriesinformation	EG 1990-Technical Papers	en_US
dc.identifier.doi	10.2312/egtp.19901005	en_US