diff --git a/Code/SpatialReasoning/otbRCC8EdgeIterator.txx b/Code/SpatialReasoning/otbRCC8EdgeIterator.txx
index 2a5a2a1cc74324cd00c6832bd0554b00f1a84a85..1072e14a3f7e2392572924abd078560a9fbfb5a8 100644
--- a/Code/SpatialReasoning/otbRCC8EdgeIterator.txx
+++ b/Code/SpatialReasoning/otbRCC8EdgeIterator.txx
@@ -28,7 +28,7 @@ RCC8EdgeIterator<TGraph>
 ::RCC8EdgeIterator()
 {
   m_Graph = GraphType::New();
-  tie(m_Iter, m_End) = edges(*m_Graph->GetGraph());
+  boost::tuples::tie(m_Iter, m_End) = edges(*m_Graph->GetGraph());
 }
 /**
  * Copy operator.
@@ -49,7 +49,7 @@ RCC8EdgeIterator<TGraph>
 ::RCC8EdgeIterator(TGraph * graph)
 {
   m_Graph = graph;
-  tie(m_Iter, m_End) = edges(*m_Graph->GetGraph());
+  boost::tuples::tie(m_Iter, m_End) = edges(*m_Graph->GetGraph());
 }
 /**
  * Get the current edge value.
@@ -132,7 +132,7 @@ void
 RCC8EdgeIterator<TGraph>
 ::GoToBegin(void)
 {
-  tie(m_Iter, m_End) = edges(*m_Graph->GetGraph());
+  boost::tuples::tie(m_Iter, m_End) = edges(*m_Graph->GetGraph());
 }
 /**
  * Increment.
diff --git a/Code/SpatialReasoning/otbRCC8InEdgeIterator.txx b/Code/SpatialReasoning/otbRCC8InEdgeIterator.txx
index a98e0db2d3b8954541537a26011e397b24c8a2f0..1dcb6c62932cc2f0dd785344c54b8e98d4bf3c13 100644
--- a/Code/SpatialReasoning/otbRCC8InEdgeIterator.txx
+++ b/Code/SpatialReasoning/otbRCC8InEdgeIterator.txx
@@ -28,7 +28,7 @@ RCC8InEdgeIterator<TGraph>
 ::RCC8InEdgeIterator()
 {
   m_Graph = GraphType::New();
-  tie(m_Iter, m_End) = in_edges(0, *m_Graph->GetGraph());
+  boost::tuples::tie(m_Iter, m_End) = in_edges(0, *m_Graph->GetGraph());
 }
 /**
  * Copy operator.
@@ -51,7 +51,7 @@ RCC8InEdgeIterator<TGraph>
 {
   m_Graph = graph;
   m_VertexIndex = vertex;
-  tie(m_Iter, m_End) = in_edges(vertex, *m_Graph->GetGraph());
+  boost::tuples::tie(m_Iter, m_End) = in_edges(vertex, *m_Graph->GetGraph());
 }
 /**
  * Get the current edge value.
@@ -109,7 +109,7 @@ void
 RCC8InEdgeIterator<TGraph>
 ::GoToBegin(void)
 {
-  tie(m_Iter, m_End) = in_edges(m_VertexIndex, *m_Graph->GetGraph());
+  boost::tuples::tie(m_Iter, m_End) = in_edges(m_VertexIndex, *m_Graph->GetGraph());
 }
 /**
  * Increment.