Constructs (weak) witness complex for given sets of witnesses and landmarks in Euclidean space.
More...
|
|
template<typename LandmarkRange , typename WitnessRange > |
| Euclidean_witness_complex (const LandmarkRange &landmarks, const WitnessRange &witnesses) |
| Initializes member variables before constructing simplicial complex. More...
|
|
Point_d | get_point (Vertex_handle vertex) const |
| Returns the point corresponding to the given vertex. More...
|
|
| Witness_complex (std::vector< Gudhi::spatial_searching::Kd_tree_search< Kernel_, std::vector< Kernel_::Point_d > >::INS_range > const &nearest_landmark_table) |
| Initializes member variables before constructing simplicial complex. More...
|
|
bool | create_complex (SimplicialComplexForWitness &complex, double max_alpha_square, std::size_t limit_dimension=std::numeric_limits< std::size_t >::max()) const |
| Outputs the (weak) witness complex of relaxation 'max_alpha_square' in a simplicial complex data structure. More...
|
|
◆ Euclidean_witness_complex()
template<class Kernel_ >
template<typename LandmarkRange , typename WitnessRange >
Initializes member variables before constructing simplicial complex.
Records landmarks from the range 'landmarks' into a table internally, as well as witnesses from the range 'witnesses'. Both ranges should have value_type Kernel_::Point_d.
◆ get_point()
Returns the point corresponding to the given vertex.
- Parameters
-
[in] | vertex | Vertex handle of the point to retrieve. |
The documentation for this class was generated from the following file: