Algorithms that draw lines and circles on a pixel grid or cut shapes to a window, such as Bresenham's line algorithm, the midpoint circle algorithm, Cohen-Sutherland, Liang-Barsky and Sutherland-Hodgman. An algorithm belongs here when its cited article describes line drawing, rasterizing or clipping. It excludes the algorithms that analyse point sets. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.
Browse By
Line Drawing and Clipping Algorithms
Filter Results6 entries
Sources
Bresenham's line algorithm, Wikipedia
Has Member: Bresenham's Line Algorithm, Lead sectionQuote, Has Member: Bresenham's Line Algorithm, Lead section
is a line drawing algorithm
View the Source Cohen-Sutherland algorithm (Wikipedia)
Has Member: Cohen-Sutherland Algorithm, Lead sectionQuote, Has Member: Cohen-Sutherland Algorithm, Lead section
algorithm used for line clipping
View the Source Sutherland-Hodgman algorithm (Wikipedia)
Has Member: Sutherland-Hodgman Algorithm, Lead sectionQuote, Has Member: Sutherland-Hodgman Algorithm, Lead section
algorithm used for clipping polygons
View the Source Liang-Barsky algorithm (Wikipedia)
Has Member: Liang-Barsky Algorithm, Lead sectionQuote, Has Member: Liang-Barsky Algorithm, Lead section
is a line clipping algorithm
View the Source Midpoint circle algorithm (Wikipedia)
Has Member: Midpoint Circle Algorithm, Lead sectionQuote, Has Member: Midpoint Circle Algorithm, Lead section
algorithm used to determine the points needed for rasterizing a circle
View the Source Weiler-Atherton clipping algorithm (Wikipedia)
Has Member: Weiler-Atherton Algorithm, LeadQuote, Has Member: Weiler-Atherton Algorithm, Lead
The Weiler-Atherton is a polygon-clipping algorithm.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.