Remove printouts from Efficient_RANSAC.h

CGAL · Aug 7, 2020 · 5dfbbc6 · 5dfbbc6
1 parent c9b003d
commit 5dfbbc6
Showing 1 changed file with 0 additions and 22 deletions.
diff --git a/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC.h b/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC.h
@@ -898,7 +898,6 @@ class Efficient_RANSAC {
 
 private:
   int select_random_octree_level() {
-    std::cout << m_global_octree->maxLevel() << std::endl;
     auto upper_bound = static_cast<unsigned int>(m_global_octree->maxLevel() + 1);
     return (int) get_default_random()(upper_bound);
   }
@@ -965,8 +964,6 @@ class Efficient_RANSAC {
                      std::size_t max_subset,
                      std::size_t min_points) {
 
-    std::cerr << "    Improve bound" << std::endl;
-
     if (candidate->m_nb_subset_used >= max_subset)
       return false;
 
@@ -1031,8 +1028,6 @@ class Efficient_RANSAC {
                     FT epsilon,
                     FT normal_threshold) {
 
-    std::cerr << "  Score" << std::endl;
-
     typedef typename Octree::Node Cell;
 
     std::stack<const Cell *> stack;
@@ -1118,39 +1113,24 @@ class Efficient_RANSAC {
                                           const std::vector<int> &shapeIndex,
                                           std::size_t requiredSamples) {
 
-    std::cerr << "drawSamplesFromCellContainingPoint" << std::endl;
-    std::cerr << "  point: " << p << std::endl;
-    std::cerr << "  level: " << level << std::endl;
-    std::cerr << "  indices size: " << indices.size() << std::endl;
-    std::cerr << "  required samples: " << requiredSamples << std::endl;
-    std::cerr << "  ~~~~~~~~~~~~~~~~~~~~ " << std::endl;
-
-
     typedef typename Octree::Node Cell;
 
     const Cell *cur = node_containing_point(octree, p, level);
 
-    std::cerr << (cur ? "  node found" : "  node not found") << std::endl;
-
     // Stop if the node we need doesn't exist
     if (!cur)
       return false;
 
-    std::cerr << "    points contained: " << cur->size() << std::endl;
-
     // Count point indices that map to -1 in the shape index
     std::size_t enough = 0;
     for (auto j : cur->points()) {
 
-      std::cerr << "  j: " << j << std::endl;
       if (shapeIndex[j] == -1)
         enough++;
       if (enough >= requiredSamples)
         break;
     }
 
-    std::cerr << "  enough: " << enough << std::endl;
-
     // Make sure we found enough samples
     if (enough < requiredSamples)
       return false;
@@ -1165,8 +1145,6 @@ class Efficient_RANSAC {
         indices.insert(j);
     } while (indices.size() < requiredSamples);
 
-    std::cerr << "  indices size: " << indices.size() << std::endl;
-
     return true;
   }