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

Strip comments and inline ids onto h*

Browse source
This commit is contained in:
James Gregory 2013-12-30 15:11:04 +11:00
commit 0f5f617adb
362 changed files with 2519 additions and 6694 deletions
Download patch file Download diff file Expand all files Collapse all files

24
40-02.html
View file

@ -10,16 +10,9 @@
<meta name="vspubdate" content="07/01/97" />
<meta name="vscategory" content="Web and Software Development: Game Development,Web and Software Development: Graphics and Multimedia Development" />
<title>Michael Abrash's Graphics Programming Black Book Special Edition: Of Songs, Taxes, and the Simplicity of Complex Polygons</title><!-- HEADER -->
<!-- Empty Reference Subhead -->
<!--ISBN=1576101746//-->
<!--TITLE=Michael Abrash's Graphics Programming Black Book Special Edition//-->
<!--AUTHOR=Michael Abrash//-->
<!--PUBLISHER=The Coriolis Group, Inc.//-->
<title>Michael Abrash's Graphics Programming Black Book Special Edition: Of Songs, Taxes, and the Simplicity of Complex Polygons</title>
<meta name="chapter" content="40" />
<meta name="pages" content="744-750" />
<!--UNASSIGNED1//-->
<!--UNASSIGNED2//-->
</head>
<body>
@ -59,13 +52,12 @@
<dd><b>7.</b>&nbsp;&nbsp;If either the AET or GET isn&rsquo;t empty, go to step 2.</dd>
</dl>
<p><a id="Fig3"><!-- </A><A HREF="javascript:displayWindow('images/40-03.jpg',407,199 )"> --><img src="images/40-03.jpg" /><br />
<!-- </A>
<BR><A HREF="javascript:displayWindow('images/40-03.jpg',407,199)"> --><b>Figure 40.3</b></a>&nbsp;&nbsp;<i>The global and active edge tables as linked lists.</i></p>
<p><a id="Fig3"><img src="images/40-03.jpg" /><br />
<b>Figure 40.3</b></a>&nbsp;&nbsp;<i>The global and active edge tables as linked lists.</i></p>
<p>That&rsquo;s really all there is to it. Compare Listing 40.1 to the fast convex polygon filling code from Chapter 39, and you&rsquo;ll see that, contrary to expectation, complex polygon filling is indeed one of the more sane and sensible corners of the universe.</p>
<p><b>LISTING 40.1 L40-1.C</b></p><!-- CODE //-->
<p><b>LISTING 40.1 L40-1.C</b></p>
<pre>
/* Color-fills an arbitrarily-shaped polygon described by VertexList.
If the first and last points in VertexList are not the same, the path
@ -344,7 +336,7 @@
CurrentEdge = CurrentEdge-&gt;NextEdge;
}
}
</pre><!-- END CODE //-->
</pre>
<p><br /></p>
@ -363,10 +355,6 @@
<div align="center">
Graphics Programming Black Book &copy; 2001 Michael Abrash
</div><!-- all of the reference materials (books) have the footer and subfoot reveresed -->
<!-- reference_subfoot = footer -->
<!-- reference_footer = subfoot -->
<!-- BEGIN SUB FOOTER -->
<!-- END FOOTER -->
</div>
</body>
</html>