Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
ACM transactions on graphics, 1998-04, Vol.17 (2), p.71-83
Ort / Verlag
New York, NY, USA: ACM
Erscheinungsjahr
1998
Quelle
ACM Digital Library
Beschreibungen/Notizen
Clipping 2D polygons is one of the basic routines in computer graphics. In rendering complex 3D images it has to be done several thousand times. Efficient algorithms are therefore very important. We present such an efficient algorithm for clipping arbitrary 2D-polygons. The algorithm can handle arbitrary closed polygons, specifically where the clip and subject polygons may self-intersect. The algoirthm is simple and faster that Vatti's (1992) algorithm, which was designed for the general case as well. Simple modifications allow determination of union and set-theoretic differences of two arbitrary polygons.