Processing math: 0%
\newcommand{\E}{\mathrm{E}} \newcommand{\A}{\mathrm{A}} \newcommand{\R}{\mathrm{R}} \newcommand{\N}{\mathrm{N}} \newcommand{\Q}{\mathrm{Q}} \newcommand{\Z}{\mathrm{Z}} \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }
CGAL 4.13 - Geometric Object Generators
All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends Modules Pages
CGAL::Random_points_in_cube_3< Point_3, Creator > Class Template Reference

#include <CGAL/point_generators_3.h>

Definition

Types

typedef std::input_iterator_tag iterator_category
 
typedef Point_3 value_type
 
typedef std::ptrdiff_t difference_type
 
typedef const Point_3pointer
 
typedef const Point_3reference
 
 Random_points_in_cube_3 (double a, Random &rnd=get_default_random())
 Creates an input iterator g generating points of type Point_3 uniformly distributed in the half-open cube with side length 2 a, centered at the origin, i.e. \forall p = *g: -a \le p.x(),p.y(),p.z() < a . More...
 

Constructor & Destructor Documentation

◆ Random_points_in_cube_3()

template<typename Point_3 , typename Creator >
CGAL::Random_points_in_cube_3< Point_3, Creator >::Random_points_in_cube_3 ( double  a,
Random rnd = get_default_random() 
)

Creates an input iterator g generating points of type Point_3 uniformly distributed in the half-open cube with side length 2 a, centered at the origin, i.e. \forall p = *g: -a \le p.x(),p.y(),p.z() < a .

Three random numbers are needed from rnd for each point.