Misc/abrash-black-book
Watch
1
0
Fork
You've already forked abrash-black-book
 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Retidy, removing align=left from headings and empty paragraphs

Browse source
This commit is contained in:
James Gregory 2013-12-30 15:37:13 +11:00
commit a96a114403
362 changed files with 8472 additions and 5040 deletions
Download patch file Download diff file Expand all files Collapse all files

31
40-02.html
View file

@ -1,5 +1,4 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<!DOCTYPE html>
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
@ -19,17 +18,21 @@
<center>
<table border="1">
<tr>
<td><a href="40-01.html">Previous</a></td>
<td>
<a href="40-01.html">Previous</a>
</td>
<td><a href="index.html">Table of Contents</a></td>
<td>
<a href="index.html">Table of Contents</a>
</td>
<td><a href="40-03.html">Next</a></td>
<td>
<a href="40-03.html">Next</a>
</td>
</tr>
</table>
</center>
<p><br /></p>
<p>Advancing the X coordinates is easy. For each edge, we&rsquo;ll store the current X coordinate and all required error term information, and we&rsquo;ll use that to advance the edge one scan line at a time; then, we&rsquo;ll resort the AET by X coordinate as needed. Removing edges as they end is also easy; we&rsquo;ll just count down the length of each active edge on each scan line and remove an edge when its count reaches zero. Adding edges as their tops are encountered is a tad more complex. While there are a number of ways to do this, one particularly efficient approach is to start out by putting all the edges of the polygon, sorted by increasing Y coordinate, into a single list, called the <i>global edge table</i> (GET). Then, as each scan line is encountered, all edges at the start of the GET that begin on the current scan line are moved to the AET; because the GET is Y-sorted, there&rsquo;s no need to search the entire GET. For still greater efficiency, edges in the GET that share common Y coordinates can be sorted by increasing X coordinate; this ensures that no more than one pass through the AET per scan line is ever needed when adding new edges from the GET in such a way as to keep the AET sorted in ascending X order.</p>
<p>What form should the GET and AET take? Linked lists of edge structures, as shown in Figure 40.3. With linked lists, all that&rsquo;s required to move edges from the GET to the AET as they become active, sort the AET, and remove edges that have been fully drawn is the exchanging of a few pointers.</p>
@ -338,16 +341,20 @@
}
</pre>
<p><br /></p>
<center>
<table border="1">
<tr>
<td><a href="40-01.html">Previous</a></td>
<td>
<a href="40-01.html">Previous</a>
</td>
<td><a href="index.html">Table of Contents</a></td>
<td>
<a href="index.html">Table of Contents</a>
</td>
<td><a href="40-03.html">Next</a></td>
<td>
<a href="40-03.html">Next</a>
</td>
</tr>
</table>
</center>