#include <CGAL/point_generators_d.h>
template<typename Point_d>
class CGAL::Random_points_in_cube_d< Point_d >
The class Random_points_in_cube_d
is an input iterator creating points uniformly distributed in an half-open cube.
- Is Model Of:
InputIterator
PointGenerator
- See also
CGAL::Random_points_in_square_2<Point_2, Creator>
-
CGAL::Random_points_in_cube_3<Point_3, Creator>
-
CGAL::Random_points_in_ball_d<Point_d>
-
CGAL::Random_points_on_sphere_d<Point_d>
- Examples
- Generator/cube_d.cpp.
◆ difference_type
template<typename Point_d >
◆ iterator_category
template<typename Point_d >
◆ value_type
template<typename Point_d >
◆ Random_points_in_cube_d()
template<typename Point_d >
\( g\) is an input iterator creating points of type Point_d
uniformly distributed in the half-open cube of dimension \( dim\) with side length \( 2 a\), centered at the origin.
For every point \( p = *g\) and for all \( i<dim\) we have \( -a \le p[i] < a\). \( dim\) random numbers are needed from rnd
for each point.
◆ pointer
template<typename Point_d >
◆ reference
template<typename Point_d >