points_on_cube_grid

Navigation: Up Table of Contents Package Overview Bibliography Index Title Acknowledging CGAL

CGAL::points_on_cube_grid_3

Definition

The function points_on_cube_grid_3 generates a given number of points on a cubic grid whose size is determined by the number of points to be generated.

#include <CGAL/point_generators_3.h>

template <class OutputIterator, Creator creator>

OutputIterator

points_on_cube_grid_3 (
double a,
std::size_t n,
OutputIterator o,
Creator creator = Creator_uniform_3<Kernel_traits<P>::Kernel::RT,P>)

creates the first n points on the regular ⌈n^1/3 ⌉ × ⌈n^1/3 ⌉ × ⌈n^1/3 ⌉ grid within the cube [-a,a] × [-a,a] × [-a, a]. Returns the value of o after inserting the n points.

Requirements

Creator must be a function object accepting three double values x, y, and z and returning an initialized point (x,y,z) of type P. Predefined implementations for these creators like the default can be found in Section 71.9.
The OutputIterator must accept values of type P. If the OutputIterator has a value_type the default initializer of the creator can be used. P is set to the value_type in this case.

CGAL::points_on_square_grid_2
CGAL::random_selection

Next: PointGenerator

Navigation: Up Table of Contents Package Overview Bibliography Index Title Acknowledging CGAL

CGAL Open Source Project. Release 3.7. 14 October 2010.