/* This file is part of the Gudhi Library. The Gudhi library
* (Geometric Understanding in Higher Dimensions) is a generic C++
* library for computational topology.
*
* Author(s): Siargey Kachanovich
*
* Copyright (C) 2016 INRIA Sophia Antipolis-Méditerranée (France)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see .
*/
#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MODULE "simple_witness_complex"
#include
#include
#include
#include
#include
#include
#include
#include
#include
typedef Gudhi::Simplex_tree<> Simplex_tree;
typedef std::vector< Vertex_handle > typeVectorVertex;
typedef CGAL::Epick_d Kernel;
typedef typename Kernel::FT FT;
typedef typename Kernel::Point_d Point_d;
typedef Gudhi::witness_complex::Witness_complex WitnessComplex;
typedef Gudhi::witness_complex::Strong_witness_complex StrongWitnessComplex;
/* All landmarks and witnesses are taken on the grid in the following manner.
LWLWL 2W4W7
WW.WW WW.WW
L...L 1...6
WW.WW WW.WW
LWLWL 0W3W5
Witness complex consists of 8 vertices, 12 edges and 4 triangles
*/
BOOST_AUTO_TEST_CASE(simple_witness_complex) {
Simplex_tree complex, relaxed_complex, strong_relaxed_complex;
std::vector witnesses, landmarks;
landmarks.push_back(Point_d(std::vector{-2,-2}));
landmarks.push_back(Point_d(std::vector{-2, 0}));
landmarks.push_back(Point_d(std::vector{-2, 2}));
landmarks.push_back(Point_d(std::vector{ 0,-2}));
landmarks.push_back(Point_d(std::vector{ 0, 2}));
landmarks.push_back(Point_d(std::vector{ 2,-2}));
landmarks.push_back(Point_d(std::vector{ 2, 0}));
landmarks.push_back(Point_d(std::vector{ 2, 2}));
witnesses.push_back(Point_d(std::vector{-2,-1}));
witnesses.push_back(Point_d(std::vector{-2, 1}));
witnesses.push_back(Point_d(std::vector{-1,-2}));
witnesses.push_back(Point_d(std::vector{-1,-1}));
witnesses.push_back(Point_d(std::vector{-1, 1}));
witnesses.push_back(Point_d(std::vector{-1, 2}));
witnesses.push_back(Point_d(std::vector{ 1,-2}));
witnesses.push_back(Point_d(std::vector{ 1,-1}));
witnesses.push_back(Point_d(std::vector{ 1, 1}));
witnesses.push_back(Point_d(std::vector{ 1, 2}));
witnesses.push_back(Point_d(std::vector{ 2,-1}));
witnesses.push_back(Point_d(std::vector{ 2, 1}));
// landmarks.push_back(Point_d(std::vector{1,0}));
// landmarks.push_back(Point_d(std::vector{0,0}));
// landmarks.push_back(Point_d(std::vector{0,1}));
// witnesses.push_back(Point_d(std::vector{1,0}));
WitnessComplex witness_complex(landmarks.begin(),
landmarks.end(),
witnesses.begin(),
witnesses.end());
// witness_complex.create_complex(complex, 0);
//std::cout << complex << "\n";
// BOOST_CHECK(complex.num_simplices() == 24);
// witness_complex.create_complex(relaxed_complex, 8.01);
// std::cout << "Num_simplices: " << relaxed_complex.num_simplices() << "\n";
// std::cout << relaxed_complex << "\n";
StrongWitnessComplex strong_witness_complex(landmarks.begin(),
landmarks.end(),
witnesses.begin(),
witnesses.end());
strong_witness_complex.create_complex(strong_relaxed_complex, 9.1);
std::cout << "Num_simplices: " << strong_relaxed_complex.num_simplices() << "\n";
std::cout << strong_relaxed_complex << "\n";
//BOOST_CHECK(relaxed_complex.num_simplices() == 24);
//BOOST_CHECK(witnessComplex.is_witness_complex(knn, false));
}