Torus_d.hpp

Go to the documentation of this file.

/*******************************************************************************
 Causal Dynamical Triangulations in C++ using CGAL
 
 Copyright © 2017 Adam Getchell
 ******************************************************************************/

 
#ifndef INCLUDE_TORUS_D_HPP_
#define INCLUDE_TORUS_D_HPP_
 
#include <CGAL/Cartesian_d.h>
#include <CGAL/constructions_d.h>
#include <CGAL/point_generators_d.h>
#include <fmt/format.h>
 
#include <vector>
 
namespace cdt::experimental::torus
{
  using Kd    = CGAL::Cartesian_d<double>;
  using Point = Kd::Point_d;
  using Creator_d =
      CGAL::Creator_uniform_d<std::vector<double>::iterator, Point>;

  inline void make_d_cube(std::vector<Point>& t_points,
                          std::size_t t_number_of_points, int t_dimension)
  {
    constexpr double size = 1.0;
 
    fmt::print("Generating {} grid points in {}D\n", t_number_of_points,
               t_dimension);
 
    t_points.reserve(t_number_of_points);
    points_on_cube_grid_d(t_dimension, size, t_number_of_points,
                          std::back_inserter(t_points), Creator_d(t_dimension));
  }
}  // namespace cdt::experimental::torus
 
#endif  // INCLUDE_TORUS_D_HPP_