Show simple item record

dc.contributor.authorKallio, Kiiaen_US
dc.contributor.editorIk Soo Lim and David Duceen_US
dc.date.accessioned2014-01-31T19:58:09Z
dc.date.available2014-01-31T19:58:09Z
dc.date.issued2007en_US
dc.identifier.isbn978-3-905673-63-0en_US
dc.identifier.urihttp://dx.doi.org/10.2312/LocalChapterEvents/TPCG/TPCG07/081-088en_US
dc.description.abstractIn this paper, a novel algorithm for rendering antialiased 2D polygons is presented. Although such algorithms do exist, they are inefficient when comparing to non-antialiased alternatives. This has lead to a situation where the developers and the end users of the applications need to make a choice between high speed and high quality. The algorithm presented here however equals the performance of an industry standard non-antialiased polygon filling algorithm, while providing good antialiasing quality. Furthermore, the algorithm addresses the requirements of a modern 2D rendering API by supporting features such as various fill rules. Most of the research in antialiased 2D rendering has been proprietary work, and there is very little documentation about the algorithms in the literature. This paper brings an update to the situation by providing a thorough explanation of one such algorithm.en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Picture/Image Generation;en_US
dc.titleScanline Edge-flag Algorithm for Antialiasingen_US
dc.description.seriesinformationTheory and Practice of Computer Graphicsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record