Supplementary Note Clipping In Chapter 4 the Hodgman-Sutherland clipping algorithm was explained. Given an affine function f (x) and a polygonal path γ , it returns the truncation of γ to the region f ≤ 0. It has on

Source URL: www.math.ubc.ca

On-Line Computer Graphics Notes CLIPPING Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science

Source URL: graphics.idav.ucdavis.edu

• Polytopes
• Clipping
• Euclidean plane geometry
• Polyhedron
• Vertex
• Normal
• Convex polytope
• Sutherland–Hodgman algorithm
• Cyrus–Beck algorithm
• Geometry
• 3D computer graphics
• Polygons