Changeset 3064 for GTP/trunk/App/Demos/Vis/FriendlyCulling/src/Bvh.h

Timestamp:

10/23/08 23:10:16 (16 years ago)

Author:

mattausch

Message:

working on dynamic bvh hierarchy: denug version

File:

• GTP/trunk/App/Demos/Vis/FriendlyCulling/src/Bvh.h (modified) (9 diffs)

GTP/trunk/App/Demos/Vis/FriendlyCulling/src/Bvh.h

@@ -478 +478 @@
         */
         BvhNode *GetRoot() { return mRoot; }
-        /** Sets the scene camera
-        */
-        //void SetCamera(Camera * camera) { mCamera = camera; }
-
+        
         ///////////////
         //-- functions collecting nodes based on some criteria
 
+        /** Collect all nodes higher or equal to a given depth.
+        */
         void CollectNodes(BvhNode *node, BvhNodeContainer &nodes, int depth);
         void CollectNodes(BvhNode *node, BvhNodeContainer &nodes);
+        /** Collect the "physical" leaves of the hierarchy
+        */
         void CollectLeaves(BvhNode *node, BvhLeafContainer &leaves);
-        /** Collect only the virtual leaves.
+        /** Collect only the virtual leaves (can be anywhere in the Žhierarchy).
         */
         void CollectVirtualLeaves(BvhNode *node, BvhNodeContainer &leaves);
@@ -543 +544 @@
         */
         void ResetNodeClassifications();
-        /** Helper function that renders the bounding boxes of the leaves as
-                wireframes for visualization purpose.
-        */
-        //void RenderBoundingBoxesForViz(int mode);
         /** Count triangles the node contains.
         */
@@ -557 +554 @@
         void ComputeIds();
         /** Assign virtual leaves based on specified number of triangles per leaf.
+                That means that we try to set the leaves at a point where we
+                have less than numTriangles triangles within this leaf and beyond.
+
+                Virtual leaves are nodes that are determined to be the leaves
+                of the hierarchy during render traversal. These nodes are not necessarily 
+                the same as the real leaves of the hierarchy and can be anywhere
+                in the hierarchy. 
+                Please refer to the article for more info about virtual leaves
         */
         void SetVirtualLeaves(int numTriangles);
         
 
-        ////////
-        //-- functions influencing tighter bounds
+        ////////////
+        //-- functions influencing the tightness of the bounds that are used for testing
 
 
         /** Sets maximal depth for taking the bounding boxes to test the
                 visibility of a node. 
-                Deeper => the bounds adapt more to the geometry.
+                Deeper level means that the bounds adapt more to the geometry but
+                also that more boxes are rendered
         */
         void SetMaxDepthForTestingChildren(int maxDepth);
-
+        /** The ratio of area between node and subnodes where 
+                testing the subnodes as proxy is still considered feasable
+        */
         void SetAreaRatioThresholdForTestingChildren(float ratio);
 
@@ -583 +591 @@
         void RenderBoundsForViz(BvhNode *node, RenderState *state, bool useTightBounds);
 
+        void AddDynamicObject(SceneEntity *ent);
+
 
 protected:
@@ -608 +618 @@
         
         void PrepareVertices();
-
+        /** Prepare nodes for vbo rendering.
+        */
         int PrepareBoundsWithDrawArrays(const BvhNodeContainer &nodes);
+        /** Render the nodes from the vbo prepared previously.
+        */
         void RenderBoundsWithDrawArrays(int numNodes, RenderState *state);
 
@@ -643 +656 @@
 
         /////////////////////////////
-
+        // functions that are required to build the dynamic part of the hierarchy
         int SortTriangles(BvhLeaf *leaf, 
                               int axis, 
@@ -656 +669 @@
                                    int parentAxis, 
                                                    SceneEntityContainer &entities);
-
         /** Recompute the dynamic branch of the hierarchy.
         */
@@ -663 +675 @@
         inline bool TerminationCriteriaMet(BvhLeaf *leaf) const;
 
+        /** Returns number of bvh nodes.
+        */
+        inline int GetNumStaticNodes() const { return mNumNodes; }
 
         ////////////////////////
@@ -670 +685 @@
         /// the root of the hierarchy
         BvhNode *mRoot;
+        /// the root of static part of the the hierarchy
+        BvhNode *mStaticRoot;
+        /// the root of dynamic part of the the hierarchy
+        BvhNode *mDynamicRoot;
         /// pointers to the geometry associated with this node
         SceneEntity **mGeometry;