mirror of https://github.com/CGAL/cgal
26 lines
822 B
C++
26 lines
822 B
C++
#include <iostream>
|
|
#include <vector>
|
|
#include <CGAL/Cartesian_d.h>
|
|
#include <CGAL/point_generators_d.h>
|
|
#include <CGAL/constructions_d.h>
|
|
|
|
typedef CGAL::Cartesian_d<double> Kd;
|
|
typedef Kd::Point_d Point;
|
|
typedef CGAL::Creator_uniform_d
|
|
<std::vector<double>::iterator, Point> Creator_d;
|
|
|
|
int main ()
|
|
{
|
|
int nb_points = 20;
|
|
int dim = 4;
|
|
double size = 5.0;
|
|
std::cout << "Generating "<<nb_points<<" grid points in "
|
|
<<dim<<"D" << std::endl;
|
|
std::vector<Point> v;
|
|
v.reserve(nb_points);
|
|
CGAL::points_on_cube_grid_d (dim, size, static_cast<std::size_t>(nb_points),
|
|
std::back_inserter(v), Creator_d(dim) );
|
|
for (int i = 0; i < nb_points; ++i) std::cout<<" "<<v[i]<<std::endl;
|
|
return 0;
|
|
}
|