Scan Converting Solid Polygons

Introduction

In this section we will look at operations on solid polygons, including scan conversion and general area filling algorithms. These are image space or scan-line algorithms. The simplest case for scan line algorithms is for a triangle. The next more complex case is for n-sided convex polygons, and finally there is the case for concave polygons. We will not consider polygons with holes since they can be done using area fill techniques.

Polygon Decomposition into Triangles

Scan converting triangles

Scan converting convex polygons

Scan converting concave polygons

Pattern Filling of Polygons

Polygon Area Filling Algorithms

Output Primitives menu
HyperGraph Table of Contents.
HyperGraph Home page.

Last changed May 13, 1998, G. Scott Owen, owen@siggraph.org