NobleBlocks

Research indexJournal article

Cross Scanline Algorithm

Tanaka, Talcahashi

Eurographics1 Jan 1990Open access

NobleIDark:/48914/w1/20260525/016EE1C8DOI10.2312/egtp.19901005

Free to read at the publisher

You can read the abstract here, or the full text at the publisher.

Read at the publisher

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.

Discussion

Citations

Topics

More

Suggest a correction or report