Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Conservative and tiled rasterization using a modified triangle setup

In English

Författare

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.

Publiceringsår

2005

Språk

Engelska

Sidor

1-8

Publikation/Tidskrift/Serie

Journal of Graphics Tools

Volym

10

Issue

3

Dokumenttyp

Artikel i tidskrift

Förlag

AK Peters

Ämne

  • Computer Science

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 2151-237X