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
59-06.html
View file

@ -24,7 +24,7 @@
<!--CHAPTER=59//-->
<!--PAGES=1112-1114//-->
<!--UNASSIGNED1//-->
<!--UNASSIGNED2//--></HEAD><BODY LINK=#0000FF ALINK=#000099 VLINK=#0000FF BGCOLOR=#FFFFFF>
<!--UNASSIGNED2//--></HEAD><body>
<CENTER>
<TABLE BORDER>
@ -50,9 +50,9 @@
<P>With each iteration you&rsquo;ll dig deeper, learn more, and improve your ability to know where and how to focus your design and programming efforts. For example, with the C compilers I used five to 10 years ago, back when I learned about the relative strengths and weaknesses of code and data recursion, and with the processors then in use, Listing 59.4 would have blown away Listing 59.2. While doing this chapter, I&rsquo;ve learned that given current processors and compiler technology, data recursion isn&rsquo;t going to get me any big wins; and yes, that was news to me. That&rsquo;s <I>good</I>; this information saves me from wasted effort in the future and tells me what to concentrate on when I use recursion.</P>
<P>Assume nothing, keep digging deeper, and never stop learning and growing. The world won&rsquo;t hold still for you, but fortunately you <I>can</I> run fast enough to keep up if you just keep at it.</P>
<P>Depths within depths indeed!</P>
<H3><A NAME="Heading11"></A><FONT COLOR="#000077">Surfing Amidst the Trees</FONT></H3>
<H3><A NAME="Heading11"></A>Surfing Amidst the Trees</H3>
<P>In the next chapter, we&rsquo;ll build a BSP-tree compiler, and after that, we&rsquo;ll put together a rendering system built around the BSP trees the compiler generates. If the subject of BSP trees really grabs your fancy (as it should if you care at all about performance graphics) there is at this writing (February 1996) a World Wide Web page on BSP trees that you must investigate at <A HREF="http://www.qualia.com/bspfaq/">http://www.qualia.com/bspfaq/</A>. It&rsquo;s set up in the familiar Internet Frequently Asked Questions (FAQ) style, and is very good stuff.</P>
<H4 ALIGN="LEFT"><A NAME="Heading12"></A><FONT COLOR="#000077">Related Reading</FONT></H4>
<H4 ALIGN="LEFT"><A NAME="Heading12"></A>Related Reading</H4>
<P>Foley, J., A. van Dam, S. Feiner, and J. Hughes, <I>Computer Graphics: Principles and Practice (Second Edition)</I>, Addison Wesley, 1990, pp. 555-557, 675-680.</P>
<P>Fuchs, H., Z. Kedem, and B. Naylor, &ldquo;On Visible Surface Generation by A Priori Tree Structures,&rdquo; <I>Computer Graphics</I> Vol. 17(3), June 1980, pp. 124-133.</P>
<P>Gordon, D., and S. Chen, &ldquo;Front-to-Back Display of BSP Trees,&rdquo; <I>IEEE Computer Graphics and Applications,</I> September 1991, pp. 79-85.</P>
@ -69,7 +69,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 -->