<html>
<head>
<title>
Polygon scan conversion and clipping
</title>
</head>
<body>

<h2>
Polygon scan conversion and clipping
</h2>

<blockquote>
CS 248 - Introduction to Computer Graphics
<br>
Spring Quarter, 1995
<br>
Marc Levoy
<br>
Lecture notes for Thursday, April 27
<br>
</blockquote>


<p>
<hr>

<h3>Table of contents:</h3>
<ul>
<li>	Polygon scan conversion
	<ol>
	<li>	<a href="#Assumptions">
		Assumptions</a>
	<li>	<a href="#Algorithm">
		Algorithm</a>
	<li>	<a href="#Which pixels to fill?">
		Which pixels to fill?</a>
	</ol>
<li>	Polygon clipping
	<ol>
	<li>	<a href="#Sutherland-Hodgman algorithm">
		Sutherland-Hodgman algorithm</a>
	<li>	<a href="#Utilities">
		Utilities</a>
	</ol>
</ul>

<p>
<hr>

<a name="Assumptions"></a>
<img src="scan8.gif">
<hr>

<a name="Algorithm"></a>
<img src="scan9.gif">
<hr>

<a name="Which pixels to fill?"></a>
<img src="scan10.gif">
<hr>

<a name="Sutherland-Hodgman algorithm"></a>
<img src="scan11.gif">
<hr>

<a name="Utilities"></a>
<img src="scan12.gif">
<hr>
<img src="scan13.gif">
<hr>

<address>
levoy@cs.stanford.edu
</address>
Friday, 20-Feb-1998 13:46:38 PST

</body>
</html>
