diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h
index 02d7f56902f..8983e01fde2 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h
@@ -17,18 +17,16 @@ reverses the action of the other.
 
 \anchor figsdgdssplitjoin 
 
-\image html sdg-join_split.png
-\image latex sdg-join_split.png
-<center><b>
+\cgalFigureBegin{figsdgdssplitjoin,sdg-join_split.png}
 The join and split operations. Left to right: The vertex `v` is split
 into \f$ v_1\f$ and \f$ v_2\f$. The faces \f$ f\f$ and \f$ g\f$ are
 inserted after \f$ f_1\f$ and \f$ f_2\f$, respectively, in the
 counter-clockwise sense. The vertices \f$ v_1\f$, \f$ v_2\f$ and the
-faces \f$ f\f$ and \f$ g\f$ are returned as a `boost` `tuple` in that
+faces \f$ f\f$ and \f$ g\f$ are returned as a `boost::tuple` in that
 order. Right to left: The edge `(f,i)` is collapsed, and thus the
 vertices \f$ v_1\f$ and \f$ v_2\f$ are joined. The vertex `v` is
 returned.
-</b></center>
+\cgalFigureEnd
 
 We only describe the additional requirements with respect to the 
 `ApolloniusGraphDataStructure_2` concept. 
@@ -62,7 +60,7 @@ Splits the vertex `v` into two vertices `v1` and
 `v2`. The common faces `f` and `g` of `v1` and 
 `v2` are created after (in the counter-clockwise sense) the 
 faces `f1` and `f2`. The 4-tuple `(v1,v2,f,g)` is 
-returned (see Fig. \ref figsdgdssplitjoin). 
+returned (see \cgalFigureRef{figsdgdssplitjoin}). 
 */ 
 boost::tuples::tuple<Vertex_handle, Vertex_handle, Face_handle, 
 Face_handle>