Line Drawing: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Line Drawing (Line Drawing)}} == Description == Given a line segment with endpoints $(x_0, y_0), (x_1, y_1)$ and a discrete graphical medium (like pixel-based displays and printers), draw/approximate the line segment on the medium, potentially with antialiasing. == Parameters == <pre>n: number of pixels the line goes through</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Tim...") |
No edit summary |
||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
n: number of pixels the line goes through | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 12:02, 15 February 2023
Description
Given a line segment with endpoints $(x_0, y_0), (x_1, y_1)$ and a discrete graphical medium (like pixel-based displays and printers), draw/approximate the line segment on the medium, potentially with antialiasing.
Parameters
n: number of pixels the line goes through
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Naive algorithm | 1940 | $O(n)$ | $O({1})$ auxiliary | Exact | Deterministic | |
| Digital Differential Analyzer | 1940 | $O(n)$ | $O({1})$ auxiliary | Exact | Deterministic | |
| Bresenham's line algorithm | 1965 | $O(n)$ | $O({1})$ auxiliary | Exact | Deterministic | Time |
| Xiaolin Wu's line algorithm | 1991 | $O(n)$ | $O({1})$ auxiliary | Exact | Deterministic | Time |
| Gupta-Sproull algorithm | 1981 | $O(n)$ | $O({1})$ auxiliary | Exact | Deterministic | Time |
Time Complexity graph
Error creating thumbnail: Unable to save thumbnail to destination
Space Complexity graph
Error creating thumbnail: Unable to save thumbnail to destination
Pareto Decades graph
Error creating thumbnail: Unable to save thumbnail to destination