Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 1234]

▼NGudhi
▼Ncontraction
CContraction_visitor	Interface for a visitor of the edge contraction process
CContraction_visitor_remove_popable	Visitor to remove popable blockers after an edge contraction
CCost_policy	Policy to specify the cost of contracting an edge
CDummy_valid_contraction	Policy that accept all edge contraction
CEdge_length_cost	Return a cost corresponding to the squared length of the edge
CFirst_vertex_placement	Places the contracted point onto the first point of the edge
CLink_condition_valid_contraction	Policy that only accept edges verifying the link condition (and therefore whose contraction preserving homotopy type)
CPlacement_policy	Policy to specify where the merged point had to be placed after an edge contraction
CSkeleton_blocker_contractor	Class that allows to contract iteratively edges of a simplicial complex
CValid_contraction_policy	Policy to specify if an edge contraction is valid or not
▼Npersistent_cohomology
CField_Zp	Structure representing the coefficient field
CMulti_field	Structure representing coefficients in a set of finite fields simultaneously using the chinese remainder theorem
CPersistent_cohomology	Computes the persistent cohomology of a filtered complex
▼Nskbl
CBlocker_iterator_around_vertex_internal	Iterator through the blockers of a vertex
CBlocker_iterator_internal	Iterator through the blockers of a vertex
CComplex_edge_iterator	Iterator on the edges of a simplicial complex
CComplex_vertex_iterator	Iterator on the vertices of a simplicial complex
CDummy_complex_visitor	A dummy visitor of a simplicial complex that does nothing
CPrint_complex_visitor	A visitor that prints the visit information
CSimplex_around_vertex_iterator
CSkeleton_blocker_complex	Abstract Simplicial Complex represented with a skeleton/blockers pair
CSkeleton_blocker_complex_visitor	Interface for a visitor of a simplicial complex
CSkeleton_blocker_geometric_complex	Class that represents a geometric complex that can be simplified. The class allows access to points of vertices
CSkeleton_blocker_link_complex	Class representing the link of a simplicial complex encoded by a skeleton/blockers pair. It inherits from Skeleton_blocker_sub_complex because such complex is a sub complex of a root complex
CSkeleton_blocker_link_superior	Class representing the link of a simplicial complex encoded by a skeleton/blockers pair. It computes only vertices greater than the simplex used to build the link
CSkeleton_blocker_off_reader	Class that allows to load a Skeleton_blocker_complex from an off file
CSkeleton_blocker_off_visitor_reader	Off reader visitor that can be passed to Off_reader to read a Skeleton_blocker_complex
▼CSkeleton_blocker_simple_geometric_traits	Simple traits that is a model of SkeletonBlockerGeometricDS and can be passed as a template argument to Skeleton_blocker_geometric_complex
CSimple_geometric_vertex	Vertex with a point attached
▼CSkeleton_blocker_simple_traits	Simple traits that is a model of SkeletonBlockerDS and can be passed as a template argument to Skeleton_blocker_complex
CRoot_vertex_handle	Global and local handle similar to boost subgraphs. Vertices are stored in a vector. For the root simplicial complex, the local and global descriptors are the same. For a subcomplex L and one of its vertices 'v', the local descriptor of 'v' is its position in the vertex vector of the subcomplex L whereas its global descriptor is the position of 'v' in the vertex vector of the root simplicial complex
CSkeleton_blocker_simplex	Abstract simplex used in Skeleton blockers data-structure
CSkeleton_blocker_simplifiable_complex	Class that allows simplification operation on a simplicial complex represented by a skeleton/blockers pair
CSkeleton_blocker_sub_complex	Simplicial subcomplex of a complex represented by a skeleton/blockers pair
▼CSkeletonBlockerDS	Concept for the template class passed for Skeleton_blocker_complex. Most importantly, it contains the nodes for vertices and edges (Graph_vertex and Graph_edge) that are stored in the simplicial complex. The user can redefine these classes to attach additional information to vertices and edges
CGraph_edge	The type of edges that are stored the boost graph. An Edge must be Default Constructible and Equality Comparable
CGraph_vertex	The type of vertices that are stored the boost graph. A Vertex must be Default Constructible and Equality Comparable
CRoot_vertex_handle	Root_vertex_handle and Vertex_handle are similar to global and local vertex descriptor used in boost subgraphs and allow to localize a vertex of a subcomplex on its parent root complex
CVertex_handle
▼CSkeletonBlockerGeometricDS	Concept for template class of Skeleton_blocker_geometric_complex . It must specify a GeometryTrait which contains a Point definition
CGraph_Edge	Edge that allows to access to an index. The indices of the edges are used to store heap information in the edge contraction algorithm
CGraph_vertex	Vertex that stores a point
CTriangle_around_vertex_iterator	Iterator over the triangles that are adjacent to a vertex of the simplicial complex
CTriangle_iterator	Iterator over the triangles of the simplicial complex
CHasse_complex	Data structure representing a Hasse diagram, i.e. a complex where all codimension 1 incidence relations are explicitly encoded
Clinear_indexing_tag	Tag for a linear ordering of simplices
COff_reader
CSimplex_tree	Simplex Tree data structure for representing simplicial complexes
CCoefficientField	Concept describing the requirements for a class to represent a field of coefficients to compute persistent homology
CFilteredComplex	The concept FilteredComplex describes the requirements for a type to implement a filtered cell complex, from which one can compute persistent homology via a model of the concept PersistentHomology
CFiltrationValue	Value type for a filtration function on a cell complex
CIndexingTag	Concept describing an indexing scheme (see FilteredComplex) for applying continuous maps to a cell complex, and compute its persistent homology
CPersistentHomology	Concept describing the requirements for a class to compute persistent homology
CSimplexKey	Key type used as simplex identifier
CTest
CVertexHandle	Handle type for the vertices of a cell complex