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

Remove colour attributes from body and strip most of the font tags out

Browse source
This commit is contained in:
James Gregory 2013-12-30 13:57:02 +11:00
commit c1f88ddb41
362 changed files with 1632 additions and 1706 deletions
Download patch file Download diff file Expand all files Collapse all files

8
40-05.html
View file

@ -24,7 +24,7 @@
<!--CHAPTER=40//-->
<!--PAGES=755-756//-->
<!--UNASSIGNED1//-->
<!--UNASSIGNED2//--></HEAD><BODY LINK=#0000FF ALINK=#000099 VLINK=#0000FF BGCOLOR=#FFFFFF>
<!--UNASSIGNED2//--></HEAD><body>
<CENTER>
<TABLE BORDER>
@ -40,10 +40,10 @@
</P>
<TABLE WIDTH="100%"><TD WIDTH="5%" VALIGN="TOP"><IMG SRC="images/i.jpg"><TD WIDTH="95%"><SMALL><I>The potential 1 to 5 percent speedup gained by optimizing AET sorting just isn&rsquo;t worth it in any but the most demanding application&mdash;a good example of the need to keep an overall perspective when comparing the theoretical characteristics of various approaches.</I></SMALL>
</TABLE>
<H3><A NAME="Heading8"></A><FONT COLOR="#000077">Nonconvex Polygons</FONT></H3>
<H3><A NAME="Heading8"></A>Nonconvex Polygons</H3>
<P>Nonconvex polygons can be filled somewhat faster than complex polygons. Because edges never cross or switch positions with other edges once they&rsquo;re in the AET, the AET for a nonconvex polygon needs to be sorted only when new edges are added. In order for this to work, though, edges must be added to the AET in strict left-to-right order. Complications arise when dealing with two edges that start at the same point, because slopes must be compared to determine which edge is leftmost. This is certainly doable, but because of space limitations and limited performance returns, I haven&rsquo;t implemented this in Listing 40.1.
</P>
<H4 ALIGN="LEFT"><A NAME="Heading9"></A><FONT COLOR="#000077">Details, Details</FONT></H4>
<H4 ALIGN="LEFT"><A NAME="Heading9"></A>Details, Details</H4>
<P>Every so often, a programming demon that I&rsquo;d thought I&rsquo;d forever laid to rest arises to haunt me once again. A minor example of this&mdash;an imp, if you will&mdash;is the use of &ldquo; = &rdquo; when I mean &ldquo; == ,&rdquo; which I&rsquo;ve done all too often in the past, and am sure I&rsquo;ll do again. That&rsquo;s minor deviltry, though, compared to the considerably greater evils of one of my personal scourges, of which I was recently reminded anew: too-close attention to detail. Not seeing the forest for the trees. Looking low when I should have looked high. Missing the big picture, if you catch my drift.
</P>
<P>Thoreau said it best: &ldquo;Our life is frittered away by detail....Simplify, simplify.&rdquo; That quote sprang to mind when I received a letter a while back from Anton Treuenfels of Fridley, Minnesota, thanking me for clarifying the principles of filling adjacent convex polygons in my ongoing writings on graphics programming. (You&rsquo;ll find this material in the previous two chapters.) Anton then went on to describe his own method for filling convex polygons.</P>
@ -64,7 +64,7 @@
<hr width="90%" size="1" noshade>
<div align="center">
<font face="Verdana,sans-serif" size="1">Graphics Programming Black Book &copy; 2001 Michael Abrash</font>
Graphics Programming Black Book &copy; 2001 Michael Abrash
</div>
<!-- all of the reference materials (books) have the footer and subfoot reveresed -->
<!-- reference_subfoot = footer -->