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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The purpose of this study was to gain a better understanding of false memories and Need for Cognition (NFC). The relationship was… 
2015
2015
In this paper, we propose an unconventional layer based clipping algorithm for 3D regions. In computer graphics, clipping is used… 
2013
2013
Liz Hodgman provides some ideas for engaging children through this maths based activity, and explains how you can enhance it by… 
2011
2011
We consider the volume corrected characteristics-mixed method (VCCMM) for tracer transport problems. The volume correction… 
2011
2011
These beautiful toys can provide a host of interesting problem solving activities for children to explore, writes Liz Hodgman. 
2008
2008
Dalam dunia kedokteran, salah satu upaya untuk mengurangi resiko kesalahan pada saat operasi pembedahan dan efek samping pasca… 
1991
1991
1991
1991
A well-known algorithm for clipping a polygon against a rectangular window is the one developed by Sutherland and ttodgman. This… 
1975
1975
Foram continuados os estudos da parte experimental do metodo da 2,2'-dipiridil cetoxima, cuja finalidade e o estabelecimento de… 
1968
1968
Sutherland & Andelman (1967) summarized a portion of a study reported by Babb (1957) and criticized it on the bases that the…