diff --git a/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt b/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
index 8b1dd478d10..3bc71ce6793 100644
--- a/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
+++ b/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
@@ -524,7 +524,8 @@ The package provides iterators that can be used to traverse the triangulation al
 All cells (resp. simplices) visited by this traversal iterator are guaranteed to intersect the segment.
 \cgalModifEnd
 
-\cgalExample{Triangulation_3/segment_traverser_3.cpp}
+\cgalExample{Triangulation_3/segment_cell_traverser_3.cpp}
+\cgalExample{Triangulation_3/segment_simplex_traverser_3.cpp}
 
 \subsection Triangulation_3FindingtheCellsinConflict Finding the Cells in Conflict with a Point in a Delaunay Triangulation
 
diff --git a/Triangulation_3/doc/Triangulation_3/examples.txt b/Triangulation_3/doc/Triangulation_3/examples.txt
index e41b24348b3..4166c79a440 100644
--- a/Triangulation_3/doc/Triangulation_3/examples.txt
+++ b/Triangulation_3/doc/Triangulation_3/examples.txt
@@ -8,7 +8,8 @@
 \example Triangulation_3/info_insert_with_transform_iterator.cpp
 \example Triangulation_3/simplex.cpp
 \example Triangulation_3/fast_location_3.cpp
-\example Triangulation_3/segment_traverser_3.cpp
+\example Triangulation_3/segment_cell_traverser_3.cpp
+\example Triangulation_3/segment_simplex_traverser_3.cpp
 \example Triangulation_3/find_conflicts_3.cpp
 \example Triangulation_3/regular_3.cpp
 \example Triangulation_3/regular_with_info_3.cpp