Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Line drawing algorithm
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Methods of approximating line segments for pixel displays}} {{Expand German|Rasterung von Linien|fa=yes|topic=sci|date=December 2009}} [[File:Line scan-conversion.svg|thumb|upright=1.0|Two rasterized lines. The colored pixels are shown as circles. Above: monochrome screening; below: Gupta-Sproull anti-aliasing; the ideal line is considered here as a surface.]] In [[computer graphics]], a '''line drawing algorithm''' is an [[algorithm]] for approximating a [[line segment]] on discrete [[Graphics|graphical]] media, such as [[pixel]]-based [[computer display|displays]] and [[computer printer|printers]]. On such media, line drawing requires an [[Approximation algorithm|approximation]] (in nontrivial cases). Basic algorithms [[Rasterisation|rasterize]] lines in one color. A better representation with multiple [[Gradation (art)|color gradations]] requires an advanced process, [[spatial anti-aliasing]]. On continuous media, by contrast, no algorithm is necessary to draw a line. For example, [[cathode-ray oscilloscope]]s use analog phenomena to draw lines and curves.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)