CDT++ 1.0.0
Causal Dynamical Triangulations in C++
Loading...
Searching...
No Matches
cdt::utilities::Generated_population_bounds Struct Reference

Validated simplex-population bounds for generated triangulations. More...

#include <Utilities.hpp>

Collaboration diagram for cdt::utilities::Generated_population_bounds:

Public Attributes

std::uint64_t input_vertices
 Exact total number of vertices supplied to CGAL.
long double last_layer_points
 Untruncated point-count expression for the final spherical layer.
Int_precision points_per_timeslice
 Base population used to construct the spherical layers.
std::optional< std::uint64_t > tetrahedra_upper_bound
 Rigorous finite 3D Delaunay bound, if representable by uint64_t.

Detailed Description

Validated simplex-population bounds for generated triangulations.

Definition at line 2789 of file Utilities.hpp.

Member Data Documentation

◆ input_vertices

std::uint64_t cdt::utilities::Generated_population_bounds::input_vertices

Exact total number of vertices supplied to CGAL.

Definition at line 2796 of file Utilities.hpp.

◆ last_layer_points

long double cdt::utilities::Generated_population_bounds::last_layer_points

Untruncated point-count expression for the final spherical layer.

Definition at line 2794 of file Utilities.hpp.

◆ points_per_timeslice

Int_precision cdt::utilities::Generated_population_bounds::points_per_timeslice

Base population used to construct the spherical layers.

Definition at line 2792 of file Utilities.hpp.

◆ tetrahedra_upper_bound

std::optional<std::uint64_t> cdt::utilities::Generated_population_bounds::tetrahedra_upper_bound

Rigorous finite 3D Delaunay bound, if representable by uint64_t.

Definition at line 2798 of file Utilities.hpp.


The documentation for this struct was generated from the following file: