Skip to search formSkip to main contentSkip to account menu

Sutherland–Hodgman algorithm

Known as: Sutherland-Hodgman clipping algorithm, Sutherland–Hodgman, Sutherland-Hodgman 
The Sutherland–Hodgman algorithm is used for clipping polygons. It works by extending each line of the convex clip polygon in turn and selecting only… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Boolean operations on polygonsClip coordinatesClipping (computer graphics)Communications of the ACM

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Computer Graphics: From Pixels to Programmable Graphics Hardware
Introduction: Basic Concepts Coordinate spaces, transformations Graphics pipeline Working with the windowing system Colors. Color… 
2011
2011
The mystery of Russian Dolls
These beautiful toys can provide a host of interesting problem solving activities for children to explore, writes Liz Hodgman. 
2008
2008
Perancangan Sistem Simulasi Pemotongan Pada Model Permukaan dengan Algoritma Pengembangan Sutherland -Hodgman
Dalam dunia kedokteran, salah satu upaya untuk mengurangi resiko kesalahan pada saat operasi pembedahan dan efek samping pasca… 
1975
1975
A determinação espectrofotométrica do cobalto pelo método da 2,2'dipiridil cetoxima (II) - escolha do solvente e estudos sobre a extração do composto
Foram continuados os estudos da parte experimental do metodo da 2,2'-dipiridil cetoxima, cuja finalidade e o estabelecimento de… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)