Digital Differential Analyzer (DDA) (Rasterization Rasterization)

From Algorithm Wiki
Revision as of 10:42, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ Words (Derived: for each iteration (i.e. each step along the line), only need to store a constant number of variables that are then overwritten in the next iteration.) == Description == "Scan-conversion line algorithm" == Approximate? == Approximate Approximation Factor: n/a == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1983 == Reference == Hearn, Ba...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O({1})$ Words

(Derived: for each iteration (i.e. each step along the line), only need to store a constant number of variables that are then overwritten in the next iteration.)

Description

"Scan-conversion line algorithm"

Approximate?

Approximate

Approximation Factor: n/a

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1983

Reference

Hearn, Baker (1997) pg. 87