By Topic

Antialiased rendering of self-intersecting polygons using polygon decomposition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
K. Doan ; Canon Inf. Syst. Res. Australia, North Ryde, NSW, Australia

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.

Published in:

Computer Graphics and Applications, 2004. PG 2004. Proceedings. 12th Pacific Conference on

Date of Conference:

6-8 Oct. 2004