summaryrefslogtreecommitdiff
path: root/src/Cech_complex
diff options
context:
space:
mode:
authorHind-M <hind.montassif@gmail.com>2021-10-12 10:08:10 +0200
committerHind-M <hind.montassif@gmail.com>2021-10-12 10:08:10 +0200
commit7845631fc2b4a32d4ca7c3e37bf49d40c22e226e (patch)
tree0fe4833e83fd345981c538cc5384031d55f7d4fe /src/Cech_complex
parent1db88dcd1f5f94d4ab9b560fd0f4399cf00fb304 (diff)
Remove old implementation of Minimal_enclosing_ball_radius operator ()
Diffstat (limited to 'src/Cech_complex')
-rw-r--r--src/Cech_complex/include/gudhi/Cech_complex/Cech_kernel.h42
1 files changed, 0 insertions, 42 deletions
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());
-// }
};
/**