Some Notes on Polygons
While I will attempt to treat Polygon Algorithms as a unit, you will find that the book has treated the material by dispersion: pieces are to be found all over the place. As an aid to finding the various items we will be discussing, I offer the following (from my version of the text):
3.6 Filling Polygons (all subsections) 3.14 Clipping Polygons (and subsection)
11. Representing Curves and Surfaces 11.1 Polygon Meshes (and all subsections)
15 Introduction to Hidden Surface 15.2 Techniques for Hidden Surface (and subsection 15.2.1-4) 15.4 Z-Buffer 15.5 List-priority Algorithms 15.5.1 Depth Sort 15.6 Scan-line Algorithms
19.1.4 Weiler Polygon Clipping Algorithm (not discussed in class). We will discuss the simpler Weiler-Atherton Polygon Clipping algorithm on which this one is based. Unfortunately Weiler-Atherton is not in the book, although there is a reference to it at the start of the section 19.1.4: K. Weiler and P. Atherton "Hidden Surface Removal Using Polygon Area Sorting", SIGGRAPH 77, 214-222.. You can also find it in the first edition of Foley and Van Dam, of which there should be copies in the library, Section 11.6.2.