TTK
|
AbstractTriangulation is an interface class that defines an interface for efficient traversal methods on triangulations of piecewise linear manifolds. More...
#include <AbstractTriangulation.h>
Public Member Functions | |
AbstractTriangulation () | |
~AbstractTriangulation () override | |
AbstractTriangulation (const AbstractTriangulation &)=default | |
AbstractTriangulation (AbstractTriangulation &&)=default | |
AbstractTriangulation & | operator= (const AbstractTriangulation &)=default |
AbstractTriangulation & | operator= (AbstractTriangulation &&)=default |
int | clear () |
size_t | footprint (size_t size=0) const |
virtual int | getCellEdge (const SimplexId &cellId, const int &localEdgeId, SimplexId &edgeId) const |
virtual SimplexId | getCellEdgeNumber (const SimplexId &cellId) const |
virtual const std::vector< std::vector< SimplexId > > * | getCellEdges () |
virtual int | getCellNeighbor (const SimplexId &cellId, const int &localNeighborId, SimplexId &neighborId) const |
virtual SimplexId | getCellNeighborNumber (const SimplexId &cellId) const |
virtual const std::vector< std::vector< SimplexId > > * | getCellNeighbors () |
virtual int | getCellTriangle (const SimplexId &cellId, const int &localTriangleId, SimplexId &triangleId) const |
virtual SimplexId | getCellTriangleNumber (const SimplexId &cellId) const |
virtual const std::vector< std::vector< SimplexId > > * | getCellTriangles () |
virtual int | getCellVertex (const SimplexId &cellId, const int &localVertexId, SimplexId &vertexId) const |
virtual SimplexId | getCellVertexNumber (const SimplexId &cellId) const |
virtual int | getDimensionality () const |
virtual const std::vector< std::array< SimplexId, 2 > > * | getEdges () |
virtual int | getEdgeLink (const SimplexId &edgeId, const int &localLinkId, SimplexId &linkId) const |
virtual SimplexId | getEdgeLinkNumber (const SimplexId &edgeId) const |
virtual const std::vector< std::vector< SimplexId > > * | getEdgeLinks () |
virtual int | getEdgeStar (const SimplexId &edgeId, const int &localStarId, SimplexId &starId) const |
virtual SimplexId | getEdgeStarNumber (const SimplexId &edgeId) const |
virtual const std::vector< std::vector< SimplexId > > * | getEdgeStars () |
virtual int | getEdgeTriangle (const SimplexId &edgeId, const int &localTriangleId, SimplexId &triangleId) const |
virtual SimplexId | getEdgeTriangleNumber (const SimplexId &edgeId) const |
virtual const std::vector< std::vector< SimplexId > > * | getEdgeTriangles () |
virtual int | getEdgeVertex (const SimplexId &edgeId, const int &localVertexId, SimplexId &vertexId) const |
int | getEdgeVertexNumber (const SimplexId ttkNotUsed(edgeId)) const |
virtual const std::array< SimplexId, 3 > & | getGridDimensions () const |
virtual SimplexId | getNumberOfCells () const |
virtual SimplexId | getNumberOfEdges () const |
virtual SimplexId | getNumberOfTriangles () const |
virtual SimplexId | getNumberOfVertices () const |
virtual const std::vector< std::array< SimplexId, 3 > > * | getTriangles () |
virtual int | getTriangleEdge (const SimplexId &triangleId, const int &localEdgeId, SimplexId &edgeId) const |
virtual SimplexId | getTriangleEdgeNumber (const SimplexId &triangleId) const |
virtual const std::vector< std::vector< SimplexId > > * | getTriangleEdges () |
virtual int | getTriangleLink (const SimplexId &triangleId, const int &localLinkId, SimplexId &linkId) const |
virtual SimplexId | getTriangleLinkNumber (const SimplexId &triangleId) const |
virtual const std::vector< std::vector< SimplexId > > * | getTriangleLinks () |
virtual int | getTriangleStar (const SimplexId &triangleId, const int &localStarId, SimplexId &starId) const |
virtual SimplexId | getTriangleStarNumber (const SimplexId &triangleId) const |
virtual const std::vector< std::vector< SimplexId > > * | getTriangleStars () |
virtual int | getTriangleVertex (const SimplexId &triangleId, const int &localVertexId, SimplexId &vertexId) const |
int | getTriangleVertexNumber (const SimplexId ttkNotUsed(triangleId)) const |
virtual int | getVertexEdge (const SimplexId &vertexId, const int &localEdgeId, SimplexId &edgeId) const |
virtual SimplexId | getVertexEdgeNumber (const SimplexId &vertexId) const |
virtual const std::vector< std::vector< SimplexId > > * | getVertexEdges () |
virtual int | getVertexLink (const SimplexId &vertexId, const int &localLinkId, SimplexId &linkId) const |
virtual SimplexId | getVertexLinkNumber (const SimplexId &vertexId) const |
virtual const std::vector< std::vector< SimplexId > > * | getVertexLinks () |
virtual int | getVertexNeighbor (const SimplexId &vertexId, const int &localNeighborId, SimplexId &neighborId) const |
virtual SimplexId | getVertexNeighborNumber (const SimplexId &vertexId) const |
virtual const std::vector< std::vector< SimplexId > > * | getVertexNeighbors () |
virtual int | getVertexPoint (const SimplexId &vertexId, float &x, float &y, float &z) const |
virtual int | getVertexStar (const SimplexId &vertexId, const int &localStarId, SimplexId &starId) const |
virtual SimplexId | getVertexStarNumber (const SimplexId &vertexId) const |
virtual const std::vector< std::vector< SimplexId > > * | getVertexStars () |
virtual int | getVertexTriangle (const SimplexId &vertexId, const int &localTriangleId, SimplexId &triangleId) const |
virtual SimplexId | getVertexTriangleNumber (const SimplexId &vertexId) const |
virtual const std::vector< std::vector< SimplexId > > * | getVertexTriangles () |
bool | hasPeriodicBoundaries () const |
Returns true if the grid uses period boundary conditions. | |
virtual bool | isEdgeOnBoundary (const SimplexId &edgeId) const |
virtual bool | isEmpty () const |
virtual bool | isManifold () const |
virtual int | preconditionManifold () |
virtual bool | isTriangleOnBoundary (const SimplexId &triangleId) const |
virtual bool | isVertexOnBoundary (const SimplexId &vertexId) const |
virtual int | preconditionBoundaryEdges () |
virtual int | preconditionBoundaryTriangles () |
virtual int | preconditionBoundaryVertices () |
virtual int | preconditionCellEdges () |
virtual int | preconditionCellNeighbors () |
virtual int | preconditionCellTriangles () |
virtual int | preconditionEdges () |
virtual int | preconditionEdgeLinks () |
virtual int | preconditionEdgeStars () |
virtual int | preconditionEdgeTriangles () |
virtual int | preconditionTriangles () |
virtual int | preconditionTriangleEdges () |
virtual int | preconditionTriangleLinks () |
virtual int | preconditionTriangleStars () |
virtual int | preconditionVertexEdges () |
virtual int | preconditionVertexLinks () |
virtual int | preconditionVertexNeighbors () |
virtual int | preconditionVertexStars () |
virtual int | preconditionVertexTriangles () |
int | getEdgeIncenter (const SimplexId edgeId, float incenter[3]) const |
int | getTriangleIncenter (const SimplexId triangleId, float incenter[3]) const |
int | getTetraIncenter (const SimplexId tetraId, float incenter[3]) const |
int | getCellIncenter (const SimplexId cellid, const int dim, float incenter[3]) const |
virtual int | getCellVTKID (const int &ttkId, int &vtkId) const |
template<class itemType > | |
size_t | tableTableFootprint (const vector< vector< itemType > > &table, const string &tableName, ostream &stream) const |
![]() | |
Wrapper () | |
~Wrapper () override=default | |
virtual int | updateProgress (const float &progress)=0 |
![]() | |
Debug () | |
~Debug () override | |
virtual int | setDebugLevel (const int &debugLevel) |
int | setWrapper (const Wrapper *wrapper) override |
int | printMsg (const std::string &msg, const debug::Priority &priority=debug::Priority::INFO, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) const |
int | printMsg (const std::vector< std::string > &msgs, const debug::Priority &priority=debug::Priority::INFO, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) const |
int | printErr (const std::string &msg, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cerr) const |
int | printWrn (const std::string &msg, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cerr) const |
int | printMsg (const std::string &msg, const double &progress, const double &time, const int &threads, const double &memory, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::PERFORMANCE, std::ostream &stream=std::cout) const |
int | printMsg (const std::string &msg, const double &progress, const double &time, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::PERFORMANCE, std::ostream &stream=std::cout) const |
int | printMsg (const std::string &msg, const double &progress, const double &time, const int &threads, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::PERFORMANCE, std::ostream &stream=std::cout) const |
int | printMsg (const std::string &msg, const double &progress, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::PERFORMANCE, std::ostream &stream=std::cout) const |
int | printMsg (const std::string &msg, const double &progress, const debug::Priority &priority, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) const |
int | printMsg (const std::vector< std::vector< std::string > > &rows, const debug::Priority &priority=debug::Priority::INFO, const bool hasHeader=true, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) const |
int | printMsg (const debug::Separator &separator, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::INFO, std::ostream &stream=std::cout) const |
int | printMsg (const debug::Separator &separator, const debug::Priority &priority, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) const |
int | printMsg (const std::string &msg, const debug::Separator &separator, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::INFO, std::ostream &stream=std::cout) const |
void | setDebugMsgPrefix (const std::string &prefix) |
![]() | |
BaseClass () | |
virtual | ~BaseClass ()=default |
int | getThreadNumber () const |
virtual int | setThreadNumber (const int threadNumber) |
Protected Types | |
using | gradIdType = SimplexId |
using | gradientType = std::array< std::vector< gradIdType >, 6 > |
Discrete gradient internal struct. | |
using | gradientKeyType = std::pair< const void *, size_t > |
Key type for gradientCacheType. | |
using | gradientCacheType = LRUCache< gradientKeyType, gradientType > |
Protected Member Functions | |
virtual int | getCellEdgeInternal (const SimplexId &ttkNotUsed(cellId), const int &ttkNotUsed(localEdgeId), SimplexId &ttkNotUsed(edgeId)) const |
virtual SimplexId | getCellEdgeNumberInternal (const SimplexId &ttkNotUsed(cellId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getCellEdgesInternal () |
virtual int | getCellNeighborInternal (const SimplexId &ttkNotUsed(cellId), const int &ttkNotUsed(localNeighborId), SimplexId &ttkNotUsed(neighborId)) const |
virtual SimplexId | getCellNeighborNumberInternal (const SimplexId &ttkNotUsed(cellId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getCellNeighborsInternal () |
virtual int | getCellTriangleInternal (const SimplexId &ttkNotUsed(cellId), const int &ttkNotUsed(localTriangleId), SimplexId &ttkNotUsed(triangleId)) const |
virtual SimplexId | getCellTriangleNumberInternal (const SimplexId &ttkNotUsed(cellId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getCellTrianglesInternal () |
virtual int | getCellVertexInternal (const SimplexId &ttkNotUsed(cellId), const int &ttkNotUsed(localVertexId), SimplexId &ttkNotUsed(vertexId)) const |
virtual SimplexId | getCellVertexNumberInternal (const SimplexId &ttkNotUsed(cellId)) const |
virtual int | getDimensionalityInternal () const |
virtual const std::vector< std::array< SimplexId, 2 > > * | getEdgesInternal () |
virtual int | getEdgeLinkInternal (const SimplexId &ttkNotUsed(edgeId), const int &ttkNotUsed(localLinkId), SimplexId &ttkNotUsed(linkId)) const |
virtual SimplexId | getEdgeLinkNumberInternal (const SimplexId &ttkNotUsed(edgeId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getEdgeLinksInternal () |
virtual int | getEdgeStarInternal (const SimplexId &ttkNotUsed(edgeId), const int &ttkNotUsed(localStarId), SimplexId &ttkNotUsed(starId)) const |
virtual SimplexId | getEdgeStarNumberInternal (const SimplexId &ttkNotUsed(edgeId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getEdgeStarsInternal () |
virtual int | getEdgeTriangleInternal (const SimplexId &ttkNotUsed(edgeId), const int &ttkNotUsed(localTriangleId), SimplexId &ttkNotUsed(triangleId)) const |
virtual SimplexId | getEdgeTriangleNumberInternal (const SimplexId &ttkNotUsed(edgeId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getEdgeTrianglesInternal () |
virtual int | getEdgeVertexInternal (const SimplexId &ttkNotUsed(edgeId), const int &ttkNotUsed(localVertexId), SimplexId &ttkNotUsed(vertexId)) const |
virtual SimplexId | getNumberOfCellsInternal () const |
virtual SimplexId | getNumberOfEdgesInternal () const |
virtual SimplexId | getNumberOfTrianglesInternal () const |
virtual SimplexId | getNumberOfVerticesInternal () const |
virtual const std::vector< std::array< SimplexId, 3 > > * | getTrianglesInternal () |
virtual int | getTriangleEdgeInternal (const SimplexId &ttkNotUsed(triangleId), const int &ttkNotUsed(localEdgeId), SimplexId &ttkNotUsed(edgeId)) const |
virtual SimplexId | getTriangleEdgeNumberInternal (const SimplexId &ttkNotUsed(triangleId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getTriangleEdgesInternal () |
virtual int | getTriangleLinkInternal (const SimplexId &ttkNotUsed(triangleId), const int &ttkNotUsed(localLinkId), SimplexId &ttkNotUsed(linkId)) const |
virtual SimplexId | getTriangleLinkNumberInternal (const SimplexId &ttkNotUsed(triangleId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getTriangleLinksInternal () |
virtual int | getTriangleStarInternal (const SimplexId &ttkNotUsed(triangleId), const int &ttkNotUsed(localStarId), SimplexId &ttkNotUsed(starId)) const |
virtual SimplexId | getTriangleStarNumberInternal (const SimplexId &ttkNotUsed(triangleId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getTriangleStarsInternal () |
virtual int | getTriangleVertexInternal (const SimplexId &ttkNotUsed(triangleId), const int &ttkNotUsed(localVertexId), SimplexId &ttkNotUsed(vertexId)) const |
virtual int | getVertexEdgeInternal (const SimplexId &ttkNotUsed(vertexId), const int &ttkNotUsed(localEdgeId), SimplexId &ttkNotUsed(edgeId)) const |
virtual SimplexId | getVertexEdgeNumberInternal (const SimplexId &ttkNotUsed(vertexId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getVertexEdgesInternal () |
virtual int | getVertexLinkInternal (const SimplexId &ttkNotUsed(vertexId), const int &ttkNotUsed(localLinkId), SimplexId &ttkNotUsed(linkId)) const |
virtual SimplexId | getVertexLinkNumberInternal (const SimplexId &ttkNotUsed(vertexId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getVertexLinksInternal () |
virtual int | getVertexNeighborInternal (const SimplexId &ttkNotUsed(vertexId), const int &ttkNotUsed(localNeighborId), SimplexId &ttkNotUsed(neighborId)) const |
virtual SimplexId | getVertexNeighborNumberInternal (const SimplexId &ttkNotUsed(vertexId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getVertexNeighborsInternal () |
virtual int | getVertexPointInternal (const SimplexId &ttkNotUsed(vertexId), float &ttkNotUsed(x), float &ttkNotUsed(y), float &ttkNotUsed(z)) const |
virtual int | getVertexStarInternal (const SimplexId &ttkNotUsed(vertexId), const int &ttkNotUsed(localStarId), SimplexId &ttkNotUsed(starId)) const |
virtual SimplexId | getVertexStarNumberInternal (const SimplexId &ttkNotUsed(vertexId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getVertexStarsInternal () |
virtual int | getVertexTriangleInternal (const SimplexId &ttkNotUsed(vertexId), const int &ttkNotUsed(localTriangleId), SimplexId &ttkNotUsed(triangleId)) const |
virtual SimplexId | getVertexTriangleNumberInternal (const SimplexId &ttkNotUsed(vertexId)) const |
virtual const std::vector< std::vector< SimplexId > > * | getVertexTrianglesInternal () |
virtual bool | isEdgeOnBoundaryInternal (const SimplexId &ttkNotUsed(edgeId)) const |
virtual bool | isTriangleOnBoundaryInternal (const SimplexId &ttkNotUsed(triangleId)) const |
virtual bool | isVertexOnBoundaryInternal (const SimplexId &ttkNotUsed(vertexId)) const |
bool | hasPreconditionedBoundaryEdges () const |
bool | hasPreconditionedBoundaryTriangles () const |
bool | hasPreconditionedBoundaryVertices () const |
bool | hasPreconditionedCellEdges () const |
bool | hasPreconditionedCellNeighbors () const |
bool | hasPreconditionedCellTriangles () const |
bool | hasPreconditionedEdgeLinks () const |
bool | hasPreconditionedEdgeStars () const |
bool | hasPreconditionedEdgeTriangles () const |
bool | hasPreconditionedEdges () const |
bool | hasPreconditionedTriangles () const |
bool | hasPreconditionedTriangleEdges () const |
bool | hasPreconditionedTriangleLinks () const |
bool | hasPreconditionedTriangleStars () const |
bool | hasPreconditionedVertexEdges () const |
bool | hasPreconditionedVertexLinks () const |
bool | hasPreconditionedVertexNeighbors () const |
bool | hasPreconditionedVertexStars () const |
bool | hasPreconditionedVertexTriangles () const |
bool | hasPreconditionedManifold () const |
bool | needsToAbort () override |
virtual int | preconditionBoundaryEdgesInternal () |
virtual int | preconditionBoundaryTrianglesInternal () |
virtual int | preconditionBoundaryVerticesInternal () |
virtual int | preconditionCellEdgesInternal () |
virtual int | preconditionCellNeighborsInternal () |
virtual int | preconditionCellTrianglesInternal () |
virtual int | preconditionEdgesInternal () |
virtual int | preconditionEdgeLinksInternal () |
virtual int | preconditionEdgeStarsInternal () |
virtual int | preconditionEdgeTrianglesInternal () |
virtual int | preconditionTrianglesInternal () |
virtual int | preconditionTriangleEdgesInternal () |
virtual int | preconditionTriangleLinksInternal () |
virtual int | preconditionTriangleStarsInternal () |
virtual int | preconditionVertexEdgesInternal () |
virtual int | preconditionVertexLinksInternal () |
virtual int | preconditionVertexNeighborsInternal () |
virtual int | preconditionVertexStarsInternal () |
virtual int | preconditionVertexTrianglesInternal () |
virtual int | preconditionManifoldInternal () |
virtual int | getCellVTKIDInternal (const int &ttkId, int &vtkId) const |
template<class itemType > | |
size_t | tableFootprint (const std::vector< itemType > &table, const std::string &tableName="", std::ostream &stream=std::cout) const |
template<class itemType > | |
size_t | tableTableFootprint (const std::vector< std::vector< itemType > > &table, const std::string &tableName="", std::ostream &stream=std::cout) const |
int | updateProgress (const float &ttkNotUsed(progress)) override |
gradientCacheType * | getGradientCacheHandler () const |
![]() | |
int | printMsgInternal (const std::string &msg, const std::string &right, const std::string &filler, const debug::Priority &priority=debug::Priority::INFO, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) const |
int | printMsgInternal (const std::string &msg, const debug::Priority &priority, const debug::LineMode &lineMode, std::ostream &stream=std::cout) const |
int | welcomeMsg (std::ostream &stream) |
Friends | |
class | ttk::dcg::DiscreteGradient |
Additional Inherited Members | |
![]() | |
static COMMON_EXPORTS debug::LineMode | lastLineMode = ttk::debug::LineMode::NEW |
AbstractTriangulation is an interface class that defines an interface for efficient traversal methods on triangulations of piecewise linear manifolds.
Definition at line 60 of file AbstractTriangulation.h.
|
protected |
Definition at line 3885 of file AbstractTriangulation.h.
|
protected |
Definition at line 3917 of file AbstractTriangulation.h.
|
protected |
Key type for gradientCacheType.
The key type models a scalar field buffer. The first element is a const void pointer to the beginning of the buffer and the second stores the timestamp of the last modification of the scalar field.
Definition at line 3910 of file AbstractTriangulation.h.
|
protected |
Discrete gradient internal struct.
0: paired edge id per vertex 1: paired vertex id per edge 2: paired triangle id per edge 3: paired edge id per triangle 4: paired tetra id per triangle 5: paired triangle id per tetra Values: -1 if critical or paired to a cell of another dimension
Is used as a value type for gradientCacheType.
Definition at line 3901 of file AbstractTriangulation.h.
AbstractTriangulation::AbstractTriangulation | ( | ) |
Definition at line 6 of file AbstractTriangulation.cpp.
|
overridedefault |
|
default |
|
default |
int AbstractTriangulation::clear | ( | ) |
Reset the triangulation data-structures.
Definition at line 14 of file AbstractTriangulation.cpp.
size_t AbstractTriangulation::footprint | ( | size_t | size = 0 | ) | const |
Computes and displays the memory footprint of the data-structure.
Definition at line 86 of file AbstractTriangulation.cpp.
|
inlinevirtual |
Get the localEdgeId-th
edge of the cellId-th
cell.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
In 1D, this function is equivalent to getCellNeighbor().
cellId | Input global cell identifier. |
localEdgeId | Input local edge identifier, in [0, getCellEdgeNumber()]. |
edgeId | Output global edge identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 101 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3067 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of edges for the cellId-th
cell.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
In 1D, this function is equivalent to getCellNeighborNumber().
cellId | Input global cell identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 138 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3074 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of edges for all cells.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
The number of entries in this list is equal to the number of cells. Each entry is a std::vector of identifiers whose size is equal to the number of edges for the corresponding cell.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
In 1D, this function is equivalent to getCellNeighbors().
Reimplemented in ttk::Triangulation.
Definition at line 180 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, and ttk::PeriodicImplicitTriangulation.
Definition at line 3079 of file AbstractTriangulation.h.
|
inline |
Compute the geometric barycenter of a given cell.
Definition at line 2533 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localNeighborId-th
cell neighbor of the cellId-th
cell.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
cellId | Input global cell identifier. |
localNeighborId | Input local neighbor identifier, in [0, getCellNeighborNumber()]. |
neighborId | Output global neighbor cell identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 213 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3084 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of cell neighbors for the cellId-th
cell.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
cellId | Input global cell identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 242 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3091 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of cell neighbors for all cells.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
The number of entries in this list is equal to the number of cells. Each entry is a std::vector of identifiers whose size is equal to the number of neighbor cells for the corresponding cell.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 277 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3096 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localTriangleId-th
triangle id of the cellId-th
cell.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
In 2D, this function is equivalent to getCellNeighbor().
cellId | Input global cell identifier. |
localTriangleId | Input local triangle identifier, in [0, getCellTriangleNumber()]. |
triangleId | Output global triangle identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 307 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3101 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of triangles for the cellId-th
cell.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
In 2D, this function is equivalent to getCellNeighborNumber().
cellId | Input global cell identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 344 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::PeriodicImplicitTriangulation.
Definition at line 3108 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of triangles for all cells.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
Also, the notion of triangle only makes sense if the triangulation has a dimension greater than 2 (otherwise, use the cell information).
The number of entries in this list is equal to the number of cells. Each entry is a std::vector of identifiers whose size is equal to the number of triangles for the corresponding cell.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
In 2D, this function is equivalent to getCellNeighbors().
Reimplemented in ttk::Triangulation.
Definition at line 390 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, and ttk::PeriodicImplicitTriangulation.
Definition at line 3113 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localVertexId-th
vertex identifier of the cellId-th
cell.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
cellId | Input global cell identifier. |
localVertexId | Input local vertex identifier, in [0, getCellVertexNumber()]. |
vertexId | Output global vertex identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 415 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3118 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of vertices in a cell.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
cellId | Input global cell identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 429 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3125 of file AbstractTriangulation.h.
|
inlinevirtual |
Reimplemented in ttk::Triangulation.
Definition at line 2553 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::ImplicitTriangulation, and ttk::PeriodicImplicitTriangulation.
Definition at line 3756 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the dimensionality of the triangulation (this value is equal to the dimension of the simplex with largest dimensionality).
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 436 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3129 of file AbstractTriangulation.h.
|
inline |
Compute the barycenter of the points of the given edge identifier.
Definition at line 2447 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localLinkId-th
simplex of the link of the edgeId-th
edge.
The output linkId
refers in 2D to a vertex identifier and in 3D to an edge identifier. It returns a negative value in 1D.
edgeId | Input global edge identifier. |
localLinkId | Input local link simplex identifier, in [0, getEdgeLinkNumber()]. |
linkId | Output link simplex identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< Derived >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicNoPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicWithPreconditions >, and ttk::Triangulation.
Definition at line 494 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3139 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of simplicies in the link of the edgeId-th
edge.
In 2D, this will return the number of vertices in the link, in 3D the number of edges. It returns a negative value in 1D.
edgeId | Input global edge identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 524 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3146 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of link simplices for all edges.
The number of entries in this list is equal to the number of edges. Each entry is a std::vector of identifiers representing vertices in 2D and edges in 3D. It returns NULL in 1D.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 558 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3151 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of edges of the triangulation.
Here the notion of edge only makes sense if the triangulation has a dimension greater than 1 (otherwise, use the cell information).
The number of entries in this list is equal to the number of edges. Each entry is a std::pair of vertex identifiers.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 464 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3134 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localStarId-th
cell of the star of the edgeId-th
edge.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
Also, the notion of edge only makes sense if the triangulation has a dimension greater than 1 (otherwise, use the cell information).
edgeId | Input global edge identifier. |
localStarId | Input local star cell identifier, in [0, getEdgeStarNumber()]. |
starId | Output global star cell identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< Derived >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicNoPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicWithPreconditions >, and ttk::Triangulation.
Definition at line 591 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3156 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of star cells for the edgeId-th
edge.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
Also, the notion of edge only makes sense if the triangulation has a dimension greater than 1 (otherwise, use the cell information).
edgeId | Input global edge identifier |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< Derived >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicNoPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicWithPreconditions >, and ttk::Triangulation.
Definition at line 625 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3163 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of star cell identifiers for all edges.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
Also, the notion of edge only makes sense if the triangulation has a dimension greater than 1 (otherwise, use the cell information).
The number of entries in this list is equal to the number of edges. Each entry is a std::vector of identifiers whose size is equal to the number of star cells for the corresponding edge.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 664 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3168 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localTriangleId-th
triangle id of the edgeId-th
edge.
In 2D, this function is equivalent to getEdgeStar().
edgeId | Input global edge identifier. |
localTriangleId | Input local triangle identifier, in [0, getEdgeTriangleNumber()]. |
triangleId | Output global triangle identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 694 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3173 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of triangles for the edgeId-th
edge.
In 2D, this function is equivalent to getEdgeStarNumber().
edgeId | Input global edge identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 728 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3180 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of triangles for all edges.
The number of entries in this list is equal to the number of edges. Each entry is a std::vector of identifiers whose size is equal to the number of triangles for the corresponding edge.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
In 2D, this function is equivalent to getEdgeStars().
Reimplemented in ttk::Triangulation.
Definition at line 769 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, and ttk::PeriodicImplicitTriangulation.
Definition at line 3185 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localVertexId-th
vertex identifier of the edgeId-th
edge.
In 1D, this function is equivalent to getCellVertex().
edgeId | Input global edge identifier. |
localVertexId | Input local vertex identifier (0 or 1). |
vertexId | Output global vertex identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 801 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3190 of file AbstractTriangulation.h.
|
inline |
Get the number of vertices of a particular edge. Always returns 2.
Definition at line 819 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3924 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the dimensions of the grid if the current object is the implicit triangulation of a regular grid.
dimensions | Vector that will be filled with the dimensions of the grid. This std::vector has 3 entries (first: x, second: y, third: z). |
Reimplemented in ttk::ImplicitTriangulation, and ttk::PeriodicImplicitTriangulation.
Definition at line 830 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of cells in the triangulation.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 839 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3196 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of edges in the triangulation.
In 1D, this function is equivalent to getNumberOfCells().
Reimplemented in ttk::Triangulation.
Definition at line 856 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, and ttk::PeriodicImplicitTriangulation.
Definition at line 3200 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of triangles in the triangulation.
In 2D, this function is equivalent to getNumberOfCells().
Reimplemented in ttk::Triangulation.
Definition at line 880 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, and ttk::PeriodicImplicitTriangulation.
Definition at line 3204 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of vertices in the triangulation.
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 896 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3208 of file AbstractTriangulation.h.
|
inline |
Compute the barycenter of the incenters of the triangles of the given tetra identifier.
Definition at line 2507 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localEdgeId-th
edge of the triangleId-th
triangle.
In 2D, this function is equivalent to getCellEdge().
triangleId | Input global triangle identifier. |
localEdgeId | Input local edge identifier, in [0, getTriangleEdgeNumber()]. |
edgeId | Output global edge identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 950 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3218 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of edges of the triangleId-th
triangle.
In 2D, this function is equivalent to getCellEdgeNumber().
triangleId | Input global triangle identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 982 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::PeriodicImplicitTriangulation.
Definition at line 3224 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of edges for all triangles.
The number of entries in this list is equal to the number of triangles. Each entry is a std::vector of identifiers representing the edges connected to the triangle (3).
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
In 2D, this function is equivalent to getCellEdges().
Reimplemented in ttk::Triangulation.
Definition at line 1020 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, and ttk::PeriodicImplicitTriangulation.
Definition at line 3230 of file AbstractTriangulation.h.
|
inline |
Compute the incenter of the points of the given triangle identifier.
Definition at line 2467 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localLinkId-th
simplex of the link of the triangleId-th
triangle.
The notion of triangle link only makes sense in 3D, where the output linkId
refers to a vertex identifier.
triangleId | Input global triangle identifier. |
localLinkId | Input local link simplex identifier, in [0, getTriangleLinkNumber()]. |
linkId | Output link simplex identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< Derived >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicNoPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicWithPreconditions >, and ttk::Triangulation.
Definition at line 1051 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3235 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of simplices in the link of the triangleId-th
triangle.
The notion of triangle link only makes sense in 3D, where the number of vertices in the link will be returned.
triangleId | Input global triangle identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1083 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3241 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of link simplices for all triangles.
The number of entries in this list is equal to the number of triangles. Each entry is a std::vector of identifiers representing a vertex.
The notion of triangle link only makes sense in 3D.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1119 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3247 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of triangles of the triangulation.
Here the notion of triangle only makes sense if the triangulation has a dimension greater than 2 (otherwise, use the cell information).
The number of entries in this list is equal to the number of triangles. Each entry is a std::vector of vertex identifiers.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 924 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3213 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localStarId-th
cell of the star of the triangleId-th
triangle.
The notion of triangle star only makes sense in 3D, where the output starId
refers to a tetrahedron identifier.
triangleId | Input global triangle identifier. |
localStarId | Input local star cell identifier, in [0, getTriangleStarNumber()]. |
starId | Output global star cell identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< Derived >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicNoPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicWithPreconditions >, and ttk::Triangulation.
Definition at line 1150 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3252 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of star cells for the triangleId-th
triangle.
The notion of triangle star only makes sense in 3D, where the number of tetrahedra in the star will be returned.
triangleId | Input global triangle identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< Derived >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicNoPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicWithPreconditions >, and ttk::Triangulation.
Definition at line 1181 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3258 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of star cell identifiers for all triangles.
The number of entries in this list is equal to the number of triangles. Each entry is a std::vector of identifiers whose size is equal to the number of star cells for the corresponding triangle.
The notion of triangle star only makes sense in 3D.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1218 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3264 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localVertexId-th
vertex identifier of the triangleId-th
triangle.
In 2D, this function is equivalent to getCellVertex().
triangleId | Input global edge identifier. |
localVertexId | Input local vertex identifier (in [0, 2]). |
vertexId | Output global vertex identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 1246 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3269 of file AbstractTriangulation.h.
|
inline |
Get the number of vertices of a particular triangle. Always returns 3.
Definition at line 1268 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localEdgeId-th
edge identifier connected to the vertexId-th
vertex.
In 1D, this function is equivalent to getVertexStar().
vertexId | Input global vertex identifier. |
localEdgeId | Input local edge identifier, in [0, getVertexEdgeNumber()]. |
edgeId | Output global edge identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 1292 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3276 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of edges connected to the vertexId-th
vertex.
In 1D, this function is equivalent to getVertexStarNumber().
vertexId | Input global vertex identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 1324 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3283 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of edge identifiers for all vertices.
The number of entries in this list is equal to the number of vertices. Each entry is a std::vector of identifiers whose size is equal to the number of edges connected to the corresponding vertex.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
In 1D, this function is equivalent to getVertexStars()
Reimplemented in ttk::Triangulation.
Definition at line 1361 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, and ttk::PeriodicImplicitTriangulation.
Definition at line 3288 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localLinkId-th
simplex of the link of the vertexId-th
vertex.
The output linkId
refers in 2D to an edge identifier and in 3D to a triangle identifier.
vertexId | Input global vertex identifier. |
localLinkId | Input local link simplex identifier, in [0, getVertexLinkNumber()]. |
linkId | Output link simplex identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< Derived >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicNoPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicWithPreconditions >, and ttk::Triangulation.
Definition at line 1391 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3293 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of simplices in the link of the vertexId-th
vertex.
In 2D, this will return the number of edges in the link, in 3D the number of triangles.
vertexId | Input global vertex identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1419 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3300 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of link simplices for all vertices.
The number of entries in this list is equal to the number of vertices. Each entry is a std::vector of identifiers representing edges in 2D and triangles in 3D.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1451 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3305 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localNeighborId-th
vertex neighbor of the vertexId-th
vertex.
vertexId | Input global vertex identifier. |
localNeighborId | Input local neighbor identifier, in [0, getVertexNeighborNumber()]. |
neighborId | Output global neighbor vertex identifier. |
Reimplemented in ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::PeriodicImplicitTriangulationCRTP< Derived >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicNoPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicWithPreconditions >, and ttk::Triangulation.
Definition at line 1475 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3310 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of vertex neighbors for the vertexId-th
vertex.
vertexId | Input global vertex identifier. |
Reimplemented in ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1500 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3316 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of vertex neighbor identifiers for all vertices.
The number of entries in this list is equal to the number of vertices. Each entry is a std::vector of identifiers whose size is equal to the number of vertex neighbors for the corresponding vertex.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1532 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3322 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the point (3D coordinates) for the vertexId-th
vertex.
vertexId | Input global vertex identifier. |
x | Output x coordinate. |
y | Output y coordinate. |
z | Output z coordinate. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< Derived >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicNoPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicWithPreconditions >, and ttk::Triangulation.
Definition at line 1546 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3327 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localStarId-th
cell of the star of the vertexId-th
vertex.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
vertexId | Input global vertex identifier. |
localStarId | Input local star cell identifier, in [0, getVertexStarNumber()]. |
starId | Output global star cell identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< Derived >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicNoPreconditions >, ttk::PeriodicImplicitTriangulationCRTP< PeriodicWithPreconditions >, and ttk::Triangulation.
Definition at line 1573 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3335 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of star cells for the vertexId-th
vertex.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
vertexId | Input global vertex identifier |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1601 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3342 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of star cell identifiers for all vertices.
Here the notion of cell refers to the simplicices of maximal dimension (3D: tetrahedra, 2D: triangles, 1D: edges).
The number of entries in this list is equal to the number of vertices. Each entry is a std::vector of identifiers whose size is equal to the number of star cells for the corresponding vertex.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1634 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3347 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the localTriangleId-th
triangle id of the vertexId-th
vertex.
In 2D, this function is equivalent to getVertexStar().
vertexId | Input global vertex identifier. |
localTriangleId | Input local triangle identifier, in [0, getVertexTriangleNumber()]. |
triangleId | Output global triangle identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 1662 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3352 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the number of triangles for the vertexId-th
vertex.
In 2D, this function is equivalent to getVertexStarNumber().
vertexId | Input global vertex identifier. |
Reimplemented in ttk::Triangulation.
Definition at line 1696 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3358 of file AbstractTriangulation.h.
|
inlinevirtual |
Get the list of triangles for all vertices.
The number of entries in this list is equal to the number of vertices. Each entry is a std::vector of identifiers whose size is equal to the number of triangles for the corresponding vertex.
In implicit mode, this function will force the creation of such a list (which will be time and memory consuming). THIS IS USUALLY A BAD IDEA.
In 2D, this function is equivalent to getVertexStars().
Reimplemented in ttk::Triangulation.
Definition at line 1737 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, and ttk::PeriodicImplicitTriangulation.
Definition at line 3364 of file AbstractTriangulation.h.
|
inline |
Returns true if the grid uses period boundary conditions.
Definition at line 1752 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3383 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3398 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3412 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3425 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3441 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3454 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3471 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3514 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3484 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3497 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3659 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3544 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3561 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3529 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3574 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3587 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3603 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3616 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3629 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3642 of file AbstractTriangulation.h.
|
inlinevirtual |
Check if the edge with global identifier edgeId
is on the boundary of the domain.
For 2D triangulations, this function will return true if the edge is a boundary edge. For 3D triangulations, this function will return true if the edge belongs to a boundary triangle.
Here the notion of edge only makes sense if the triangulation has a dimension greater than 1 (otherwise, use the cell information).
edgeId | Input global edge identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1775 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3369 of file AbstractTriangulation.h.
|
inlinevirtual |
Check if the data structure is empty or not.
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1785 of file AbstractTriangulation.h.
|
inlinevirtual |
If the triangulation is manifold or not (Rips Complexes are not manifold)
Reimplemented in ttk::Triangulation.
Definition at line 1792 of file AbstractTriangulation.h.
|
inlinevirtual |
Check if the triangle with global identifier triangleId
is on the boundary of the domain.
Here the notion of triangle only makes sense if the triangulation has a dimension greater than 2 (otherwise, use the cell information).
For 2D triangulations, this function will return false all the time. For 3D triangulations, this function will return true if the triangle is a boundary triangle.
triangleId | Input global triangle identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulation, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1850 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3373 of file AbstractTriangulation.h.
|
inlinevirtual |
Check if the vertex with global identifier vertexId
is on the boundary of the domain.
For 2D triangulations, this function will return true if the vertex belongs to a boundary edge. For 3D triangulations, this function will return true if the vertex belongs to a boundary triangle.
vertexId | Input global vertex identifier. |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitTriangulationCRTP< Derived >, ttk::ImplicitTriangulationCRTP< ImplicitNoPreconditions >, ttk::ImplicitTriangulationCRTP< ImplicitWithPreconditions >, ttk::PeriodicImplicitTriangulation, and ttk::Triangulation.
Definition at line 1875 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Definition at line 3379 of file AbstractTriangulation.h.
|
inlineoverrideprotectedvirtual |
Implements ttk::Wrapper.
Definition at line 3672 of file AbstractTriangulation.h.
|
default |
|
default |
|
inlinevirtual |
Pre-process the boundary edges.
This function should ONLY be called as a pre-condition to the following function(s):
Reimplemented in ttk::Triangulation.
Definition at line 1896 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3676 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the boundary triangles.
This function should ONLY be called as a pre-condition to the following function(s):
Reimplemented in ttk::Triangulation.
Definition at line 1919 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3680 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the boundary vertices.
This function should ONLY be called as a pre-condition to the following function(s):
Reimplemented in ttk::Triangulation.
Definition at line 1942 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3684 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the cell edges.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 1966 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3688 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the cell neighbors.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 1996 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3692 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the cell triangles.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2022 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3696 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the edge links.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2083 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3704 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the edges.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2057 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitWithPreconditions, ttk::ImplicitNoPreconditions, ttk::PeriodicWithPreconditions, ttk::PeriodicNoPreconditions, ttk::ImplicitTriangulation, and ttk::PeriodicImplicitTriangulation.
Definition at line 3700 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the edge stars.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2114 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3708 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the edge triangles.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2145 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3712 of file AbstractTriangulation.h.
|
inlinevirtual |
Check if the triangulation is manifold or not.
ttk::ExplicitTriangulation (and maybe ttk::CompactTriangulation too) can be generated from non-manifold datasets (such as a Rips Complex). Some TTK modules may be valid only for manifold triangulations, other may have alternatives for non-manifold data-sets (
This function should ONLY be called as a pre-condition to the following function(s):
Reimplemented in ttk::Triangulation.
Definition at line 1820 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::ExplicitTriangulation.
Definition at line 3752 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the triangle edges.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2218 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3720 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the triangle links.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2254 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3724 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the triangles.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2183 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, ttk::ImplicitWithPreconditions, ttk::ImplicitNoPreconditions, ttk::PeriodicWithPreconditions, ttk::PeriodicNoPreconditions, ttk::ImplicitTriangulation, and ttk::PeriodicImplicitTriangulation.
Definition at line 3716 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the triangle stars.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2285 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3728 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the vertex edges.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2316 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3732 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the vertex links.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2347 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3736 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the vertex neighbors.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2373 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, ttk::ExplicitTriangulation, and ttk::ImplicitTriangulation.
Definition at line 3740 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the vertex stars.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2399 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3744 of file AbstractTriangulation.h.
|
inlinevirtual |
Pre-process the vertex triangles.
This function should ONLY be called as a pre-condition to the following functions:
Reimplemented in ttk::Triangulation.
Definition at line 2425 of file AbstractTriangulation.h.
|
inlineprotectedvirtual |
Reimplemented in ttk::CompactTriangulation, and ttk::ExplicitTriangulation.
Definition at line 3748 of file AbstractTriangulation.h.
|
inlineprotected |
Definition at line 3768 of file AbstractTriangulation.h.
|
protected |
size_t ttk::AbstractTriangulation::tableTableFootprint | ( | const vector< vector< itemType > > & | table, |
const string & | tableName, | ||
ostream & | stream | ||
) | const |
Definition at line 66 of file AbstractTriangulation.cpp.
|
inlineoverrideprotected |
Definition at line 3787 of file AbstractTriangulation.h.
|
friend |
Definition at line 3878 of file AbstractTriangulation.h.
|
protected |
Definition at line 3807 of file AbstractTriangulation.h.
|
protected |
Definition at line 3807 of file AbstractTriangulation.h.
|
protected |
Definition at line 3807 of file AbstractTriangulation.h.
|
protected |
Definition at line 3827 of file AbstractTriangulation.h.
|
protected |
Definition at line 3809 of file AbstractTriangulation.h.
|
protected |
Definition at line 3828 of file AbstractTriangulation.h.
|
protected |
Definition at line 3811 of file AbstractTriangulation.h.
|
protected |
Definition at line 3812 of file AbstractTriangulation.h.
|
protected |
Definition at line 3813 of file AbstractTriangulation.h.
|
protected |
Definition at line 3814 of file AbstractTriangulation.h.
|
mutableprotected |
Definition at line 3930 of file AbstractTriangulation.h.
|
protected |
Definition at line 3805 of file AbstractTriangulation.h.
|
protected |
Definition at line 3791 of file AbstractTriangulation.h.
|
protected |
Definition at line 3791 of file AbstractTriangulation.h.
|
protected |
Definition at line 3792 of file AbstractTriangulation.h.
|
protected |
Definition at line 3792 of file AbstractTriangulation.h.
|
protected |
Definition at line 3793 of file AbstractTriangulation.h.
|
protected |
Definition at line 3793 of file AbstractTriangulation.h.
|
protected |
Definition at line 3794 of file AbstractTriangulation.h.
|
protected |
Definition at line 3795 of file AbstractTriangulation.h.
|
protected |
Definition at line 3794 of file AbstractTriangulation.h.
|
protected |
Definition at line 3795 of file AbstractTriangulation.h.
|
protected |
Definition at line 3796 of file AbstractTriangulation.h.
|
protected |
Definition at line 3801 of file AbstractTriangulation.h.
|
protected |
Definition at line 3797 of file AbstractTriangulation.h.
|
protected |
Definition at line 3797 of file AbstractTriangulation.h.
|
protected |
Definition at line 3796 of file AbstractTriangulation.h.
|
protected |
Definition at line 3798 of file AbstractTriangulation.h.
|
protected |
Definition at line 3798 of file AbstractTriangulation.h.
|
protected |
Definition at line 3799 of file AbstractTriangulation.h.
|
protected |
Definition at line 3799 of file AbstractTriangulation.h.
|
protected |
Definition at line 3800 of file AbstractTriangulation.h.
|
protected |
Definition at line 3800 of file AbstractTriangulation.h.
|
protected |
Definition at line 3803 of file AbstractTriangulation.h.
|
protected |
Definition at line 3808 of file AbstractTriangulation.h.
|
protected |
Definition at line 3810 of file AbstractTriangulation.h.
|
protected |
Definition at line 3816 of file AbstractTriangulation.h.
|
protected |
Definition at line 3829 of file AbstractTriangulation.h.
|
protected |
Definition at line 3817 of file AbstractTriangulation.h.
|
protected |
Definition at line 3815 of file AbstractTriangulation.h.
|
protected |
Definition at line 3818 of file AbstractTriangulation.h.
|
protected |
Definition at line 3819 of file AbstractTriangulation.h.
|
protected |
Definition at line 3820 of file AbstractTriangulation.h.
|
protected |
Definition at line 3821 of file AbstractTriangulation.h.
|
protected |
Definition at line 3822 of file AbstractTriangulation.h.
|
protected |
Definition at line 3823 of file AbstractTriangulation.h.