CGAL 6.3-dev - Homological Discrete Vector Fields
Loading...
Searching...
No Matches
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 1234]
 NCGAL
 NHomological_discrete_vector_field
 CAbstract_simplicial_chain_complexThe class Abstract_simplicial_chain_complex represents (topological) chain complexes associated to abstract simplicial complexes
 CComplex_duality_data_tType returned by dualize_complex()
 CCub_object_ioThe class Cub_object_io is an intermediate IO class, used to load binary volumes and produce cubical complexes
 CCubical_chain_complexThe class Cubical_chain_complex represents (topological) chain complexes associated to cubical complexes
 CDuality_cubical_complex_toolsThe class Duality_cubical_complex_tools is dedicated to Alexander duality for 3D binary volumes
 CDuality_simplicial_complex_toolsThe class Duality_simplicial_complex_tools is dedicated to Alexander duality for 3D surface meshes
 CFiltration_coreThe class Filtration_core implements data structures and methods required by the Filtration concept
 CFiltration_iter_valueType of value returned by the iterator
 CFiltration_lower_starThe class Filtration_lower_star implements the lower star filtration on a given complex implementing the concept AbstractChainComplex
 CHdvfThe class Hdvf implements homology and cohomology computation via homological discrete vector fields (HDVF for short)
 CHole_informationHole information returned by iterator
 CiteratorIterator over homology/cohomology generators
 CHdvf_coreThe class Hdvf_core is the core implementation of homological discrete vector fields (HDVF for short)
 CHdvf_dualityThe class Hdvf_duality is the implementation of homological discrete vector fields (HDVF for short) for Alexander duality computation
 CHdvf_persistenceThe class Hdvf_persistence computes persistent homology using HDVFs
 CPersistence_intervalStructure storing (full) persistent interval data:
 CPersistent_holeHole information returned by the persistent diagram iterator
 CiteratorIterator over (finite) persistent intervals
 CHdvf_traits_2The class Hdvf_traits_2 implements the HDVFTraits concept for 2D data, using a geometric kernel K
 CHdvf_traits_3The class Hdvf_traits_3 implements the HDVFTraits concept for 3D data, using a geometric kernel K
 CHdvf_traits_dThe class Hdvf_traits_d implements the HDVFTraits concept for dD data, using a geometric kernel K
 CIcosphere_object_ioThe class Icosphere_object_io is an intermediate IO class, used to produce a Mesh_object_io containing an icosphere (for Hdvf_duality with tetgen)
 CMesh_object_ioThe class Mesh_object_io is an intermediate IO class, used to load and create arbitrary collections of simplices, that is collections without a priori structures, unlike simplicial complexes (closed under the face operation), proper meshes (including only cells of maximal dimension) or manifolds
 CSimplexThe class Simplex is used by the class Abstract_simplicial_chain_complex to represent a simplex (i.e. cells of a simplicial complex)
 CSimplicial_chain_complexThe class Simplicial_chain_complex refines the Abstract_simplicial_chain_complex class by assigning coordinates to vertices (i.e. 0-simplices)
 CSub_chain_complex_maskThe class Sub_chain_complex_mask is a technical class implementing a sub chain complex
 CSurface_mesh_ioThe class Surface_mesh_io is an intermediate IO class, used to load the collection of simplices of a triangle mesh
 CHole_informationHole information returned by the iterator
 CiteratorIterator over homology/cohomology generators of an Hdvf computed over a complex built from the initial surface mesh
 CTet_object_ioThe class Tet_object_io is an intermediate IO class, used to load a tetgen triangulation (for Hdvf_duality) into a Mesh_object_io structure
 CTriangulation_3_ioThe class Triangulation_3_io is an intermediate IO class, used to load a Triangulation_3 and produce simplicial complexes
 NOSM
 CBitboardThe class Bitboard implements an accelerating iteration structure, derived from the chess community
 CFull_luThe class Full_lu implements LU decomposition via full pivoting for an OSM::Sparse_matrix
 CSparse_chainThe class Sparse_chain implements the concept SparseChain, that is, sparse vectors (encoding homological chains) optimized for topological computations
 CSparse_matrixThe class Sparse_matrix implements the concept SparseMatrix, that is, sparse matrices optimized for topological computations
 CSparse_matrix_structureThe structure Sparse_matrix_structure provides a user friendly interface for sparse matrices built over a given model of SparseChain (this is actually a Curryfication of the Sparse_matrix template)
 CSub_sparse_matrixThe class Sub_sparse_matrix is a technical class, deriving from Sparse_matrix together with a system of masks to partially screen matrices (and restrict computations to a subset of indices along their major direction)
 CSub_sparse_matrix_structureThe structure Sub_sparse_matrix_structure provides a user friendly interface for sub-sparse matrices built over a given SparseChainmodel (this is actually a Curryfication of the Sub_parse_matrix_core template)
 CAbstractChainComplexThe concept AbstractChainComplex describes the requirements for (topological) chain complexes associated to abstract complexes used in the concept HDVF
 CiteratorThe iterator over bitboards
 Creverse_iteratorThe reverse iterator over bitboards
 CFiltrationThe concept Filtration describes the requirements for persistent filtrations associated to persistent homology computation
 CFiltration_iter_valueValue type of the filtration iterator
 CiteratorThe iterator over filtration
 CGeometricChainComplexThe concept GeometricChainComplex refines the concept AbstractChainComplex and describes the requirements for (topological) chain complexes associated to geometric complexes used in the concept HDVF. It adds to AbstractChainComplex methods to get vertex coordinates
 CHDVFThe concept HDVF describes the requirements for Homological Discrete Vector Fields (HDVF for short) , a theory of computational homology unifying discrete Morse theory and effective homology. HDVFs were introduced by Aldo Gonzalez-Lorenzo in his PhD (see [AGL,2017], [AGL,2016])
 CCell_pairStructure to represent data for HDVF operations (between pairs of cells)
 CHDVFTraitsThe concept HDVFTraits describes the requirements for geometric traits classes used in this package
 CSparseChainThe concept SparseChain describes the requirements for sparse vectors (called sparse chains in homology) optimized for topological computations. More precisely, SparseChain provides all the operations on chains required by the SparseMatrix concept
 CSparseMatrixThe concept SparseMatrix describes the requirements for sparse matrices optimized for topological computations. Traditionally, sparse matrices data structures encode non zero coefficients of (sparse) matrices in order to optimize either matrices memory footprint, or linear algebra operations (which usually comes to optimize iterators over non zero coefficients and access to coefficients). However, topological operations require slightly different features:
 CSparseMatrixStructureThe concept SparseMatrixStructure describes the requirements for a class providing a model of SparseChain and an associated model of SparseMatrix