diff --git a/Partition_2/include/CGAL/Partition_2/partition_approx_convex_2.h b/Partition_2/include/CGAL/Partition_2/partition_approx_convex_2.h
index a81665d2a20..f25336d5cf2 100644
--- a/Partition_2/include/CGAL/Partition_2/partition_approx_convex_2.h
+++ b/Partition_2/include/CGAL/Partition_2/partition_approx_convex_2.h
@@ -163,8 +163,6 @@ OutputIterator partition_approx_convex_2(InputIterator first,
        triangles.insert(c, next);
    } while (++c != first_c);
 
-   Segment_2 edge;
-
 #ifdef CGAL_PARTITION_APPROX_CONVEX_DEBUG
    std::cout << "Inserting diagonals: " << std::endl;
 #endif
@@ -189,7 +187,7 @@ OutputIterator partition_approx_convex_2(InputIterator first,
        {
           if ((*e_circ).first->is_constrained((*e_circ).second))
           {
-             edge = triangles.segment((*e_circ).first, (*e_circ).second);
+             Segment_2 edge = triangles.segment((*e_circ).first, (*e_circ).second);
 #ifdef CGAL_PARTITION_APPROX_CONVEX_DEBUG
              std::cout << "edge " <<  *edge.source() << " " << *edge.target() 
                        << " is constrained " << std::endl;
@@ -199,7 +197,7 @@ OutputIterator partition_approx_convex_2(InputIterator first,
           {
              if (!triangles.is_infinite(*e_circ)) 
              {
-                edge = triangles.segment((*e_circ).first, (*e_circ).second);
+                Segment_2 edge = triangles.segment((*e_circ).first, (*e_circ).second);
                 Circulator source = edge.source();
                 Circulator target = edge.target();
                 Circulator before_s = source; before_s--;