Digital Differential Analyzer (Line Drawing Line Drawing): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary words? (Constant number of O(1)-word-sized variables (for determining which pixels to shade) is sufficient) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1940 == Reference == -")
 
No edit summary
 
Line 5: Line 5:
== Space Complexity ==  
== Space Complexity ==  


$O({1})$ auxiliary words?
$O({1})$ words?


(Constant number of O(1)-word-sized variables (for determining which pixels to shade) is sufficient)
(Constant number of O(1)-word-sized variables (for determining which pixels to shade) is sufficient)

Latest revision as of 08:41, 10 April 2023

Time Complexity

$O(n)$

Space Complexity

$O({1})$ words?

(Constant number of O(1)-word-sized variables (for determining which pixels to shade) is sufficient)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

1940

Reference

-