Bresenham's line algorithm (Line Drawing Line Drawing): Difference between revisions
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 == 1965 == Reference == https://web.archive.org/web/20080528040104/http://www.research.ibm.com/journal/sj/041/ibmsjIVRIC.pdf") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O({1})$ | $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 09: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
1965
Reference
https://web.archive.org/web/20080528040104/http://www.research.ibm.com/journal/sj/041/ibmsjIVRIC.pdf