diff --git a/Orthtree/include/CGAL/Orthtree.h b/Orthtree/include/CGAL/Orthtree.h
index d77aeb8e6fa..d07af33f9a1 100644
--- a/Orthtree/include/CGAL/Orthtree.h
+++ b/Orthtree/include/CGAL/Orthtree.h
@@ -485,7 +485,7 @@ public:
     Cartesian_coordinate min_corner, max_corner;
     std::size_t node_depth = depth(n);
 
-    for (int i = 0; i < Dimension::value; i++)
+    for (int i = 0; i < dimension; i++)
     {
       min_corner[i]=compute_cartesian_coordinate(global_coordinates(n)[i], node_depth, i);
       max_corner[i]=compute_cartesian_coordinate(global_coordinates(n)[i]+1, node_depth, i);
@@ -978,8 +978,8 @@ public:
   Point barycenter(Node_index n) const {
     std::size_t node_depth = depth(n);
     // the barycenter is computed as the lower corner of the lexicographically top child node
-    std::array<FT, Dimension::value> bary;
-    for (std::size_t i = 0; i < Dimension::value; i++)
+    std::array<FT, dimension> bary;
+    for (std::size_t i = 0; i < dimension; i++)
       bary[i] = compute_cartesian_coordinate(2 * global_coordinates(n)[i]+1, node_depth+1, i);
 
     return std::apply(m_traits.construct_point_d_object(), bary);
diff --git a/Orthtree/include/CGAL/Orthtree_traits_face_graph.h b/Orthtree/include/CGAL/Orthtree_traits_face_graph.h
index baaebe51d70..a0773582dc9 100644
--- a/Orthtree/include/CGAL/Orthtree_traits_face_graph.h
+++ b/Orthtree/include/CGAL/Orthtree_traits_face_graph.h
@@ -74,7 +74,7 @@ struct Orthtree_traits_face_graph : public Orthtree_traits_base_for_dimension<
   auto construct_root_node_bbox_object() const {
     return [&]() -> Bbox_d {
 
-      std::array<FT, dimension> min = {0.0, 0}, max = {0.0, 0};
+      std::array<FT, Base::dimension> min = {0.0, 0}, max = {0.0, 0};
       if (faces(m_pm).begin() != faces(m_pm).end()) {
         const Point_d& p = get(m_vpm, *vertices(m_pm).begin());
         min = {p.x(), p.y(), p.z()};