Sutherland–Hodgman clipping algorithm
Sutherland–Hodgman clipping algorithm A polygon-clipping algorithm in which the fundamental idea is to clip the original polygon and each resulting intermediate polygon against each edge of the clipping region in succession. The algorithm allows any planar or nonplanar polygon to be clipped to a convex clipping volume.
More From encyclopedia.com
Volume , Volume
Volume is the amount of space occupied by an object or a material. Volume is said to be a derived unit, since the volume of an object can be k… Molar Volume , molar volume, the volume occupied by a mole of a substance at STP. According to Avogadro's law, at a given temperature and pressure a given volume of… Regionalism , Regionalism is the idea or practice of dividing a country into smaller units for political, economic, social, and cultural purposes. Politically, reg… Formulas For The Volumes Of Some Common Solids , Formulas for the Volumes of Some Common Solids
Bhrlw
Formulas for the Volumes of Some Common Solids
Solid
Volume
Abbreviations: = area of base; = hei… Hangzhou , Hangzhou •allow, avow, Bilbao, Bissau, bough, bow, bow-wow, brow, cacao, chow, ciao, cow, dhow, Dow, endow, Foochow, Frau, Hangzhou, Hough, how, Howe… Region , Region
A region is a homogeneous area with physical and cultural characteristics distinct from those of neighboring areas. As part of a national doma…
About this article
Sutherland–Hodgman clipping algorithm
You Might Also Like
NEARBY TERMS
Sutherland–Hodgman clipping algorithm