Rasterization (Rasterization)

From Algorithm Wiki
Revision as of 11:25, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Rasterization (Rasterization)}} == Description == Raster-scan displays are most commonly driven by a frame buffer, a memory that stores the color value for every picture element on the screen and refreshes the display continuously. The process of generating these picture clement values from a geometric description of the image is known as rasterization. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" s...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description

Raster-scan displays are most commonly driven by a frame buffer, a memory that stores the color value for every picture element on the screen and refreshes the display continuously. The process of generating these picture clement values from a geometric description of the image is known as rasterization.

Parameters

No parameters found.

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Digital Differential Analyzer (DDA) 1983 $O(n)$ $O({1})$ n/a Deterministic
Bresenham Algorithm 1962 $O(n)$ $O({1})$ n/a Deterministic