CGAL 6.2 - Geometric Object Generators

Loading...
Searching...
No Matches
List of all members
CGAL::Random_points_in_cube_d< Point_d > Class Template Reference

`#include <CGAL/point_generators_d.h>`

## Definition

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 a 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.

## Types
typedef std::input_iterator_tag | iterator_category
typedef Point_d | value_type
typedef std::ptrdiff_t | difference_type
typedef const Point_d * | pointer
typedef const Point_d & | reference

## Operations
| Random_points_in_cube_d (int dim, double a, Random &rnd=get_default_random())
| \( 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.

## Constructor & Destructor Documentation

## ◆ Random_points_in_cube_d()

template<typename Point_d >

CGAL::Random_points_in_cube_d< Point_d >::Random_points_in_cube_d | ( | int | dim,
|  | double | a,
|  | Random & | rnd = `get_default_random()`
| ) |  |

\( 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.