Gupta-Sproull 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 and what shading to use) is sufficient) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1981 == Reference == http://www.cs.gettysburg.edu/~ilinkin/courses/Fall-2014/cs373/handouts/papers/gs-fegsd-81.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 and what shading to use) is sufficient) | (Constant number of O(1)-word-sized variables (for determining which pixels to shade and what shading to use) 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 and what shading to use) is sufficient)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1981
Reference
http://www.cs.gettysburg.edu/~ilinkin/courses/Fall-2014/cs373/handouts/papers/gs-fegsd-81.pdf