source: Documentation/D5.3 Stand-alone computation package for illumination algorithms/appendix/pathmap/html/class_k_d_tree-members.html @ 2910

Revision 2910, 6.6 KB checked in by hbeneit, 16 years ago (diff)
Line 
1<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
2<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
3<title>Path Map Module: Member List</title>
4<link href="doxygen.css" rel="stylesheet" type="text/css">
5<link href="tabs.css" rel="stylesheet" type="text/css">
6</head><body>
7<!-- Generated by Doxygen 1.4.6-NO -->
8<div class="tabs">
9  <ul>
10    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
11    <li id="current"><a href="annotated.html"><span>Classes</span></a></li>
12  </ul></div>
13<div class="tabs">
14  <ul>
15    <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
16    <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
17    <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
18  </ul></div>
19<h1>KDTree Member List</h1>This is the complete list of members for <a class="el" href="class_k_d_tree.html">KDTree</a>, including all inherited members.<p><table>
20  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#631ac2d9a082e2744fcc035d7f3d91cc">boundingBox</a></td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
21  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#76bcd994d6db73c97c31b326d3aca351">build</a>(unsigned int nodeID, unsigned int *boundsArray, unsigned int nObjects, BoundingBox &amp;limits, unsigned char axisNmask)</td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
22  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#1afbe38e70fc1e48465a05fa990b66b8">compare</a>(unsigned int aIndex, unsigned int bIndex, unsigned char axis)</td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [inline, private]</code></td></tr>
23  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#b68b5752b8f6364d0da738b0712be9b4">createBoundingBox</a>(Intersectable **iObjects, int nObjects)</td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [inline, private]</code></td></tr>
24  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#87fed42fc407cd3b3fc48f817363b086">deleteLeaves</a>(unsigned int nodeID)</td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
25  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#105aef624bff8e8a0d228b17dcdb573f">findBound</a>(unsigned int *extremeArrayStart, unsigned int nBounds, float loc, unsigned char axis)</td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
26  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#cd6808333cc2366abd86b9db8ee431a6">followChildren</a>(unsigned int &amp;parent, unsigned int &amp;leftChild, unsigned int &amp;rightChild)</td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [inline, private]</code></td></tr>
27  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#ad4e64ac39a548aa6da0ad205e4754e4">freeNodes</a></td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
28  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#800b31f66431519be13bf61d878d9095">getBoundValue</a>(unsigned int *extremeIndex, unsigned char axis)</td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [inline, private]</code></td></tr>
29  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#3d68e4e5ea6a01ec90f6fac0206db10b">getFreeNodes</a>(unsigned int parent, unsigned int &amp;leftFree, unsigned int &amp;rightFree)</td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [inline, private]</code></td></tr>
30  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#ee7d01501f9083d241954169fd629944">isLeaf</a>(unsigned int xnode)</td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [inline, private]</code></td></tr>
31  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#f6de48530830ab214b595b1d5fa953fa">makePointer</a>(unsigned int originalNode)</td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [inline, private]</code></td></tr>
32  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#c5eca2d0e7180f8d326cedd1a868b522">maxNCacheLines</a></td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
33  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#4df811dc96e1954918fd5d725a2d9d11">nCacheLineBytes</a></td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
34  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#debce371c710f1a5c321c78c2698f7ab">nCacheLineNodes</a></td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
35  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#67906a4703fbdf02db9c64cf09558a9e">nCacheLines</a></td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
36  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#41cda43f0503d8747cffeef2a5738621">nObjects</a></td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
37  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#c42dd9d141c754bf761abbe331a9b962">nodeTable</a></td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
38  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#44c1da792f9896ac252d552db9cfc08c">objects</a></td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
39  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#6cd111151b9938580fbf7d4201d917bd">poolNodeTable</a></td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
40  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#3af297547b85ab7f81ae4f10f6f8e98f">quickSort</a>(unsigned int *lo0, unsigned int *hi0, unsigned char axis)</td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
41  <tr class="memlist"><td><a class="el" href="class_k_d_tree.html#a3f696e96e55fa5bd6529c62c5c92d54">traverseStack</a></td><td><a class="el" href="class_k_d_tree.html">KDTree</a></td><td><code> [private]</code></td></tr>
42</table><hr size="1"><address style="align: right;"><small>Generated on Thu Apr 27 17:17:42 2006 for Path Map Module by&nbsp;
43<a href="http://www.doxygen.org/index.html">
44<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.6-NO </small></address>
45</body>
46</html>
Note: See TracBrowser for help on using the repository browser.