Abstract
Clipping is a process that subdivides each element of a picture to be displayed into its visible and invisible parts, thus allowing us to discard the invisible parts of the picture. In 2D, the clipping process can be applied to a variety of graphics primitives such as points, lines, polygons and curves. Clipping is performed with respect to a clipping boundary, which may be a convex or concave polygonal boundary. Clipping to a convex polygonal boundary is much simpler, thus we will start our discussion by looking at various algorithms that clip graphics primitives against a convex polygonal boundary. In its simplest form, a convex polygonal boundary consists of the four edges of the world window or the screen viewport. In this case, x l (x-left), x r (x-right), y b (y-bottom) and y t (y-top) represent the four extremities of this rectangular clipping boundary.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sutherland, I. E. and Hodgman, G. W. Reentrant polygon clipping. CACM, Vol. 17, No. 1, p.p. 32–42, Jan 1974.
Weiler, K. and Atherton, P. Hidden surface removal using polygon area sorting. Computer Graphics, Vol. 11, No. 2, p.p. 214 –222 (1977).
Rights and permissions
Copyright information
© 2006 Springer-Verlag London Limited
About this chapter
Cite this chapter
(2006). Two-Dimensional Clipping. In: Mathematical and Computer Programming Techniques for Computer Graphics. Springer, London. https://doi.org/10.1007/978-1-84628-292-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-84628-292-8_6
Publisher Name: Springer, London
Print ISBN: 978-1-85233-902-9
Online ISBN: 978-1-84628-292-8
eBook Packages: Computer ScienceComputer Science (R0)