CGAL 5.1.1 - Geometric Object Generators
|
#include <CGAL/point_generators_2.h>
The class Random_points_on_square_2
is an input iterator creating points uniformly distributed on the boundary of a square.
The default Creator
is Creator_uniform_2<Kernel_traits<Point_2>Kernel::RT,Point_2>
.
CGAL::Points_on_segment_2<Point_2>
CGAL::Random_points_in_disc_2<Point_2, Creator>
CGAL::Random_points_in_square_2<Point_2, Creator>
CGAL::Random_points_in_triangle_2<Point_2, Creator>
CGAL::Random_points_on_circle_2<Point_2, Creator>
CGAL::Random_points_on_segment_2<Point_2, Creator>
Types | |
typedef std::input_iterator_tag | iterator_category |
typedef Point_2 | value_type |
typedef std::ptrdiff_t | difference_type |
const typedef Point_2 * | pointer |
const typedef Point_2 & | reference |
Random_points_on_square_2 (double a, Random &rnd=get_default_random()) | |
creates an input iterator g generating points of type Point_2 uniformly distributed on the boundary of the square with side length 2 a, centered at the origin, i.e. \forall p = *g: one coordinate is either a or -a and for the other coordinate c holds -a \le c < a. More... | |
CGAL::Random_points_on_square_2< Point_2, Creator >::Random_points_on_square_2 | ( | double | a, |
Random & | rnd = get_default_random() |
||
) |
creates an input iterator g
generating points of type Point_2
uniformly distributed on the boundary of the square with side length 2 a, centered at the origin, i.e. \forall p = *g: one coordinate is either a or -a and for the other coordinate c holds -a \le c < a.
A single random number is needed from rnd
for each point.