Cross Scanline Algorithm
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.
BibTeX
@inproceedings {10.2312:egtp.19901005,
booktitle = {EG 1990-Technical Papers},
editor = {},
title = {{Cross Scanline Algorithm}},
author = {Tanaka, Toshimitsu and Talcahashi, Tokiichiro},
year = {1990},
publisher = {Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/egtp.19901005}
}
booktitle = {EG 1990-Technical Papers},
editor = {},
title = {{Cross Scanline Algorithm}},
author = {Tanaka, Toshimitsu and Talcahashi, Tokiichiro},
year = {1990},
publisher = {Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/egtp.19901005}
}