TTK
Loading...
Searching...
No Matches
Classes | Typedefs | Enumerations
ttk::ftr Namespace Reference

Classes

class  Allocable
 
struct  ArcData
 
class  AtomicUF
 Union find compliant with parallel find and maintaining the current local propagation inspired by ttk::UnionFind. More...
 
struct  Comp
 
class  DynamicGraph
 TTK fTRGraph dynamic graph tracking the evolution of level sets. More...
 
struct  DynGraphNode
 class representing a node of a tree and the link to its parent if not the root More...
 
struct  DynGraphs
 
class  FTRGraph
 TTK FTRGraph processing package. More...
 
class  Graph
 TTK FTRGraph graph skeleton. More...
 
class  Lazy
 TTK DynamicGraph laziness. More...
 
class  LocalForest
 
struct  LocalForests
 
class  Mesh
 TTK FTRGraph mesh related operations. More...
 
class  Node
 TTK FTRGraph node of the Graph. More...
 
struct  NodeData
 
struct  ObjectData
 
struct  Params
 
class  Propagation
 TTK fTRGraph propagation management with Fibonacci heaps. More...
 
class  Propagations
 manage propagations for FTR Graph More...
 
class  Scalars
 
class  Segment
 TTK processing package that deal with segmentation of an arc in the Reeb Graph. More...
 
struct  SegmInfo
 
struct  Star
 
class  SuperArc
 TTK FTRGraph graph arc. More...
 
struct  TaskChunk
 
class  Tasks
 TTK FTRGraph tasks management tools. More...
 
struct  triScheme
 
struct  Valences
 
struct  Vert
 
struct  VertData
 
struct  Visit
 
struct  Visits
 

Typedefs

using idRoot = int
 
using idSuperArc = long unsigned int
 SuperArc index in vect_superArcs_.
 
using idNode = unsigned int
 Node index in vect_nodes_.
 
using idVertex = SimplexId
 Vertex index in scalars_.
 
using idEdge = SimplexId
 Edge index in vect_edgeList_.
 
using idCell = SimplexId
 Cell index in vect_cellList_.
 
using idPropagation = idNode
 for task identifiers
 
using valence = SimplexId
 for vertex up/down valence
 
using idSegmentation = long int
 retains history
 
using orderedEdge = std::tuple< idVertex, idVertex >
 Edge represented by its 2 vertices, lower then upper.
 
using orderedTriangle = std::tuple< idEdge, idEdge, idEdge >
 Triangle represented by its 3 edges Edges are sorted by their starting vertex (see orderedEdge)
 
using VertCompFN = std::function< bool(const idVertex, const idVertex)>
 
using EdgeCompFN = std::function< bool(const idEdge, const idEdge)>
 
using linkEdge = std::pair< idEdge, idEdge >
 
using LinkCompFN = std::function< bool(const linkEdge &, const linkEdge &)>
 
using segm_it = std::vector< idVertex >::iterator
 
using segm_rev_it = std::vector< idVertex >::reverse_iterator
 
using segm_const_it = std::vector< idVertex >::const_iterator
 
using segm_const_rev_it = std::vector< idVertex >::const_reverse_iterator
 
using edgeScheme = char
 

Enumerations

enum class  vertPosInTriangle : char { Start = 0 , Middle , End }
 position of a vertex in a triangle More...
 
enum class  GraphComponent {
  Arc = -1 , Local_minimum , Saddle1 , Saddle2 ,
  Local_maximum
}
 
enum class  ArcType : char {
  Min_arc = 0 , Max_arc , Saddle1_arc , Saddle2_arc ,
  Saddle1_saddle2_arc
}
 
enum class  NodeType {
  Local_minimum = 0 , Saddle1 , Saddle2 , Degenerate ,
  Local_maximum , Regular
}
 
enum  PriorityLevel {
  Min = 0 , Low , Average , High ,
  Higher , Max
}
 

Typedef Documentation

◆ EdgeCompFN

using ttk::ftr::EdgeCompFN = typedef std::function<bool(const idEdge, const idEdge)>

Definition at line 54 of file FTRDataTypes.h.

◆ edgeScheme

using ttk::ftr::edgeScheme = typedef char

Definition at line 34 of file Mesh.h.

◆ idCell

using ttk::ftr::idCell = typedef SimplexId

Cell index in vect_cellList_.

Definition at line 33 of file FTRDataTypes.h.

◆ idEdge

using ttk::ftr::idEdge = typedef SimplexId

Edge index in vect_edgeList_.

Definition at line 31 of file FTRDataTypes.h.

◆ idNode

using ttk::ftr::idNode = typedef unsigned int

Node index in vect_nodes_.

Definition at line 27 of file FTRDataTypes.h.

◆ idPropagation

for task identifiers

Definition at line 35 of file FTRDataTypes.h.

◆ idRoot

using ttk::ftr::idRoot = typedef int

Definition at line 27 of file DynamicGraph.h.

◆ idSegmentation

using ttk::ftr::idSegmentation = typedef long int

retains history

Definition at line 39 of file FTRDataTypes.h.

◆ idSuperArc

using ttk::ftr::idSuperArc = typedef long unsigned int

SuperArc index in vect_superArcs_.

Definition at line 25 of file FTRDataTypes.h.

◆ idVertex

using ttk::ftr::idVertex = typedef SimplexId

Vertex index in scalars_.

Definition at line 29 of file FTRDataTypes.h.

◆ LinkCompFN

using ttk::ftr::LinkCompFN = typedef std::function<bool(const linkEdge &, const linkEdge &)>

Definition at line 56 of file FTRDataTypes.h.

◆ linkEdge

using ttk::ftr::linkEdge = typedef std::pair<idEdge, idEdge>

Definition at line 55 of file FTRDataTypes.h.

◆ orderedEdge

using ttk::ftr::orderedEdge = typedef std::tuple<idVertex, idVertex>

Edge represented by its 2 vertices, lower then upper.

Definition at line 42 of file FTRDataTypes.h.

◆ orderedTriangle

using ttk::ftr::orderedTriangle = typedef std::tuple<idEdge, idEdge, idEdge>

Triangle represented by its 3 edges Edges are sorted by their starting vertex (see orderedEdge)

Definition at line 46 of file FTRDataTypes.h.

◆ segm_const_it

using ttk::ftr::segm_const_it = typedef std::vector<idVertex>::const_iterator

Definition at line 29 of file FTRSegmentation.h.

◆ segm_const_rev_it

using ttk::ftr::segm_const_rev_it = typedef std::vector<idVertex>::const_reverse_iterator

Definition at line 30 of file FTRSegmentation.h.

◆ segm_it

using ttk::ftr::segm_it = typedef std::vector<idVertex>::iterator

Definition at line 27 of file FTRSegmentation.h.

◆ segm_rev_it

using ttk::ftr::segm_rev_it = typedef std::vector<idVertex>::reverse_iterator

Definition at line 28 of file FTRSegmentation.h.

◆ valence

using ttk::ftr::valence = typedef SimplexId

for vertex up/down valence

Definition at line 37 of file FTRDataTypes.h.

◆ VertCompFN

using ttk::ftr::VertCompFN = typedef std::function<bool(const idVertex, const idVertex)>

Definition at line 53 of file FTRDataTypes.h.

Enumeration Type Documentation

◆ ArcType

enum class ttk::ftr::ArcType : char
strong
Enumerator
Min_arc 
Max_arc 
Saddle1_arc 
Saddle2_arc 
Saddle1_saddle2_arc 

Definition at line 93 of file FTRDataTypes.h.

◆ GraphComponent

enum class ttk::ftr::GraphComponent
strong
Enumerator
Arc 
Local_minimum 
Saddle1 
Saddle2 
Local_maximum 

Definition at line 85 of file FTRDataTypes.h.

◆ NodeType

enum class ttk::ftr::NodeType
strong
Enumerator
Local_minimum 
Saddle1 
Saddle2 
Degenerate 
Local_maximum 
Regular 

Definition at line 101 of file FTRDataTypes.h.

◆ PriorityLevel

Enumerator
Min 
Low 
Average 
High 
Higher 
Max 

Definition at line 83 of file FTRTasks.h.

◆ vertPosInTriangle

enum class ttk::ftr::vertPosInTriangle : char
strong

position of a vertex in a triangle

Enumerator
Start 
Middle 
End 

Definition at line 49 of file FTRDataTypes.h.