Reentrant polygon clipping

A new family of clipping algorithms is described. These algorithms are able to clip polygons against irregular convex plane-faced volumes in three dimensions, removing the parts of the polygon which lie outside the volume. In two dimensions the algorithms permit clipping against irregular convex win...

Full description

Saved in:

Bibliographic Details
Published in:	Communications of the ACM 1974-01, Vol.17 (1), p.32-42
Main Authors:	Sutherland, Ivan E., Hodgman, Gary W.
Format:	Magazinearticle
Language:	English
Subjects:	Computational complexity and cryptography Computational geometry Computer graphics Computing methodologies Decision diagrams Image manipulation Machine learning Machine learning approaches Machine learning theory Markov decision processes Mathematics of computing Oracles and decision trees Probabilistic representations Probability and statistics Randomness, geometry and discrete structures Reinforcement learning Sequential decision making Shape modeling Theory and algorithms for application domains Theory of computation
Citations:	Items that this one cites Items that cite this one
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!