{"title":"Antialiased rendering of self-intersecting polygons using polygon decomposition","authors":"K. Doan","doi":"10.1109/PCCGA.2004.1348369","DOIUrl":null,"url":null,"abstract":"Although numerous pre-filtering and area sampling antialiasing techniques have been devised, few are capable of rendering complex, self-intersecting polygons. This paper presents a new antialiasing method capable of handling such polygons, according to any fill rule. The method is based on area sampling and is hence free from the visual aliasing artifacts of super sampling associated with near horizontal edges. It works by decomposing the coverage area of a polygon within each pixel into separate constituent regions, which are simple regions whose areas can be easily computed. The decomposition step does not attempt to generate non-overlapping regions, unlike that employed by existing methods, and hence operates very efficiently. This, together with other novel approximation techniques in the recombination stage allow pixel coverage areas to estimated with an efficiency approaching that of super sampling.","PeriodicalId":264796,"journal":{"name":"12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings.","volume":"168 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCGA.2004.1348369","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
Although numerous pre-filtering and area sampling antialiasing techniques have been devised, few are capable of rendering complex, self-intersecting polygons. This paper presents a new antialiasing method capable of handling such polygons, according to any fill rule. The method is based on area sampling and is hence free from the visual aliasing artifacts of super sampling associated with near horizontal edges. It works by decomposing the coverage area of a polygon within each pixel into separate constituent regions, which are simple regions whose areas can be easily computed. The decomposition step does not attempt to generate non-overlapping regions, unlike that employed by existing methods, and hence operates very efficiently. This, together with other novel approximation techniques in the recombination stage allow pixel coverage areas to estimated with an efficiency approaching that of super sampling.