\( \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 5.0.4 - Geometric Object Generators
CGAL::Random_points_in_square_2< Point_2, Creator > Class Template Reference

#include <CGAL/point_generators_2.h>

Definition

Types

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

Constructor & Destructor Documentation

◆ Random_points_in_square_2()

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

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

Two random numbers are needed from rnd for each point.