Changeset 598 for trunk/VUT/GtpVisibilityPreprocessor/src/VspKdTree.cpp

Timestamp:

02/05/06 11:03:17 (18 years ago)

Author:

mattausch

Message:

added cutting plane and enlarging view space

File:

• trunk/VUT/GtpVisibilityPreprocessor/src/VspKdTree.cpp (modified) (1 diff)

trunk/VUT/GtpVisibilityPreprocessor/src/VspKdTree.cpp

@@ -2273 +2273 @@
         }
 }
-#if 0
-void VspKdTree::CollectMergeCandidates(const vector<VspKdRay *> &rays)
-{
-        VspKdMergeCandidate::sOverallCost = 0;
-
-        vector<VspKdIntersection>::const_iterator iit;
-        map<BspLeaf *, vector<BspLeaf*> candidateMap;
-
-        for (int i = 0; i < (int)rays.size(); ++ i)
-        {  
-                //VspKdLeaf::NewMail();
-                VspKdRay *ray = rays[i];
-          
-                // traverse leaves stored in the rays and compare and merge consecutive
-                // leaves (i.e., the neighbors in the tree)
-                if (ray->intersections.size() < 2)
-                        continue;
-          
-                iit = ray->intersections.begin();
-
-                BspLeaf *previousLeaf = (*iit).mLeaf;
-        
-                ++ iit;
-                
-                for (; iit != ray->intersections.end(); ++ iit)
-                {
-            BspLeaf *leaf = (*iit).mLeaf;
-                        leaf->Mail
-                        // TODO: how to sort out doubles?
-                        VspKdMergeCandidate mc = VspKdMergeCandidate(leaf, previousLeaf);
-                        mMergeQueue.push(mc);
-
-                        VspKdMergeCandidate::sOverallCost += mc.GetLeaf1Cost();
-                        VspKdMergeCandidate::sOverallCost += mc.GetLeaf2Cost();
-
-                        previousLeaf = leaf;
-        }
-        }
-}
-#endif
+
 
 int VspKdTree::MergeViewCells(const VssRayContainer &rays)