Weiler–Atherton clipping algorithm
Weiler–Atherton clipping algorithm A polygon-clipping algorithm that is capable of clipping a concave polygon with interior holes to the boundaries of another concave polygon also with interior holes. (A concave polygon has an interior angle greater than 180°.) It is thus more general, though more complex, than the Sutherland–Hodgman clipping algorithm.
More From encyclopedia.com
Greater roadrunner , roadrunner, greater (Geococcyx californianus) See CUCULIDAE.
Geococcyx californianus (greater roadrunner) See CUCULIDAE.
greater roadrunner (Geococcy… Complexity , A complex is a group of partially or totally unconscious psychic content (representations, memories, fantasies, affects, and so on), which constitute… motile , mo·tile / ˈmōtl; ˈmōˌtīl/ • adj. 1. Zool. & Bot. (of cells, gametes, and single-celled organisms) capable of motion. 2. Psychol. of, relating to, or… Pollex , pollex The innermost digit on the forelimb of a tetrapod vertebrate. It contains two phalanges (see pentadactyl limb) and in humans and higher primat… Capability Brown , Brown, ‘Capability’ (Lancelot) (1715–83) English landscape gardener who revolutionized garden and parkland layout in the 1700s. He designed or remode… Bee Moth , bee moth, greater wax moth, or honeycomb moth, common name for an insect pest of honeycombs. Bee moths do damage during their larval stages, injuring…
About this article
Weiler–Atherton clipping algorithm
You Might Also Like
NEARBY TERMS
Weiler–Atherton clipping algorithm