Live briefing
Everything about Line drawing algorithm
Methods of approximating line segments for pixel displays
In computer graphics, a line drawing algorithm is an algorithm for approximating a line segment on discrete graphical media, such as pixel-based displays and printers. On such media, line drawing requires an approximation. Basic algorithms rasterize lines in one color. A better representation with multiple color gradations requires an advanced process, spatial anti-aliasing. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Line drawing algorithmA 5-minute orientation
- Skim a recent paper: Dynamic Line Drawing: A Motion Semantics-Based Photo-to-Sketch Rendering AlgorithmInfluential work since 2022
- Pick up a classic book: The Book of ShadersThe most-reprinted book on the subject
- Read the landmark paper: An Algorithm for Straight-Line Drawing of Planar GraphsCited 21 times
- Go sideways: Digital differential analyzer (graphics algorithm)A closely related topic
- Go sideways: Bresenham's line algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
An Algorithm for Straight-Line Drawing of Planar Graphs
A Run‐Length Slice Line Drawing Algorithm without Division Operations
Line Drawing Algorithm on an Interleaved Grid
Bresenham's Line and Circle Drawing Algorithm using FPGA
A raster-mode algorithm for interactive modification of line drawing data
A new antialiased line drawing algorithm
Line drawing algorithm based on pixel chain
Machine Learning is Line Drawing Algorithm
🆕 Influential since 2022
📚 Books worth reading
The Book of ShadersPatricio Gonzalez Vivo · 2015
Starting Out with JavaTony Gaddis · 2004
Approximation and Online AlgorithmsThomas Erlebach · 2013
Programming principles in computer graphicsL. Ammeraal · 1986
Computational Visual MediaShi-Min Hu · 2012
Graph DrawingWalter Didimo · 2013
Computational GeometryAlberto Márquez · 2012
Introduction to Programming in JavaRobert Sedgewick, Kevin Wayne · 2007
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Digital differential analyzer (graphics algorithm) In computer graphics, a digital differential analyzer (DDA) is hardware or software used for interpolation of variables over an interval between start…
- Bresenham's line algorithm Bresenham's line algorithm is a line drawing algorithm that determines the points of an n-dimensional raster that should be selected in order to form a…
- Xiaolin Wu's line algorithm Xiaolin Wu's line algorithm is an algorithm for line antialiasing. Xiaolin Wu's line algorithm was presented in the article "An Efficient Antialiasing…
- Flood fill Flood fill, also called seed fill, is a flooding algorithm that determines and alters the area connected to a given node in a multi-dimensional array with…
- Liang–Barsky algorithm In computer graphics, the Liang–Barsky algorithm (named after You-Dong Liang and Brian A. Barsky) is a line clipping algorithm first published in early…
- Hessian form of an elliptic curve In geometry, a Hessian curve is a cubic plane curve similar to the folium of Descartes that belongs to the Hesse pencil. It is named after the German mathematic…
- Ellipse In mathematics, an ellipse is a plane curve surrounding two focal points, such that for all points on the curve, the sum of both distances to the two focal…
- Slope In mathematics, the slope or gradient of a line is a number that describes the direction of the line on a plane. It is commonly denoted by the letter m…