From 0df3c9bcca4345b8be27ca2fd90eb5137072740c Mon Sep 17 00:00:00 2001 From: vrouvrea Date: Thu, 15 Dec 2016 20:50:56 +0000 Subject: New pairs in dimension function in Persistence cohomology git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/trunk@1887 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 76bc9a951d752a6ca0f62244012965b5b6597a17 --- .../test/betti_numbers_unit_test.cpp | 57 ++++++++++++++++++++++ 1 file changed, 57 insertions(+) (limited to 'src/Persistent_cohomology/test') diff --git a/src/Persistent_cohomology/test/betti_numbers_unit_test.cpp b/src/Persistent_cohomology/test/betti_numbers_unit_test.cpp index 40221005..67dfcce4 100644 --- a/src/Persistent_cohomology/test/betti_numbers_unit_test.cpp +++ b/src/Persistent_cohomology/test/betti_numbers_unit_test.cpp @@ -84,6 +84,8 @@ BOOST_AUTO_TEST_CASE( plain_homology_betti_numbers ) // 2 1 0 inf // means that in Z/2Z-homology, the Betti numbers are b0=2 and b1=1. + std::cout << "BETTI NUMBERS" << std::endl; + BOOST_CHECK(pcoh.betti_number(0) == 2); BOOST_CHECK(pcoh.betti_number(1) == 1); BOOST_CHECK(pcoh.betti_number(2) == 0); @@ -93,6 +95,8 @@ BOOST_AUTO_TEST_CASE( plain_homology_betti_numbers ) BOOST_CHECK(bns[0] == 2); BOOST_CHECK(bns[1] == 1); BOOST_CHECK(bns[2] == 0); + + std::cout << "GET PERSISTENT PAIRS" << std::endl; // Custom sort and output persistence cmp_intervals_by_dim_then_length cmp(&st); @@ -115,6 +119,33 @@ BOOST_AUTO_TEST_CASE( plain_homology_betti_numbers ) BOOST_CHECK(st.dimension(get<0>(persistent_pairs[2])) == 0); BOOST_CHECK(st.filtration(get<0>(persistent_pairs[2])) == 0); BOOST_CHECK(get<1>(persistent_pairs[2]) == st.null_simplex()); + + std::cout << "PAIRS IN DIMENSION" << std::endl; + + auto pairs_in_dimension_0 = pcoh.pairs_in_dimension(0); + std::cout << "pairs_in_dimension_0.size() = " << pairs_in_dimension_0.size() << std::endl; + for (int i = 0; i < pairs_in_dimension_0.size(); i++) + std::cout << "pairs_in_dimension_0[" << i << "] = [" << pairs_in_dimension_0[i].first << "," << + pairs_in_dimension_0[i].second << "]" << std::endl; + BOOST_CHECK(pairs_in_dimension_0.size() == 2); + BOOST_CHECK(pairs_in_dimension_0[0].first == 0); + BOOST_CHECK(pairs_in_dimension_0[0].second == std::numeric_limits::infinity()); + BOOST_CHECK(pairs_in_dimension_0[1].first == 0); + BOOST_CHECK(pairs_in_dimension_0[1].second == std::numeric_limits::infinity()); + + + auto pairs_in_dimension_1 = pcoh.pairs_in_dimension(1); + std::cout << "pairs_in_dimension_1.size() = " << pairs_in_dimension_1.size() << std::endl; + for (int i = 0; i < pairs_in_dimension_1.size(); i++) + std::cout << "pairs_in_dimension_1[" << i << "] = [" << pairs_in_dimension_1[i].first << "," << + pairs_in_dimension_1[i].second << "]" << std::endl; + BOOST_CHECK(pairs_in_dimension_1.size() == 1); + BOOST_CHECK(pairs_in_dimension_1[0].first == 0); + BOOST_CHECK(pairs_in_dimension_1[0].second == std::numeric_limits::infinity()); + + auto pairs_in_dimension_2 = pcoh.pairs_in_dimension(2); + std::cout << "pairs_in_dimension_2.size() = " << pairs_in_dimension_2.size() << std::endl; + BOOST_CHECK(pairs_in_dimension_2.size() == 0); } using Simplex_tree = Gudhi::Simplex_tree<>; @@ -231,4 +262,30 @@ BOOST_AUTO_TEST_CASE( betti_numbers ) BOOST_CHECK(st.dimension(get<0>(persistent_pairs[2])) == 0); BOOST_CHECK(st.filtration(get<0>(persistent_pairs[2])) == 1); BOOST_CHECK(get<1>(persistent_pairs[2]) == st.null_simplex()); + + std::cout << "PAIRS IN DIMENSION" << std::endl; + + auto pairs_in_dimension_0 = pcoh.pairs_in_dimension(0); + std::cout << "pairs_in_dimension_0.size() = " << pairs_in_dimension_0.size() << std::endl; + for (int i = 0; i < pairs_in_dimension_0.size(); i++) + std::cout << "pairs_in_dimension_0[" << i << "] = [" << pairs_in_dimension_0[i].first << "," << + pairs_in_dimension_0[i].second << "]" << std::endl; + BOOST_CHECK(pairs_in_dimension_0.size() == 2); + BOOST_CHECK(pairs_in_dimension_0[0].first == 2); + BOOST_CHECK(pairs_in_dimension_0[0].second == std::numeric_limits::infinity()); + BOOST_CHECK(pairs_in_dimension_0[1].first == 1); + BOOST_CHECK(pairs_in_dimension_0[1].second == std::numeric_limits::infinity()); + + auto pairs_in_dimension_1 = pcoh.pairs_in_dimension(1); + std::cout << "pairs_in_dimension_1.size() = " << pairs_in_dimension_1.size() << std::endl; + for (int i = 0; i < pairs_in_dimension_1.size(); i++) + std::cout << "pairs_in_dimension_1[" << i << "] = [" << pairs_in_dimension_1[i].first << "," << + pairs_in_dimension_1[i].second << "]" << std::endl; + BOOST_CHECK(pairs_in_dimension_1.size() == 1); + BOOST_CHECK(pairs_in_dimension_1[0].first == 4); + BOOST_CHECK(pairs_in_dimension_1[0].second == std::numeric_limits::infinity()); + + auto pairs_in_dimension_2 = pcoh.pairs_in_dimension(2); + std::cout << "pairs_in_dimension_2.size() = " << pairs_in_dimension_2.size() << std::endl; + BOOST_CHECK(pairs_in_dimension_2.size() == 0); } -- cgit v1.2.3 From 251d5726f17275b0af8333440b21476751925e1b Mon Sep 17 00:00:00 2001 From: vrouvrea Date: Thu, 15 Dec 2016 22:53:16 +0000 Subject: Fix after code review git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/trunk@1889 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 9ec3dcd290042159c313a83be3a3e8fb7bafa6e8 --- .../include/gudhi/Persistent_cohomology.h | 10 +- .../test/betti_numbers_unit_test.cpp | 102 ++++++++++----------- 2 files changed, 56 insertions(+), 56 deletions(-) (limited to 'src/Persistent_cohomology/test') diff --git a/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h b/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h index d3a8acc0..c3a1535a 100644 --- a/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h +++ b/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h @@ -690,17 +690,17 @@ class Persistent_cohomology { return persistent_pairs_; } - /** @brief Returns persistence pairs for a given dimension. + /** @brief Returns persistence intervals for a given dimension. * @param[in] dimension Dimension to get the birth and death pairs from. * @return A vector of persistence intervals (birth and death) on a fixed dimension. */ std::vector< std::pair< Filtration_value , Filtration_value > > - pairs_in_dimension( unsigned dimension ) { + intervals_in_dimension(int dimension) { std::vector< std::pair< Filtration_value , Filtration_value > > result; - for (auto pair : persistent_pairs_) { + // auto && pair, to avoid unnecessary copying + for (auto && pair : persistent_pairs_) { if (cpx_->dimension( get<0>(pair)) == dimension ) { - result.push_back(std::pair(cpx_->filtration(get<0>(pair)), - cpx_->filtration(get<1>(pair)))); + result.emplace_back(cpx_->filtration(get<0>(pair)), cpx_->filtration(get<1>(pair))); } } return result; diff --git a/src/Persistent_cohomology/test/betti_numbers_unit_test.cpp b/src/Persistent_cohomology/test/betti_numbers_unit_test.cpp index 67dfcce4..b98a3765 100644 --- a/src/Persistent_cohomology/test/betti_numbers_unit_test.cpp +++ b/src/Persistent_cohomology/test/betti_numbers_unit_test.cpp @@ -120,32 +120,32 @@ BOOST_AUTO_TEST_CASE( plain_homology_betti_numbers ) BOOST_CHECK(st.filtration(get<0>(persistent_pairs[2])) == 0); BOOST_CHECK(get<1>(persistent_pairs[2]) == st.null_simplex()); - std::cout << "PAIRS IN DIMENSION" << std::endl; - - auto pairs_in_dimension_0 = pcoh.pairs_in_dimension(0); - std::cout << "pairs_in_dimension_0.size() = " << pairs_in_dimension_0.size() << std::endl; - for (int i = 0; i < pairs_in_dimension_0.size(); i++) - std::cout << "pairs_in_dimension_0[" << i << "] = [" << pairs_in_dimension_0[i].first << "," << - pairs_in_dimension_0[i].second << "]" << std::endl; - BOOST_CHECK(pairs_in_dimension_0.size() == 2); - BOOST_CHECK(pairs_in_dimension_0[0].first == 0); - BOOST_CHECK(pairs_in_dimension_0[0].second == std::numeric_limits::infinity()); - BOOST_CHECK(pairs_in_dimension_0[1].first == 0); - BOOST_CHECK(pairs_in_dimension_0[1].second == std::numeric_limits::infinity()); - - - auto pairs_in_dimension_1 = pcoh.pairs_in_dimension(1); - std::cout << "pairs_in_dimension_1.size() = " << pairs_in_dimension_1.size() << std::endl; - for (int i = 0; i < pairs_in_dimension_1.size(); i++) - std::cout << "pairs_in_dimension_1[" << i << "] = [" << pairs_in_dimension_1[i].first << "," << - pairs_in_dimension_1[i].second << "]" << std::endl; - BOOST_CHECK(pairs_in_dimension_1.size() == 1); - BOOST_CHECK(pairs_in_dimension_1[0].first == 0); - BOOST_CHECK(pairs_in_dimension_1[0].second == std::numeric_limits::infinity()); - - auto pairs_in_dimension_2 = pcoh.pairs_in_dimension(2); - std::cout << "pairs_in_dimension_2.size() = " << pairs_in_dimension_2.size() << std::endl; - BOOST_CHECK(pairs_in_dimension_2.size() == 0); + std::cout << "INTERVALS IN DIMENSION" << std::endl; + + auto intervals_in_dimension_0 = pcoh.intervals_in_dimension(0); + std::cout << "intervals_in_dimension_0.size() = " << intervals_in_dimension_0.size() << std::endl; + for (int i = 0; i < intervals_in_dimension_0.size(); i++) + std::cout << "intervals_in_dimension_0[" << i << "] = [" << intervals_in_dimension_0[i].first << "," << + intervals_in_dimension_0[i].second << "]" << std::endl; + BOOST_CHECK(intervals_in_dimension_0.size() == 2); + BOOST_CHECK(intervals_in_dimension_0[0].first == 0); + BOOST_CHECK(intervals_in_dimension_0[0].second == std::numeric_limits::infinity()); + BOOST_CHECK(intervals_in_dimension_0[1].first == 0); + BOOST_CHECK(intervals_in_dimension_0[1].second == std::numeric_limits::infinity()); + + + auto intervals_in_dimension_1 = pcoh.intervals_in_dimension(1); + std::cout << "intervals_in_dimension_1.size() = " << intervals_in_dimension_1.size() << std::endl; + for (int i = 0; i < intervals_in_dimension_1.size(); i++) + std::cout << "intervals_in_dimension_1[" << i << "] = [" << intervals_in_dimension_1[i].first << "," << + intervals_in_dimension_1[i].second << "]" << std::endl; + BOOST_CHECK(intervals_in_dimension_1.size() == 1); + BOOST_CHECK(intervals_in_dimension_1[0].first == 0); + BOOST_CHECK(intervals_in_dimension_1[0].second == std::numeric_limits::infinity()); + + auto intervals_in_dimension_2 = pcoh.intervals_in_dimension(2); + std::cout << "intervals_in_dimension_2.size() = " << intervals_in_dimension_2.size() << std::endl; + BOOST_CHECK(intervals_in_dimension_2.size() == 0); } using Simplex_tree = Gudhi::Simplex_tree<>; @@ -263,29 +263,29 @@ BOOST_AUTO_TEST_CASE( betti_numbers ) BOOST_CHECK(st.filtration(get<0>(persistent_pairs[2])) == 1); BOOST_CHECK(get<1>(persistent_pairs[2]) == st.null_simplex()); - std::cout << "PAIRS IN DIMENSION" << std::endl; - - auto pairs_in_dimension_0 = pcoh.pairs_in_dimension(0); - std::cout << "pairs_in_dimension_0.size() = " << pairs_in_dimension_0.size() << std::endl; - for (int i = 0; i < pairs_in_dimension_0.size(); i++) - std::cout << "pairs_in_dimension_0[" << i << "] = [" << pairs_in_dimension_0[i].first << "," << - pairs_in_dimension_0[i].second << "]" << std::endl; - BOOST_CHECK(pairs_in_dimension_0.size() == 2); - BOOST_CHECK(pairs_in_dimension_0[0].first == 2); - BOOST_CHECK(pairs_in_dimension_0[0].second == std::numeric_limits::infinity()); - BOOST_CHECK(pairs_in_dimension_0[1].first == 1); - BOOST_CHECK(pairs_in_dimension_0[1].second == std::numeric_limits::infinity()); - - auto pairs_in_dimension_1 = pcoh.pairs_in_dimension(1); - std::cout << "pairs_in_dimension_1.size() = " << pairs_in_dimension_1.size() << std::endl; - for (int i = 0; i < pairs_in_dimension_1.size(); i++) - std::cout << "pairs_in_dimension_1[" << i << "] = [" << pairs_in_dimension_1[i].first << "," << - pairs_in_dimension_1[i].second << "]" << std::endl; - BOOST_CHECK(pairs_in_dimension_1.size() == 1); - BOOST_CHECK(pairs_in_dimension_1[0].first == 4); - BOOST_CHECK(pairs_in_dimension_1[0].second == std::numeric_limits::infinity()); - - auto pairs_in_dimension_2 = pcoh.pairs_in_dimension(2); - std::cout << "pairs_in_dimension_2.size() = " << pairs_in_dimension_2.size() << std::endl; - BOOST_CHECK(pairs_in_dimension_2.size() == 0); + std::cout << "INTERVALS IN DIMENSION" << std::endl; + + auto intervals_in_dimension_0 = pcoh.intervals_in_dimension(0); + std::cout << "intervals_in_dimension_0.size() = " << intervals_in_dimension_0.size() << std::endl; + for (int i = 0; i < intervals_in_dimension_0.size(); i++) + std::cout << "intervals_in_dimension_0[" << i << "] = [" << intervals_in_dimension_0[i].first << "," << + intervals_in_dimension_0[i].second << "]" << std::endl; + BOOST_CHECK(intervals_in_dimension_0.size() == 2); + BOOST_CHECK(intervals_in_dimension_0[0].first == 2); + BOOST_CHECK(intervals_in_dimension_0[0].second == std::numeric_limits::infinity()); + BOOST_CHECK(intervals_in_dimension_0[1].first == 1); + BOOST_CHECK(intervals_in_dimension_0[1].second == std::numeric_limits::infinity()); + + auto intervals_in_dimension_1 = pcoh.intervals_in_dimension(1); + std::cout << "intervals_in_dimension_1.size() = " << intervals_in_dimension_1.size() << std::endl; + for (int i = 0; i < intervals_in_dimension_1.size(); i++) + std::cout << "intervals_in_dimension_1[" << i << "] = [" << intervals_in_dimension_1[i].first << "," << + intervals_in_dimension_1[i].second << "]" << std::endl; + BOOST_CHECK(intervals_in_dimension_1.size() == 1); + BOOST_CHECK(intervals_in_dimension_1[0].first == 4); + BOOST_CHECK(intervals_in_dimension_1[0].second == std::numeric_limits::infinity()); + + auto intervals_in_dimension_2 = pcoh.intervals_in_dimension(2); + std::cout << "intervals_in_dimension_2.size() = " << intervals_in_dimension_2.size() << std::endl; + BOOST_CHECK(intervals_in_dimension_2.size() == 0); } -- cgit v1.2.3 From c8dbfc68cca3c5462226e5d953f721143fc645f0 Mon Sep 17 00:00:00 2001 From: vrouvrea Date: Fri, 16 Dec 2016 14:07:02 +0000 Subject: Fix cpplint and warnings git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/trunk@1902 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 24c5aacf579eb1ceb35c680770d5168524c4c84b --- .../include/gudhi/Persistent_cohomology.h | 3 +- .../test/betti_numbers_unit_test.cpp | 8 ++--- src/Subsampling/example/example_custom_kernel.cpp | 38 +++++++++------------- src/Subsampling/include/gudhi/sparsify_point_set.h | 2 -- src/common/include/gudhi/random_point_generators.h | 2 -- 5 files changed, 22 insertions(+), 31 deletions(-) (limited to 'src/Persistent_cohomology/test') diff --git a/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h b/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h index c3a1535a..681de8c6 100644 --- a/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h +++ b/src/Persistent_cohomology/include/gudhi/Persistent_cohomology.h @@ -699,12 +699,13 @@ class Persistent_cohomology { std::vector< std::pair< Filtration_value , Filtration_value > > result; // auto && pair, to avoid unnecessary copying for (auto && pair : persistent_pairs_) { - if (cpx_->dimension( get<0>(pair)) == dimension ) { + if (cpx_->dimension(get<0>(pair)) == dimension) { result.emplace_back(cpx_->filtration(get<0>(pair)), cpx_->filtration(get<1>(pair))); } } return result; } + private: /* * Structure representing a cocycle. diff --git a/src/Persistent_cohomology/test/betti_numbers_unit_test.cpp b/src/Persistent_cohomology/test/betti_numbers_unit_test.cpp index b98a3765..0ed3fddf 100644 --- a/src/Persistent_cohomology/test/betti_numbers_unit_test.cpp +++ b/src/Persistent_cohomology/test/betti_numbers_unit_test.cpp @@ -124,7 +124,7 @@ BOOST_AUTO_TEST_CASE( plain_homology_betti_numbers ) auto intervals_in_dimension_0 = pcoh.intervals_in_dimension(0); std::cout << "intervals_in_dimension_0.size() = " << intervals_in_dimension_0.size() << std::endl; - for (int i = 0; i < intervals_in_dimension_0.size(); i++) + for (std::size_t i = 0; i < intervals_in_dimension_0.size(); i++) std::cout << "intervals_in_dimension_0[" << i << "] = [" << intervals_in_dimension_0[i].first << "," << intervals_in_dimension_0[i].second << "]" << std::endl; BOOST_CHECK(intervals_in_dimension_0.size() == 2); @@ -136,7 +136,7 @@ BOOST_AUTO_TEST_CASE( plain_homology_betti_numbers ) auto intervals_in_dimension_1 = pcoh.intervals_in_dimension(1); std::cout << "intervals_in_dimension_1.size() = " << intervals_in_dimension_1.size() << std::endl; - for (int i = 0; i < intervals_in_dimension_1.size(); i++) + for (std::size_t i = 0; i < intervals_in_dimension_1.size(); i++) std::cout << "intervals_in_dimension_1[" << i << "] = [" << intervals_in_dimension_1[i].first << "," << intervals_in_dimension_1[i].second << "]" << std::endl; BOOST_CHECK(intervals_in_dimension_1.size() == 1); @@ -267,7 +267,7 @@ BOOST_AUTO_TEST_CASE( betti_numbers ) auto intervals_in_dimension_0 = pcoh.intervals_in_dimension(0); std::cout << "intervals_in_dimension_0.size() = " << intervals_in_dimension_0.size() << std::endl; - for (int i = 0; i < intervals_in_dimension_0.size(); i++) + for (std::size_t i = 0; i < intervals_in_dimension_0.size(); i++) std::cout << "intervals_in_dimension_0[" << i << "] = [" << intervals_in_dimension_0[i].first << "," << intervals_in_dimension_0[i].second << "]" << std::endl; BOOST_CHECK(intervals_in_dimension_0.size() == 2); @@ -278,7 +278,7 @@ BOOST_AUTO_TEST_CASE( betti_numbers ) auto intervals_in_dimension_1 = pcoh.intervals_in_dimension(1); std::cout << "intervals_in_dimension_1.size() = " << intervals_in_dimension_1.size() << std::endl; - for (int i = 0; i < intervals_in_dimension_1.size(); i++) + for (std::size_t i = 0; i < intervals_in_dimension_1.size(); i++) std::cout << "intervals_in_dimension_1[" << i << "] = [" << intervals_in_dimension_1[i].first << "," << intervals_in_dimension_1[i].second << "]" << std::endl; BOOST_CHECK(intervals_in_dimension_1.size() == 1); diff --git a/src/Subsampling/example/example_custom_kernel.cpp b/src/Subsampling/example/example_custom_kernel.cpp index 05797ebe..f87ef0b3 100644 --- a/src/Subsampling/example/example_custom_kernel.cpp +++ b/src/Subsampling/example/example_custom_kernel.cpp @@ -7,7 +7,7 @@ #include -/* The class Kernel contains a distance function defined on the set of points {0,1,2,3} +/* The class Kernel contains a distance function defined on the set of points {0, 1, 2, 3} * and computes a distance according to the matrix: * 0 1 2 4 * 1 0 4 2 @@ -15,41 +15,35 @@ * 4 2 1 0 */ class Kernel { -public: + public: typedef double FT; typedef unsigned Point_d; // Class Squared_distance_d class Squared_distance_d { - private: + private: std::vector> matrix_; - - public: - Squared_distance_d() - { - matrix_.push_back(std::vector({0,1,2,4})); - matrix_.push_back(std::vector({1,0,4,2})); - matrix_.push_back(std::vector({2,4,0,1})); - matrix_.push_back(std::vector({4,2,1,0})); - } - - FT operator()(Point_d p1, Point_d p2) - { + public: + Squared_distance_d() { + matrix_.push_back(std::vector({0,1,2,4})); + matrix_.push_back(std::vector({1,0,4,2})); + matrix_.push_back(std::vector({2,4,0,1})); + matrix_.push_back(std::vector({4,2,1,0})); + } + + FT operator()(Point_d p1, Point_d p2) { return matrix_[p1][p2]; } }; // Constructor - Kernel() - {} + Kernel() {} // Object of type Squared_distance_d - Squared_distance_d squared_distance_d_object() const - { + Squared_distance_d squared_distance_d_object() const { return Squared_distance_d(); } - }; int main(void) { @@ -57,9 +51,9 @@ int main(void) { typedef typename K::Point_d Point_d; K k; - std::vector points = {0,1,2,3}; + std::vector points = {0, 1, 2, 3}; std::vector results; - + Gudhi::subsampling::choose_n_farthest_points(k, points, 2, std::back_inserter(results)); std::cout << "Before sparsification: " << points.size() << " points.\n"; std::cout << "After sparsification: " << results.size() << " points.\n"; diff --git a/src/Subsampling/include/gudhi/sparsify_point_set.h b/src/Subsampling/include/gudhi/sparsify_point_set.h index 7ff11b4c..507f8c79 100644 --- a/src/Subsampling/include/gudhi/sparsify_point_set.h +++ b/src/Subsampling/include/gudhi/sparsify_point_set.h @@ -64,8 +64,6 @@ sparsify_point_set( typedef typename Gudhi::spatial_searching::Kd_tree_search< Kernel, Point_range> Points_ds; - typename Kernel::Squared_distance_d sqdist = k.squared_distance_d_object(); - #ifdef GUDHI_SUBSAMPLING_PROFILING Gudhi::Clock t; #endif diff --git a/src/common/include/gudhi/random_point_generators.h b/src/common/include/gudhi/random_point_generators.h index 3050b7ea..c643a1e3 100644 --- a/src/common/include/gudhi/random_point_generators.h +++ b/src/common/include/gudhi/random_point_generators.h @@ -338,8 +338,6 @@ std::vector generate_points_on_3sphere_and_circle(std: std::vector points; points.reserve(num_points); - typename Kernel::Translated_point_d k_transl = - k.translated_point_d_object(); typename Kernel::Compute_coordinate_d k_coord = k.compute_coordinate_d_object(); for (std::size_t i = 0; i < num_points;) { -- cgit v1.2.3