Functions — github.com/GUDHI/gudhi-devel

CodeHub MCPcopy Create free account

hub / github.com/GUDHI/gudhi-devel / functions

Functions4,084 in github.com/GUDHI/gudhi-devel

⨍ Functions 4,084◇ Types & classes 709

↓ 2 callersMethod_set_up_numbers_of_functions_for_vectorization_and_projections_to_reals

warning, this function can be only called after filling in the intervals vector.

src/Persistence_representations/include/gudhi/Persistence_vectors.h:376

↓ 2 callersFunction_sliced_wasserstein_distance

This is a function for computing the sliced Wasserstein distance from two persistence diagrams. The Sliced Wasserstein distance is computed by pr

src/python/gudhi/representations/metrics.py:29

↓ 2 callersFunction_test_filtered_rips_from_distance_matrix

(distance_matrix)

src/python/test/test_rips_complex.py:150

↓ 2 callersFunction_test_filtered_rips_from_points

src/python/test/test_rips_complex.py:67

↓ 2 callersFunction_test_rips_from_distance_matrix

(distance_matrix)

src/python/test/test_rips_complex.py:104

↓ 2 callersFunction_test_rips_from_points

src/python/test/test_rips_complex.py:23

↓ 2 callersFunction_test_sparse_filtered_rips_from_points

src/python/test/test_rips_complex.py:85

↓ 2 callersFunction_to_set

src/python/test/test_wasserstein_distance.py:155

↓ 2 callersMethod_transform

Guts of transform method.

src/python/gudhi/point_cloud/timedelay.py:71

↓ 2 callersMethodactivate

src/Skeleton_blocker/include/gudhi/Skeleton_blocker/Skeleton_blocker_simple_traits.h:101

↓ 2 callersMethodadd_edge_without_blockers

* Add an edge (v1_root,v2_root) to the sub-complex. * It assumes that both vertices corresponding to v1_root and v2_root are present * in the su

src/Skeleton_blocker/include/gudhi/Skeleton_blocker/Skeleton_blocker_sub_complex.h:100

↓ 2 callersMethodadd_simplex

If perform_checks = true, the function: - won't insert the simplex if it is already in a higher dim simplex - will erase any lower-dim simplices that

src/Tangential_complex/include/gudhi/Tangential_complex/Simplicial_complex.h:47

↓ 2 callersMethodadd_vertex

* Add a vertex 'global' of K to L. When added to L, this vertex will receive * another number, addresses(global), its local address. * return th

src/Skeleton_blocker/include/gudhi/Skeleton_blocker/Skeleton_blocker_sub_complex.h:84

↓ 2 callersMethodall_cells

Array with the filtration values of all the cells of the complex. Modifying the values is strongly discouraged. :returns: numpy.ndar

src/python/gudhi/cubical_complex.py:111

↓ 2 callersMethodall_near_neighbors

src/Spatial_searching/include/gudhi/Kd_tree_search.h:338

↓ 2 callersFunctionarctan

src/python/example/diagram_vectorizations_distances_kernels.py:108

↓ 2 callersMethodbarycenter

\brief Returns the Cartesian coordinates of the barycenter of a given simplex. * \details Using the additional parameter scale, the search can be d

src/Coxeter_triangulation/include/gudhi/Freudenthal_triangulation.h:198

↓ 2 callersMethodbegin

src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex_base.h:528

↓ 2 callersMethodbegin

src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex_periodic_boundary_conditions_base.h:254

↓ 2 callersFunctionblocker_range

src/Skeleton_blocker/test/test_skeleton_blocker_complex.cpp:314

↓ 2 callersMethodblockers_to_string

src/Skeleton_blocker/include/gudhi/Skeleton_blocker_complex.h:1555

↓ 2 callersMethodbottleneck_alive

src/Bottleneck_distance/include/gudhi/Persistence_graph.h:152

↓ 2 callersFunctionbuild_mesh_from_cell_complex

src/Coxeter_triangulation/include/gudhi/IO/build_mesh_from_cell_complex.h:122

↓ 2 callersFunctionbuild_point_cloud

src/Simplex_tree/test/simplex_tree_edge_expansion_unit_test.cpp:47

↓ 2 callersFunctionbuild_rips

src/Contraction/example/Rips_contraction.cpp:29

↓ 2 callersMethodcall

Compute persistence diagram associated to a cubical complex filtered by some pixel values Parameters: X (TensorFlow vari

src/python/gudhi/tensorflow/cubical_layer.py:78

↓ 2 callersMethodcamera

src/GudhUI/view/Viewer_instructor.cpp:60

↓ 2 callersFunctioncmp_rips

src/python/test/test_sklearn_rips_persistence.py:104

↓ 2 callersMethodcoboundary_range

* boundary_simplex_range creates an object of a Boundary_simplex_range class * that provides ranges for the Boundary_simplex_iterator. **/

src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex_base.h:309

↓ 2 callersMethodcod_d

\brief Codimension of the implicit manifold. */

src/Coxeter_triangulation/include/gudhi/Implicit_manifold_intersection_oracle.h:124

↓ 2 callersMethodcod_d

\brief Returns the codomain dimension. */

src/Coxeter_triangulation/include/gudhi/Functions/Cartesian_product.h:112

↓ 2 callersFunctioncolumn_test_base_z2_operators

src/Persistence_matrix/test/pm_column_tests.h:819

↓ 2 callersFunctioncolumn_test_base_z5_operators

src/Persistence_matrix/test/pm_column_tests.h:699

↓ 2 callersFunctioncolumn_test_boundary_z2_operators

src/Persistence_matrix/test/pm_column_tests.h:969

↓ 2 callersFunctioncolumn_test_boundary_z5_operators

src/Persistence_matrix/test/pm_column_tests.h:912

↓ 2 callersMethodcompute_integral_of_a_level_of_a_landscape

src/Persistence_representations/include/gudhi/Persistence_landscape.h:1067

↓ 2 callersMethodcompute_mean

src/Persistence_representations/include/gudhi/Persistence_heat_maps.h:808

↓ 2 callersMethodcompute_median

src/Persistence_representations/include/gudhi/Persistence_heat_maps.h:787

↓ 2 callersMethodcompute_persistence

This function computes the persistence of the complex, so it can be accessed through :func:`persistent_betti_numbers`, :func:`persiste

src/python/gudhi/periodic_cubical_complex.py:149

↓ 2 callersFunctioncompute_proximity_graph

src/common/include/gudhi/graph_simplicial_complex.h:62

↓ 2 callersFunctioncompute_tangent_space

src/Tangential_complex/include/gudhi/Tangential_complex.h:1209

↓ 2 callersMethodconstruct_complex_based_on_top_dimensional_cells

src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex_periodic_boundary_conditions_base.h:309

↓ 2 callersMethodconstruct_complex_based_on_vertices

src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex_periodic_boundary_conditions_base.h:324

↓ 2 callersMethodcontract_edge

src/Skeleton_blocker/include/gudhi/Skeleton_blocker_simplifiable_complex.h:339

↓ 2 callersMethodcontract_edges

* \brief Contract edges. * * While the heap is not empty, it extracts the edge with the minimum * cost in the heap then try to contract it.

src/Contraction/include/gudhi/Skeleton_blocker_contractor.h:334

↓ 2 callersMethodconvert_handle_from_another_complex

* @brief Convert an address of a vertex of a complex to the address in * the current complex. * @details * If the current complex is a sub (o

src/Skeleton_blocker/include/gudhi/Skeleton_blocker_complex.h:458

↓ 2 callersMethodcorresponding_point_in_u

src/Bottleneck_distance/include/gudhi/Persistence_graph.h:130

↓ 2 callersMethodcreate_simplex_tree

:param max_alpha_square: The maximum relaxation parameter. Default is set to infinity. :type max_alpha_square: float

src/python/gudhi/witness_complex.py:38

↓ 2 callersMethodcreate_simplex_tree

:param max_alpha_square: The maximum alpha square threshold the simplices shall not exceed. Default is set to infinity. :

src/python/gudhi/euclidean_witness_complex.py:39

↓ 2 callersMethodcumulative_characteristic_function_of_diagram

src/Persistence_representations/include/gudhi/Persistence_intervals.h:441

↓ 2 callersMethodcumulative_histogram_of_lengths

src/Persistence_representations/include/gudhi/Persistence_intervals.h:378

↓ 2 callersMethoddeath

src/Zigzag_persistence/test/test_zigzag_persistence.cpp:27

↓ 2 callersMethoddimension

\brief Dimension of the simplex. */

src/Coxeter_triangulation/include/gudhi/Permutahedral_representation.h:65

↓ 2 callersMethoddisplay_stats

src/Tangential_complex/include/gudhi/Tangential_complex/Simplicial_complex.h:192

↓ 2 callersMethodend

src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex_base.h:530

↓ 2 callersMethodendpoints

Returns the two Simplex_handle corresponding to the endpoints of * and edge. sh must point to a 1-dimensional simplex. This is an * optimized ve

src/Simplex_tree/include/gudhi/Simplex_tree.h:1432

↓ 2 callersMethoderase_empty_row

src/Persistence_matrix/include/gudhi/Matrix.h:1852

↓ 2 callersMethodfilt

src/Persistent_cohomology/include/gudhi/Persistence_on_rectangle.h:164

↓ 2 callersFunctionfind_edge_in_list

src/Collapse/test/collapse_unit_test.cpp:39

↓ 2 callersFunctionfind_zero_of_a_line_segment_between_those_two_points

landscapes * This procedure, given two points which lies on the opposite sides of the \f$ x \f$-axis, computes the value of * \f$ x \f$ for which the

src/Persistence_representations/include/gudhi/common_persistence_representations.h:134

↓ 2 callersMethodfit

Args: X (numpy.array): coordinates for mass points.

src/python/gudhi/point_cloud/dtm.py:131

↓ 2 callersMethodfit_predict

src/python/gudhi/cover_complex.py:325

↓ 2 callersMethodfit_predict

Equivalent to fit(), and returns the `labels_`.

src/python/gudhi/clustering/tomato.py:287

↓ 2 callersMethodget_addresses

src/Skeleton_blocker/include/gudhi/Skeleton_blocker/Skeleton_blocker_sub_complex.h:188

↓ 2 callersFunctionget_boundaries

src/Zigzag_persistence/test/test_zigzag_persistence.cpp:56

↓ 2 callersMethodget_dimension

src/GudhUI/utils/Lloyd_builder.h:48

↓ 2 callersMethodget_filtration_value_from_index

* @brief Returns the filtration value \f$f(idx)\f$ associated to the index \f$idx\f$ returned * by @ref get_index_persistence_diagram. * * @

src/Zigzag_persistence/include/gudhi/filtered_zigzag_persistence.h:266

↓ 2 callersMethodget_float_relative_precision

src/python/gudhi/_delaunay_complex.cc:126

↓ 2 callersMethodget_max_vertex

We could get `n` from B and avoid passing it as argument

src/Ripser/include/gudhi/ripser.h:488

↓ 2 callersFunctionget_persistence_intervals

src/Collapse/example/edge_collapse_conserve_persistence.cpp:54

↓ 2 callersMethodget_pivot

src/Persistence_matrix/include/gudhi/Persistence_matrix/columns/set_column.h:548

↓ 2 callersMethodget_row_index

src/Persistence_matrix/include/gudhi/Matrix.h:249

↓ 2 callersFunctionget_serialization_size_of

src/Simplex_tree/include/gudhi/Simplex_tree/filtration_value_utils.h:149

↓ 2 callersMethodget_top_dimensional_coface_of_a_cell

src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex_base.h:715

↓ 2 callersMethodget_v_point

src/Bottleneck_distance/include/gudhi/Persistence_graph.h:180

↓ 2 callersMethodget_vertex_of_a_cell

src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex_base.h:728

↓ 2 callersFunctionhera_wrap

src/python/test/test_wasserstein_distance.py:279

↓ 2 callersMethodincremental_furthest_neighbors

\brief Search incrementally for the furthest neighbors from a query point. @param[in] p The query point. @param[in] eps Approximation factor. @return

src/Spatial_searching/include/gudhi/Kd_tree_search.h:317

↓ 2 callersMethodinit

src/Persistent_cohomology/include/gudhi/Persistent_cohomology/Field_Zp.h:36

↓ 2 callersMethodinsert_column

src/Persistence_matrix/include/gudhi/Persistence_matrix/Base_matrix.h:429

↓ 2 callersMethodinsert_simplex

src/Toplex_map/benchmark/benchmark_tm.cpp:29

↓ 2 callersMethodintersects_boundary

src/Coxeter_triangulation/include/gudhi/Implicit_manifold_intersection_oracle.h:176

↓ 2 callersMethodintrinsic_dimension

* \brief Returns the dimension of the cell complex. */

src/Coxeter_triangulation/include/gudhi/Coxeter_triangulation/Cell_complex/Cell_complex.h:269

↓ 2 callersMethodinverse

Returns the inverse in the field. Modifies P. ??? */

src/Persistent_cohomology/include/gudhi/Persistent_cohomology/Field_Zp.h:92

↓ 2 callersMethodis_active

src/Skeleton_blocker/include/gudhi/Skeleton_blocker/iterators/Skeleton_blockers_vertices_iterators.h:89

↓ 2 callersMethodis_finished

src/Skeleton_blocker/include/gudhi/Skeleton_blocker/iterators/Skeleton_blockers_triangles_iterators.h:203

↓ 2 callersMethodis_popable_blocker

src/Skeleton_blocker/include/gudhi/Skeleton_blocker_simplifiable_complex.h:33

↓ 2 callersFunctionis_positive_infinity

src/Simplex_tree/include/gudhi/Simplex_tree/filtration_value_utils.h:43

↓ 2 callersFunctionis_prime

src/Ripser/include/gudhi/ripser.h:158

↓ 2 callersMethodk_furthest_neighbors

\brief Search for the k-furthest points from a query point. @param[in] p The query point. @param[in] k Number of furthest points to search. @param[in]

src/Spatial_searching/include/gudhi/Kd_tree_search.h:291

↓ 2 callersMethodlies_in_domain

src/Coxeter_triangulation/include/gudhi/Implicit_manifold_intersection_oracle.h:194

↓ 2 callersFunctionmake_2d_epeck_complex_ptr

src/python/gudhi/_delaunay_complex_2d.cc:35

↓ 2 callersFunctionmake_2d_epick_complex_ptr

src/python/gudhi/_delaunay_complex_2d.cc:27

↓ 2 callersFunctionmake_3d_epeck_complex_ptr

src/python/gudhi/_delaunay_complex_3d.cc:35

↓ 2 callersFunctionmake_3d_epick_complex_ptr

src/python/gudhi/_delaunay_complex_3d.cc:27

↓ 2 callersFunctionmake_dynamic_d_epeck_complex_ptr

src/python/gudhi/_delaunay_complex_dyn.cc:35

↓ 2 callersFunctionmake_dynamic_d_epick_complex_ptr

src/python/gudhi/_delaunay_complex_dyn.cc:27

↓ 2 callersFunctionmake_linear_transformation

src/Coxeter_triangulation/include/gudhi/Functions/Linear_transformation.h:80

↓ 2 callersFunctionmake_product_function

src/Coxeter_triangulation/include/gudhi/Functions/Cartesian_product.h:149

↓ 2 callersMethodmanifold_tracing_algorithm

src/Coxeter_triangulation/include/gudhi/Manifold_tracing.h:80

← previous next →701–800 of 4,084, ranked by callers