The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Conservative and tiled rasterization using a modified triangle setup

På svenska

Author

Summary, in English

Several algorithms that use graphics hardware to accelerate processing require conservative rasterization in order to function correctly. Conservative rasterization stands for either overestimating or underestimating the size of the triangles. Overestimation is carried out by including all pixels that are at least partially overlapped by the triangle, whereas underestimation includes only the pixels that are fully inside the triangle. No or few algorithms for conservative rasterization have been described in the literature, and current hardware does not explicitly support it. Therefore, we present a simple algorithm, which requires only a small modification to the triangle set-up when edge functions are used. Furthermore, the same algorithm can be used for tiled rasterization, where all pixels in a tile (e.g., 8 × 8 pixels) are visited before moving to the next tile.

Publishing year

2005

Language

English

Pages

1-8

Publication/Series

Journal of Graphics Tools

Volume

10

Issue

3

Document type

Journal article

Publisher

AK Peters

Topic

  • Computer Science

Status

Published

ISBN/ISSN/Other

  • ISSN: 2151-237X