From 7845631fc2b4a32d4ca7c3e37bf49d40c22e226e Mon Sep 17 00:00:00 2001
From: Hind-M <hind.montassif@gmail.com>
Date: Tue, 12 Oct 2021 10:08:10 +0200
Subject: Remove old implementation of Minimal_enclosing_ball_radius operator
 ()

---
 .../include/gudhi/Cech_complex/Cech_kernel.h       | 42 ----------------------
 1 file changed, 42 deletions(-)

(limited to 'src/Cech_complex/include')

diff --git a/src/Cech_complex/include/gudhi/Cech_complex/Cech_kernel.h b/src/Cech_complex/include/gudhi/Cech_complex/Cech_kernel.h
index 93af90d2..348bb57d 100644
--- a/src/Cech_complex/include/gudhi/Cech_complex/Cech_kernel.h
+++ b/src/Cech_complex/include/gudhi/Cech_complex/Cech_kernel.h
@@ -38,21 +38,6 @@ class Minimal_enclosing_ball_radius {
     return std::sqrt(CGAL::to_double(kernel_.squared_distance_d_object()(point_1, point_2))) / 2.;
   }
 
-  /** \brief Minimal_enclosing_ball_radius from two points.
-   *
-   * @param[in] point_1 First point.
-   * @param[in] point_2 second point.
-   * @return The minimal enclosing ball radius for the two points (aka. Euclidean distance / 2.).
-   *
-   * \tparam Point must be a range of Cartesian coordinates.
-   *
-   */
-//   template< typename Point >
-//   typename std::iterator_traits<typename boost::range_iterator<Point>::type>::value_type
-//   operator()(const Point& point_1, const Point& point_2) const {
-//     std::clog << "#" << *point_1.begin() << "##" << *point_2.begin() << std::endl;
-//     return Euclidean_distance()(point_1, point_2) / 2.;
-//   }
 
   /** \brief Enclosing ball radius from a point cloud using CGAL.
    *
@@ -69,33 +54,6 @@ class Minimal_enclosing_ball_radius {
     return std::sqrt(CGAL::to_double(kernel_.compute_squared_radius_d_object()(point_cloud.begin(), point_cloud.end())));
   }
 
-  /** \brief Minimal_enclosing_ball_radius from a point cloud.
-   *
-   * @param[in] point_cloud The points.
-   * @return The minimal enclosing ball radius for the points.
-   *
-   * \tparam Point_cloud must be a range of points with Cartesian coordinates.
-   * Point_cloud is a range over a range of Coordinate.
-   *
-   */
-//   template< typename Point_cloud,
-//             typename Point_iterator = typename boost::range_const_iterator<Point_cloud>::type,
-//             typename Point = typename std::iterator_traits<Point_iterator>::value_type,
-//             typename Coordinate_iterator = typename boost::range_const_iterator<Point>::type,
-//             typename Coordinate = typename std::iterator_traits<Coordinate_iterator>::value_type>
-//   Coordinate
-//   operator()(const Point_cloud& point_cloud) const {
-//     using Min_sphere = Miniball::Miniball<Miniball::CoordAccessor<Point_iterator, Coordinate_iterator>>;
-// 
-//     Min_sphere ms(boost::size(*point_cloud.begin()), point_cloud.begin(), point_cloud.end());
-// #ifdef DEBUG_TRACES
-//     std::clog << "Minimal_enclosing_ball_radius = " << std::sqrt(ms.squared_radius()) << " | nb points = "
-//               << boost::size(point_cloud) << " | dimension = "
-//               << boost::size(*point_cloud.begin()) << std::endl;
-// #endif  // DEBUG_TRACES
-// 
-//     return std::sqrt(ms.squared_radius());
-//   }
 };
 
 /**
-- 
cgit v1.2.3