From aaa2a41e0154b404e60184e66f91bf2eea4f96bf Mon Sep 17 00:00:00 2001
From: Simon Giraudot <simon.giraudot@geometryfactory.com>
Date: Wed, 30 Mar 2016 14:08:28 +0200
Subject: [PATCH] Explicit propagations of property maps to Octree structures

---
 .../include/CGAL/Shape_detection_3/Efficient_RANSAC.h      | 7 +++++--
 1 file changed, 5 insertions(+), 2 deletions(-)

diff --git a/Point_set_shape_detection_3/include/CGAL/Shape_detection_3/Efficient_RANSAC.h b/Point_set_shape_detection_3/include/CGAL/Shape_detection_3/Efficient_RANSAC.h
index b4f2fb7cf7b..634ca2b2ad7 100644
--- a/Point_set_shape_detection_3/include/CGAL/Shape_detection_3/Efficient_RANSAC.h
+++ b/Point_set_shape_detection_3/include/CGAL/Shape_detection_3/Efficient_RANSAC.h
@@ -298,12 +298,14 @@ shape. The implementation follows \cgalCite{schnabel2007efficient}.
           m_direct_octrees[s] = new Direct_octree(
             m_traits, last + 1,
             last + subsetSize + 1,
+            m_point_pmap, m_normal_pmap,
             remainingPoints - subsetSize);
         }
         else
           m_direct_octrees[0] = new Direct_octree(
             m_traits, m_input_iterator_first,
-            m_input_iterator_first + (subsetSize), 
+            m_input_iterator_first + (subsetSize),
+            m_point_pmap, m_normal_pmap,
           0);
 
         m_available_octree_sizes[s] = subsetSize;
@@ -313,7 +315,8 @@ shape. The implementation follows \cgalCite{schnabel2007efficient}.
       }
 
       m_global_octree = new Indexed_octree(
-        m_traits, m_input_iterator_first, m_input_iterator_beyond);
+        m_traits, m_input_iterator_first, m_input_iterator_beyond,
+        m_point_pmap, m_normal_pmap);
       m_global_octree->createTree();
 
       return true;