Processing math: 100%
CGAL 5.6.1 - Geometric Object Generators
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Modules Pages
CGAL::Random_points_on_sphere_d< Point_d > Class Template Reference

#include <CGAL/point_generators_d.h>

Definition

The class Random_points_on_sphere_d is an input iterator creating points uniformly distributed on a sphere.

The generated points are computed using floating point arithmetic, whatever the Kernel is, thus they are on the sphere only up to rounding errors.

Is Model Of:

InputIterator

PointGenerator

See also
CGAL::Random_points_on_circle_2<Point_2, Creator>
CGAL::Random_points_on_sphere_3<Point_3, Creator>
CGAL::Random_points_in_cube_d<Point_d>
CGAL::Random_points_in_ball_d<Point_d>
Examples:
Generator/sphere_d.cpp.

Types

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

Operations

 Random_points_on_sphere_d (int dim, double r, Random &rnd=get_default_random())
  g is an input iterator creating points of type Point_d uniformly distributed on a sphere in dimension dim with radius r, i.e. |*g| == r . More...
 

Constructor & Destructor Documentation

◆ Random_points_on_sphere_d()

template<typename Point_d>
CGAL::Random_points_on_sphere_d< Point_d >::Random_points_on_sphere_d ( int  dim,
double  r,
Random rnd = get_default_random() 
)

g is an input iterator creating points of type Point_d uniformly distributed on a sphere in dimension dim with radius r, i.e. |*g| == r .

2\cdot dim random numbers are needed from rnd for each point.