CGAL 6.0 - Geometric Object Generators
Loading...
Searching...
No Matches
CGAL::Random_points_in_square_2< Point_2, Creator > Class Template Reference

#include <CGAL/point_generators_2.h>

Definition

template<typename Point_2, typename Creator>
class CGAL::Random_points_in_square_2< Point_2, Creator >

The class Random_points_in_square_2 is an input iterator creating points uniformly distributed in a half-open square.

The default Creator is Creator_uniform_2<Kernel_traits<Point_2>::Kernel::RT,Point_2>.

Is model of
InputIterator
PointGenerator
See also
CGAL::Points_on_segment_2<Point_2>
CGAL::Random_points_in_triangle_2<Point_2, Creator>
CGAL::Random_points_in_disc_2<Point_2, Creator>
CGAL::Random_points_on_segment_2<Point_2, Creator>
CGAL::Random_points_on_square_2<Point_2, Creator>
CGAL::Random_points_in_cube_3<Point_3, Creator>
Examples
Generator/random_convex_set.cpp, Generator/random_polygon.cpp, and Generator/random_polygon2.cpp.

Types

typedef std::input_iterator_tag iterator_category
 
typedef Point_2 value_type
 
typedef std::ptrdiff_t difference_type
 
typedef const Point_2pointer
 
typedef const 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\).
 

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.