Sutherland–Hodgman algorithm
The Sutherland–Hodgman algorithm is an algorithm used for clipping polygons. It works by extending each line of the convex clip polygon in turn and selecting only vertices from the subject polygon that are on the visible side.
- Comment
- enThe Sutherland–Hodgman algorithm is an algorithm used for clipping polygons. It works by extending each line of the convex clip polygon in turn and selecting only vertices from the subject polygon that are on the visible side.
- Depiction
- Has abstract
- enThe Sutherland–Hodgman algorithm is an algorithm used for clipping polygons. It works by extending each line of the convex clip polygon in turn and selecting only vertices from the subject polygon that are on the visible side.
- Is primary topic of
- Sutherland–Hodgman algorithm
- Label
- enSutherland–Hodgman algorithm
- Link from a Wikipage to an external page
- www.cs.drexel.edu/~david/Classes/CS430/Lectures/L-05_Polygons.6.pdf
- github.com/mdabdk/sutherland-hodgman
- rosettacode.org/wiki/Sutherland-Hodgman_polygon_clipping
- Link from a Wikipage to another Wikipage
- Algorithm
- Category:Polygon clipping algorithms
- Clipping (computer graphics)
- Communications of the ACM
- Concave polygon
- Convex polygon
- Cross product
- File:Sutherland-Hodgman clipping sample.svg
- Ivan Sutherland
- Line clipping
- List (computing)
- Polygon
- Rasterisation
- Vatti clipping algorithm
- Weiler–Atherton
- Weiler–Atherton clipping algorithm
- SameAs
- Algorithme de Sutherland-Hodgman
- Algorithmus von Sutherland-Hodgman
- Algoritmo de Sutherland-Hodgman
- Algorytm Sutherlanda-Hodgmana
- k2ck
- m.02r568d
- Q1808181
- Sutherland-Hodgmans algoritme
- الگوریتم سادرلند-هاجمن
- 萨瑟兰-霍奇曼算法
- Subject
- Category:Polygon clipping algorithms
- Thumbnail
- WasDerivedFrom
- Sutherland–Hodgman algorithm?oldid=1059508774&ns=0
- WikiPageLength
- 4832
- Wikipage page ID
- 11253703
- Wikipage revision ID
- 1059508774
- WikiPageUsesTemplate
- Template:ISBN
