Functions on d-dimensional torus. More...

#include <CGAL/Cartesian_d.h>
#include <CGAL/constructions_d.h>
#include <CGAL/point_generators_d.h>
#include <fmt/format.h>
#include <vector>

Include dependency graph for Torus_d.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Typedefs
using	Creator_d = CGAL::Creator_uniform_d< std::vector< double >::iterator, Point >

using	Kd = CGAL::Cartesian_d< double >

using	Point = Kd::Point_d

Functions
auto	make_d_cube (std::vector< Point > t_points, std::size_t t_number_of_points, int t_dimension)
	Make a d-dimensional torus.

Detailed Description

Functions on d-dimensional torus.

Author: Adam Getchell

Inserts a given number of points into a d-dimensional grid (cube)

Todo:: Make the vector compatible with the triangulation data structure

Definition in file Torus_d.hpp.

Typedef Documentation

◆ Creator_d

using Creator_d = CGAL::Creator_uniform_d<std::vector<double>::iterator, Point>

Definition at line 25 of file Torus_d.hpp.

◆ Kd

using Kd = CGAL::Cartesian_d<double>

Definition at line 23 of file Torus_d.hpp.

◆ Point

using Point = Kd::Point_d

Definition at line 24 of file Torus_d.hpp.

Function Documentation

◆ make_d_cube()

auto make_d_cube	(	std::vector< Point >	t_points,
		std::size_t	t_number_of_points,
		int	t_dimension
	)

inline

Make a d-dimensional torus.

Parameters

t_points	The container of points
t_number_of_points	The number of points to insert
t_dimension	The dimensionality of the torus

Returns: A d-dimensional torus

Definition at line 34 of file Torus_d.hpp.

Typedefs