MAKE A MEME View Large Image Sutherland-Hodgman caseD.svg Single step of internal loop of Sutherland-Hodgman clipping algorithm where certain edge of convex polygon denotes halfpace grayed area -- inside Single edge SN of non-convex polygon per iteration is analyzed in ...
View Original:Sutherland-Hodgman caseD.svg (300x300)
Download: Original    Medium    Small Thumb
Courtesy of:commons.wikimedia.org More Like This
Keywords: Sutherland-Hodgman caseD.svg Single step of internal loop of Sutherland-Hodgman clipping algorithm where certain edge of convex polygon denotes halfpace grayed area -- inside Single edge SN of non-convex polygon per iteration is analyzed in this case edge SN cross edge of convec polygon at point P -- points P and N are saved in this order Own 2008-03-02 Wojciech Muła public domain Sutherland-Hodgman algorithm
Terms of Use   Search of the Day