Constructs strong witness complex for given sets of witnesses and landmarks in Euclidean space. More...
Public Member Functions | |
template<typename LandmarkRange , typename WitnessRange > | |
Euclidean_strong_witness_complex (const LandmarkRange &landmarks, const WitnessRange &witnesses) | |
Initializes member variables before constructing simplicial complex. More... | |
template<typename Vertex_handle > | |
Point_d | get_point (Vertex_handle vertex) const |
Returns the point corresponding to the given vertex. | |
Public Member Functions inherited from Gudhi::witness_complex::Strong_witness_complex< std::vector< Gudhi::spatial_searching::Kd_tree_search< Kernel_, std::vector< Kernel_::Point_d > >::INS_range > > | |
Strong_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, Landmark_id limit_dimension=std::numeric_limits< Landmark_id >::max()) const |
Outputs the strong witness complex of relaxation 'max_alpha_square' in a simplicial complex data structure. More... | |
Constructs strong witness complex for given sets of witnesses and landmarks in Euclidean space.
Kernel_ | requires a CGAL::Epick_d class. |
|
inline |
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.