diff --git a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Delaunay_triangulation_on_hyperbolic_surface_2.h b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Delaunay_triangulation_on_hyperbolic_surface_2.h
index 43c0238d14b..d9aafa13458 100644
--- a/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Delaunay_triangulation_on_hyperbolic_surface_2.h
+++ b/Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Delaunay_triangulation_on_hyperbolic_surface_2.h
@@ -198,9 +198,9 @@ public:
   /// \name Other functions
   /// @{
   /*!
-    \return a `double` approximation of the length of the shortest geodesic loop in the Delaunay triangulation. Returns 0 (NULL) if there is no loop.
+    \return a `double` approximation of the length of the shortest geodesic loop edge in the Delaunay triangulation. Returns 0 (NULL) if there is no loop edge.
   */
-  double shortest_loop() const;
+  double shortest_loop_edge() const;
   /*!
     \return a `double` approximation of the length of the shortest non-loop edge in the Delaunay triangulation. Returns 0 (NULL) if all edges are loops.
   */
diff --git a/Triangulation_on_hyperbolic_surface_2/include/CGAL/Delaunay_triangulation_on_hyperbolic_surface_2.h b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Delaunay_triangulation_on_hyperbolic_surface_2.h
index fd88a250337..2ad41f59151 100644
--- a/Triangulation_on_hyperbolic_surface_2/include/CGAL/Delaunay_triangulation_on_hyperbolic_surface_2.h
+++ b/Triangulation_on_hyperbolic_surface_2/include/CGAL/Delaunay_triangulation_on_hyperbolic_surface_2.h
@@ -101,7 +101,7 @@ public:
     bool is_epsilon_packing(const double epsilon) const;
     bool is_epsilon_net(const double epsilon) const;
 
-    double shortest_loop() const;
+    double shortest_loop_edge() const;
     double shortest_non_loop_edge() const;
 
 private:
@@ -1063,7 +1063,7 @@ is_epsilon_net(const double epsilon) const
 template<class Traits>
 double
 Delaunay_triangulation_on_hyperbolic_surface_2<Traits>::
-shortest_loop() const
+shortest_loop_edge() const
 {
     Number min_delta_length = 999;
     double res = NULL;
@@ -1122,4 +1122,4 @@ shortest_non_loop_edge() const
 
 }  // namespace CGAL
 
-#endif  //CGAL_DELAUNAY_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2
\ No newline at end of file
+#endif  //CGAL_DELAUNAY_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2
diff --git a/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_Delaunay_triangulation.cpp b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_Delaunay_triangulation.cpp
index e5cbef9f612..8efb74ccf1e 100644
--- a/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_Delaunay_triangulation.cpp
+++ b/Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_Delaunay_triangulation.cpp
@@ -79,7 +79,7 @@ int main()
 
     assert(same_vertices);
 
-    assert(dt.shortest_loop() != 0);
+    assert(dt.shortest_loop_edge() != 0);
     assert(dt.shortest_non_loop_edge() == 0);
 
     return 0;