TTK
Loading...
Searching...
No Matches
Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 12345678]
 C_persistenceCmp
 C_persistenceCmp3
 C_persistencePairCmp
 Cttk::cta::AlignmentEdgeBasic data structure for an edge of an unrooted alignment tree
 Cttk::cta::AlignmentNodeBasic data structure for a node of an unrooted alignment tree
 Cttk::cta::AlignmentTreeBasic tree data structure for an alignment of two rooted binary trees
 Cttk::cf::ArcRegion
 Cttk::ftm::ArcRegion
 Cstd::array
 Cttk::ArrayLinkedList< datatype, size >This class describes a dynamic size data structure for thread safe computation. It is a linked list of arrays that also stores the current number of elements. Its key feature is that the addition of an element will never cause the moving of the data structure in memory, unlike an std::vector, making the access to an element thread safe even if another thread is adding elements
 CAtomicUF
 Cttk::ftm::AtomicUF
 Cttk::ftr::AtomicUF
 Cttk::BaseClass
 Cttk::cta::BinaryTreeBasic tree data structure for a rooted contour tree of degree 2 and rooted contour tree alignments of degree 2
 Cbinomial_coeff_table
 Cttk::rpd::BoundaryContainer
 Cttk::BoundingVolumeHierarchy< IT >Acceleration structure for native ray tracer. Based on implementation described in Physically Based Rendering: From Theory to Implementation by Matt Pharr, Wenzel Jakob and Greg Humphreys
 Cttk::ExTreeM::BranchA branch consists of the saddle vertices lying on the branch, and the parentbranch from which it splits / joins
 CBranchMappingDistance
 Cttk::VectorSimplification::CandidatePairCandidate pair struct for information of pairs connected by V-Paths We need to know the start and end points, type of connection, weight of connection and which cell to follow for ascending or descending path
 CCell
 Cttk::dcg::Cell
 Cttk::CellArrayCellArray generic array of cells
 Cttk::ftr::Comp
 Cttk::Compare
 Cttk::MergeTreePrincipalGeodesics::Compare
 Cttk::ftm::Comparison
 Cttk::ConnectedComponents::Component
 Ccompressed_distance_matrix< Layout >
 Ccompressed_sparse_matrix< ValueType >
 CContourForests
 CContourForestsTree
 CContourTree#####################################################################################################################
 Cttk::cta::ContourTree#####################################################################################################################
 Cttk::TrackingFromOverlap::CoordinateComparator
 Cttk::dcg::CriticalPoint
 Cttk::criticalPointPairComparisonComparison between critical point pairs ( (Extremum,Saddle), dist(M,S) )
 Cttk::CriticalVertexCritical Vertex
 Cttk::cta::CTEdgeBasic data structure for an edge of an unrooted contour tree
 Cttk::cta::CTNodeBasic data structure for a node of an unrooted contour tree
 Cttk::ftm::CurrentState
 CDataTypes
 CDataTypes
 CDataTypes
 CDimensionReductionModelTTK base class for containing reduction dimension models
 CDiscreteMorseSandwichMPITTK DiscreteMorseSandwichMPI processing package
 CDisjointSets
 Cttk::DynamicTreeImplements the Dynamic Tree data-structure (or ST-Tree)
 Cttk::ftr::DynGraphNode< Type >Class representing a node of a tree and the link to its parent if not the root
 Cttk::ftr::DynGraphs
 Cttk::DynTreeNodeClass representing a node of a tree and the link to its parent if not the root
 Cttk::Graph::Edge
 Ceuclidean_distance_matrix
 Cttk::cf::ExtendedUnionFind
 CExtendedUnionFind
 CFastRipsPersistenceDiagram2TTK base class that computes the persistence diagram of a Rips complex of a planar point cloud using a fast, dedicated algorithm
 Cttk::rpd::FiltratedEdge
 Cttk::rpd::FiltratedQuadEdge
 Cttk::rpd::FiltratedTriangle
 CfiltrationCtCmp
 Cttk::FlatJaggedArrayReplacement for std::vector<std::vector<SimplexId>>
 CFTMTree
 CFTMTree_CT
 CFTMTree_MT
 CFTMTreePP
 CFTMTreePPUtils
 CFTMTreeUtils_Template
 Cttk::DiscreteMorseSandwich::GeneratorTypeType for exporting persistent generators
 Cgreater_diameter_or_smaller_index< Entry >
 Cttk::ImplicitCluster
 Cttk::intgl::IntegralLineStruct containing the data of an integral line. trajectories: vector of identifiers of each vertex the integral line passes on distanceFromSeed: distance of each vertex for the integral line from the seed localVertexIdentifiers: vector of local vertex ids. It represents the number of the vertex in the integral line. seedIdentifier: identifier of the seed of the integral line forkIdentifier: identifier of the last fork the integral line encountered
 Cttk::cf::Interface
 Cttk::FiberSurface::IntersectionTriangle
 Cttk::FlatJaggedArray::Iterator
 Cttk::KDTree< dataType, Container >TTK KD-Tree
 Cttk::ftr::LocalForests
 Cttk::ftm::LocalFTM
 CLocalizedTopologicalSimplification
 CLocCell< n >
 Cttk::LockRAII wrapper around OpenMP lock
 Cttk::LRUCache< KeyType, ValueType >LRU cache implementation
 Cttk::mandatorySaddleComparisonComparison between mandatory saddles (Saddle id, Number of merged extrema)
 Cttk::Memory
 Cttk::ftm::MergeTree< dataType >
 CMergeTree
 CMergeTreeBarycenter
 CMergeTreeBase
 CMergeTreeClustering
 CMergeTreeDistance
 CMergeTreeUtils
 CMergeTreeVisualization
 Cttk::WebSocketIO::Message
 Cttk::DimensionReductionMetrics::Metrics
 CMyCmp
 Cttk::BoundingVolumeHierarchy< IT >::Node
 Cttk::cf::Node
 Cttk::ftm::Node
 Cttk::ftr::NodeTTK FTRGraph node of the Graph
 Cttk::LowestCommonAncestor::Node
 Cttk::TrackingFromOverlap::Node
 Cttk::ftr::ObjectData
 COctreeNode
 Cttk::RangeDrivenOctree::OctreeNode
 Cttk::OsCallOs-specifics
 Cttk::MorseSmaleComplex::Output1Separatrices1-Separatrices point and cell data arrays
 Cttk::TopologicalSkeleton::Output1Separatrices1-Separatrices point and cell data arrays
 Cttk::MorseSmaleComplex::Output2Separatrices2-Separatrices point and cell data arrays
 Cttk::TopologicalSkeleton::Output2Separatrices2-Separatrices point and cell data arrays
 Cttk::MorseSmaleComplex::OutputCriticalPointsCritical points data arrays
 Cttk::TopologicalSkeleton::OutputCriticalPointsCritical points data arrays
 Cttk::MorseSmaleComplex::OutputManifoldPointers to pre-allocated segmentation point data arrays
 Cttk::TopologicalSkeleton::OutputManifoldPointers to pre-allocated segmentation point data arrays
 Cttk::PathCompression::OutputSegmentationPointers to pre-allocated segmentation point data arrays
 Cstd::pair
 Cttk::pairComparisonComparison of the second member of a std::pair<int,double>
 Cttk::cf::ParallelData
 Cttk::cf::ParallelParams
 Cttk::cf::Params
 Cttk::ftm::Params
 Cttk::ftr::Params
 Cttk::periodicGhosts::partialGlobalBound
 CPathMappingDistance
 Cttk::PersistenceDiagramAuctionActor
 Cttk::DiscreteMorseSandwich::PersistencePairPersistence pair struct as exported by DiscreteGradient
 Cttk::MultiresTopology::PersistencePair
 Cttk::PersistencePairPersistence Pair
 Cttk::PersistentSimplexPairs::PersistencePair
 Cttk::VectorSimplification::PlotPoint
 Cttk::Geometry::ProjectionInputStores the findProjection() input
 Cttk::Geometry::ProjectionResultStores the findProjection() result
 Cttk::ftr::PropagationTTK fTRGraph propagation management with Fibonacci heaps
 Cttk::lts::Propagation< IT >Superlevel Set Component Propagation
 Cttk::RayData structure for a ray
 Cttk::cf::Region
 Cttk::ftm::Region
 CRegistryValue
 CRipser< DistanceMatrix >
 Cttk::dcg::SaddleSaddleVPathComparator< dataType >
 Cttk::cf::Scalars
 Cttk::ftm::Scalars
 Cttk::cf::Segment
 Cttk::ftm::Segment
 Cttk::ftr::Segment
 CsegmentIterator
 Cttk::cf::Segments
 Cttk::ftm::Segments
 Cttk::ftr::SegmInfo
 Cttk::MorseSmaleComplex::Separatrix
 Cttk::TopologicalSkeleton::Separatrix
 Cttk::ftm::SharedData
 Cttk::ReebSpace::Sheet0
 Cttk::ReebSpace::Sheet1
 Cttk::ReebSpace::Sheet2
 Cttk::ReebSpace::Sheet3
 Cttk::DiscreteMorseSandwich::Simplex< n >Ad-hoc struct for sorting simplices
 Cttk::DiscreteMorseSandwich::Simplex< 2 >
 Cttk::DiscreteMorseSandwich::Simplex< 3 >
 Cttk::DiscreteMorseSandwich::Simplex< 4 >
 CRipser< DistanceMatrix >::simplex_coboundary_enumerator
 Cttk::FlatJaggedArray::Slice
 Csparse_distance_matrix
 Cttk::ftr::Star
 Cttk::cf::SuperArc
 Cttk::ftm::SuperArc
 Cttk::SweepCmp
 Cttk::ftr::TaskChunk
 Cttk::ftr::TasksTTK FTRGraph tasks management tools
 Cttk::Timer
 Cttk::TopologicalLossTTK base class for representing differentiable topological losses to be used in dimension reduction
 Cttk::cta::TreeBasic tree data structure for a rooted contour tree of unbounded degree
 Cttk::cf::TreeData
 Cttk::ftm::TreeData
 Cttk::BoundingVolumeHierarchy< IT >::Triangle
 Cttk::FiberSurface::Triangle
 Cttk::ftr::triScheme
 CttkMergeTreeAutoencoderUtils
 CttkMergeTreeTemporalReductionUtils
 CttkMergeTreeUtils
 CttkUtilsTTK Util Functions
 CttkWRLExporterTTK helper that fixes a few bugs in the texture support for the VRML export
 Cunion_find
 Cttk::rpd::UnionFind
 Cttk::ftr::Valences
 Cstd::vector
 Cttk::ftr::Vert< ScalarType >
 Cttk::FiberSurface::Vertex
 Cttk::Graph::Vertex
 Cttk::cf::vertex
 Cttk::ftr::Visit
 Cttk::VisitedMaskAuto-cleaning re-usable graph propagations data structure
 Cttk::ftr::Visits
 Cttk::dcg::VPath
 CvtkAlgorithm
 CvtkCommand
 CvtkDataSetWriter
 CvtkInteractorStyleTrackballCamera
 CvtkSmartPointer< T >
 CvtkTopologicalCompressionTTK VTK-filter that wraps the topologicalCompression processing package
 CvtkUnstructuredGridAlgorithm
 Cttk::ftm::WrapperData