random forest

afabri · May 21, 2024 · 8a71edb · 8a71edb
1 parent d6424d2
commit 8a71edb
Show file tree

Hide file tree

Showing 2 changed files with 5 additions and 5 deletions.
diff --git a/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp b/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp
@@ -61,8 +61,8 @@ inline void init_feature_class_data(FeatureClassDataFloat& /*data*/, int /*n_cla
 typedef std::unordered_set<int> FeatureSet;
 
 typedef boost::random::uniform_int_distribution<> UniformIntDist;
-typedef boost::random::normal_distribution<> NormalDist;
-typedef boost::random::mt19937 RandomGen;
+typedef std::normal_distribution<> NormalDist;
+typedef std::mt19937 RandomGen;
 typedef boost::random::uniform_01<> UnitDist;
 
 struct ForestParams {

diff --git a/Generator/doc/Generator/CGAL/random_convex_hull_in_disc_2.h b/Generator/doc/Generator/CGAL/random_convex_hull_in_disc_2.h
@@ -13,9 +13,9 @@ The generated polygon will have an average number of vertices \f$ n^\frac{1}{3}(
 
 \cgalHeading{Requirements}
 
-- `Generator` has to be a Boost random generator, such as `boost::random::mt19937`.
+- `Generator` has to be a random generator, such as `std::mt19937`.
 
-- `fast` is a Boolean , set to `true` for time efficiency and to `false` for memory efficiency.
+- `fast` is a Boolean, set to `true` for time efficiency and to `false` for memory efficiency.
 
 - `Traits` is a model of the concept `RandomConvexHullTraits_2`.
 
@@ -28,7 +28,7 @@ The generated polygon will have an average number of vertices \f$ n^\frac{1}{3}(
 
 The implementation is based on an incremental construction of a convex hull. At each step, we choose a number of points to pick uniformly at random in the disc. Then, a subset of these points, that won't change the convex hull, is evaluated using a Binomial law.
 As these points won't be generated, the time and size complexities are reduced \cgalCite{Devillers2014Generator}.
-A tradeoff between time and memory is provided with the option `fast`, true by default. Using the `fast` option, both time and size expected complexities are \cgalBigOLarge{n^\frac{1}{3}\log^\frac{2}{3}n}.
+A tradeoff between time and memory is provided with the option `fast`, `true` by default. Using the `fast` option, both time and size expected complexities are \cgalBigOLarge{n^\frac{1}{3}\log^\frac{2}{3}n}.
  If this option is disabled, the expected size complexity becomes \cgalBigOLarge{n^\frac{1}{3}} but the expected time complexity becomes \cgalBigOLarge{n^\frac{1}{3}\log^2 n}.
 
 \cgalHeading{Example}