songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

renamed shortest_loop_edge

This commit is contained in:
POUGET Marc 2025-12-01 15:23:40 +01:00
parent 4b626a3fe7
commit 21b63cf7a9
3 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Triangulation_on_hyperbolic_surface_2/doc/Triangulation_on_hyperbolic_surface_2/CGAL/Delaunay_triangulation_on_hyperbolic_surface_2.h
View File

@ -198,9 +198,9 @@ public:
/// \name Other functions /// \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. \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.
*/ */

6
Triangulation_on_hyperbolic_surface_2/include/CGAL/Delaunay_triangulation_on_hyperbolic_surface_2.h
View File

@ -101,7 +101,7 @@ public:
bool is_epsilon_packing(const double epsilon) const; bool is_epsilon_packing(const double epsilon) const;
bool is_epsilon_net(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; double shortest_non_loop_edge() const;
private: private:
@ -1063,7 +1063,7 @@ is_epsilon_net(const double epsilon) const
template<class Traits> template<class Traits>
double double
Delaunay_triangulation_on_hyperbolic_surface_2<Traits>:: Delaunay_triangulation_on_hyperbolic_surface_2<Traits>::
shortest_loop() const shortest_loop_edge() const
{ {
Number min_delta_length = 999; Number min_delta_length = 999;
double res = NULL; double res = NULL;
@ -1122,4 +1122,4 @@ shortest_non_loop_edge() const
} // namespace CGAL } // namespace CGAL
#endif //CGAL_DELAUNAY_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2 #endif //CGAL_DELAUNAY_TRIANGULATION_ON_HYPERBOLIC_SURFACE_2

2
Triangulation_on_hyperbolic_surface_2/test/Triangulation_on_hyperbolic_surface_2/hs_test_Delaunay_triangulation.cpp
View File

@ -79,7 +79,7 @@ int main()
assert(same_vertices); assert(same_vertices);
assert(dt.shortest_loop() != 0); assert(dt.shortest_loop_edge() != 0);
assert(dt.shortest_non_loop_edge() == 0); assert(dt.shortest_non_loop_edge() == 0);
return 0; return 0;