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
60-04.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="60-03.html">Previous</a></td>
<td>
<a href="60-03.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="61-01.html">Next</a></td>
<td>
<a href="61-01.html">Next</a>
</td>
</tr>
</table>
</center>
<p><br /></p>
<p>Listing 60.1 isn&rsquo;t very long or complex, but it&rsquo;s somewhat more complicated than it could be because it&rsquo;s structured to allow visual display of the ongoing compilation process. That&rsquo;s because Listing 60.1 is actually just a part of a BSP compiler for Win32 that visually depicts the progressive subdivision of space as the BSP tree is built. (Note that Listing 60.1 might not compile as printed; I may have missed copying some global variables that it uses.) The complete code is too large to print here in its entirety, but it&rsquo;s on the CD-ROM in file DDJBSP.ZIP.</p>
<h3 id="Heading7">Optimizing the BSP Tree</h3>
@ -50,16 +53,20 @@
<p>Although BSP trees have been around for at least 15 years now, they&rsquo;re still only partially understood and are a ripe area for applied research and general ingenuity. You might want to try your hand at inventing new BSP optimization approaches; it&rsquo;s an interesting problem, and you might strike paydirt. There are many things that BSP trees can&rsquo;t do well, because it takes so long to build them&mdash;but what they do, they do exceedingly well, so a better compilation approach that allowed BSP trees to be used for more purposes would be valuable, indeed.</p>
<p><br /></p>
<center>
<table border="1">
<tr>
<td><a href="60-03.html">Previous</a></td>
<td>
<a href="60-03.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="61-01.html">Next</a></td>
<td>
<a href="61-01.html">Next</a>
</td>
</tr>
</table>
</center>