Cross Scanline Algorithm

Simple item page
dc.contributor.authorTanaka, Toshimitsuen_US
dc.contributor.authorTalcahashi, Tokiichiroen_US
dc.date.accessioned2015-10-05T07:56:30Z
dc.date.available2015-10-05T07:56:30Z
dc.date.issued1990en_US
dc.description.abstractThis 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.description.seriesinformationEG 1990-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19901005en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19901005en_US
dc.publisherEurographics Associationen_US
dc.titleCross Scanline Algorithmen_US
Files
Collections
EG1990 Proceedings (Technical Papers)
EG1990 Proceedings (Technical Papers)