Geogram
Version 1.9.1
A programming library of geometric algorithms
|
Gathers some structures used by some algorithms, makes multithreading more efficient by avoiding dynamic reallocations. More...
#include <geogram/delaunay/periodic_delaunay_3d.h>
Public Member Functions | |
void | clear_incident_tets () |
Clears the set of incident tets. | |
void | add_incident_tet (index_t t) |
Inserts a tet into the set of incident tets. More... | |
bool | has_incident_tet (index_t t) const |
Tests whether a tet belongs to the set of incident tets. More... | |
vector< index_t >::const_iterator | begin () const |
vector< index_t >::const_iterator | end () const |
Public Attributes | |
std::stack< index_t > | S |
vector< index_t > | incident_tets_set |
Gathers some structures used by some algorithms, makes multithreading more efficient by avoiding dynamic reallocations.
It is used to compute the set of tetrahedra incident to a vertex. It gathers a stack and the vector of incident tets obtained so far.
Definition at line 77 of file periodic_delaunay_3d.h.
|
inline |
Inserts a tet into the set of incident tets.
[in] | t | the tet to be inserted. |
Definition at line 92 of file periodic_delaunay_3d.h.
|
inline |
Tests whether a tet belongs to the set of incident tets.
[in] | t | the tet to be tested |
true | if the tet belongs to the set of incident tets |
false | otherwise |
Definition at line 103 of file periodic_delaunay_3d.h.