Engineering:Rasterisation

From HandWiki
Revision as of 20:54, 4 February 2024 by TextAI (talk | contribs) (correction)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Raster graphic image

In computer graphics, rasterisation (British English) or rasterization (American English) is the task of taking an image described in a vector graphics format (shapes) and converting it into a raster image (a series of pixels, dots or lines, which, when displayed together, create the image which was represented via shapes).[1][2] The rasterized image may then be displayed on a computer display, video display or printer, or stored in a bitmap file format. Rasterization may refer to the technique of drawing 3D models, or to the conversion of 2D rendering primitives, such as polygons and line segments, into a rasterized format.

Etymology

The term "rasterisation" comes from de Raster 'grid, pattern, schema', and la rāstrum 'scraper, rake'.[3][4]

2D images

Line primitives

Main page: Line drawing algorithm

Bresenham's line algorithm is an example of an algorithm used to rasterize lines.

Circle primitives

Algorithms such as Midpoint circle algorithm are used to render circle onto a pixelated canvas.

3D images

Rasterization is one of the typical techniques of rendering 3D models. Compared with other rendering techniques such as ray tracing, rasterization is extremely fast and therefore used in most realtime 3D engines. However, rasterization is simply the process of computing the mapping from scene geometry to pixels and does not prescribe a particular way to compute the color of those pixels. The specific color of each pixel is assigned by a pixel shader (which in modern GPUs is completely programmable). Shading may take into account physical effects such as light position, their approximations or purely artistic intent.

The process of rasterizing 3D models onto a 2D plane for display on a computer screen ("screen space") is often carried out by fixed function (non-programmable) hardware within the graphics pipeline. This is because there is no motivation for modifying the techniques for rasterization used at render time [5] and a special-purpose system allows for high efficiency.

Triangle rasterization

Rasterizing triangles using the top-left rule

Polygons are a common representation of digital 3D models. Before rasterization, individual polygons are typically broken down into triangles; therefore, a typical problem to solve in 3D rasterization is rasterization of a triangle. Properties that are usually required from triangle rasterization algorithms are that rasterizing two adjacent triangles (i.e. those that share an edge)

  1. leaves no holes (non-rasterized pixels) between the triangles, so that the rasterized area is completely filled (just as the surface of adjacent triangles). And
  2. no pixel is rasterized more than once, i.e. the rasterized triangles don't overlap. This is to guarantee that the result doesn't depend on the order in which the triangles are rasterized. Overdrawing pixels can also mean wasting computing power on pixels that would be overwritten.

This leads to establishing rasterization rules to guarantee the above conditions. One set of such rules is called a top-left rule, which states that a pixel is rasterized if and only if

  1. its center lies completely inside the triangle. Or
  2. its center lies exactly on the triangle edge (or multiple edges in case of corners) that is (or, in case of corners, all are) either top or left edge.

A top edge is an edge that is exactly horizontal and lies above other edges, and a left edge is a non-horizontal edge that is on the left side of the triangle.

This rule is implemented e.g. by Direct3D[6] and many OpenGL implementations (even though the specification doesn't define it and only requires a consistent rule[7]).

Quality

Pixel precision (left) vs sub-pixel precision (middle) vs anti-aliasing (right)

The quality of rasterization can be improved by antialiasing, which creates "smooth" edges. Sub-pixel precision is a method which takes into account positions on a finer scale than the pixel grid and can produce different results even if the endpoints of a primitive fall into same pixel coordinates, producing smoother movement animations. Simple or older hardware, such as PlayStation 1, lacked sub-pixel precision in 3D rasterization.[8]

See also

References

  1. ↑ Michael F. Worboys (30 October 1995). GIS: A Computer Science Perspective. CRC Press. pp. 232–. ISBN 978-0-7484-0065-2. https://books.google.com/books?id=duT2fcnQeJMC&pg=PA232. 
  2. ↑ Kang-Tsung Chang (27 August 2007). Programming ArcObjects with VBA: A Task-Oriented Approach, Second Edition. CRC Press. pp. 91–. ISBN 978-1-4200-0918-7. https://books.google.com/books?id=1DOY9xuxcosC&pg=PA91. 
  3. ↑ Harper, Douglas. "raster". Online Etymology Dictionary. https://www.etymonline.com/?term=raster. 
  4. ↑ rastrum. Charlton T. Lewis and Charles Short. A Latin Dictionary on Perseus Project.
  5. ↑ "Rasterization: a Practical Implementation". https://www.scratchapixel.com/lessons/3d-basic-rendering/rasterization-practical-implementation/overview-rasterization-algorithm.html. 
  6. ↑ "Rasterization Rules (Direct3D 9)". https://docs.microsoft.com/en-us/windows/win32/direct3d9/rasterization-rules. 
  7. ↑ OpenGL 4.6. p. 478. https://www.khronos.org/registry/OpenGL/specs/gl/glspec46.core.pdf. 
  8. ↑ "PlayStation rasterization issues". 4 October 2016. https://www.libretro.com/index.php/mednafenbeetle-psx-pgxp-arrives/#more-45256. 

External links



Retrieved from "https://handwiki.org/wiki/index.php?title=Engineering:Rasterisation&oldid=3260720"