testVoxelComplex.cpp File Reference

#include "DGtal/base/SetFunctions.h"
#include "DGtal/helpers/StdDefs.h"
#include "DGtal/topology/CubicalComplexFunctions.h"
#include "DGtal/topology/CubicalComplex.h"
#include "DGtal/topology/KhalimskyCellHashFunctions.h"
#include "DGtal/topology/VoxelComplex.h"
#include "DGtal/topology/VoxelComplexFunctions.h"
#include "DGtalCatch.h"
#include <iostream>
#include <unordered_map>
#include "DGtal/geometry/volumes/distance/DistanceTransformation.h"
#include "DGtal/geometry/volumes/distance/ExactPredicateLpSeparableMetric.h"
#include "DGtal/geometry/volumes/distance/VoronoiMap.h"
#include "DGtal/images/SimpleThresholdForegroundPredicate.h"
#include "DGtal/kernel/BasicPointPredicates.h"
#include "DGtal/topology/NeighborhoodConfigurations.h"
#include "DGtal/topology/tables/NeighborhoodTables.h"

Include dependency graph for testVoxelComplex.cpp:

Go to the source code of this file.

Data Structures
struct	Fixture_complex_diamond
struct	Fixture_complex_fig4
struct	Fixture_isthmus
struct	Fixture_X

Functions
	TEST_CASE_METHOD (Fixture_complex_diamond, "insertVoxel", "[insert][close]")
	TEST_CASE_METHOD (Fixture_complex_diamond, "Faces of voxel", "[neighborhood][faces]")
	TEST_CASE_METHOD (Fixture_complex_diamond, "Neighbors from Object and KSpace", "[neighborhood]")
	TEST_CASE_METHOD (Fixture_complex_diamond, "Test Simplicity", "[simplicity]")
	TEST_CASE_METHOD (Fixture_complex_diamond, "Test table wrappers", "[table][simple]")
	TEST_CASE_METHOD (Fixture_complex_diamond, "Cliques Masks K_2", "[clique]")
	TEST_CASE_METHOD (Fixture_complex_diamond, "Cliques Masks K_1", "[clique]")
	TEST_CASE_METHOD (Fixture_complex_diamond, "Cliques Masks K_0", "[clique]")
	TEST_CASE_METHOD (Fixture_complex_diamond, "Get All Critical Cliques of diamond", "[critical][clique]")
	TEST_CASE_METHOD (Fixture_complex_fig4, "Get All Critical Cliques of fig4", "[critical][clique]")
	TEST_CASE_METHOD (Fixture_complex_fig4, "zeroSurface and oneSurface", "[isSurface][function]")
	TEST_CASE_METHOD (Fixture_isthmus, "Thin disconnected complex", "[isthmus][thin][function]")
	TEST_CASE_METHOD (Fixture_isthmus, "Check isthmus", "[isthmus][function]")
	TEST_CASE_METHOD (Fixture_isthmus, "Thin complex", "[isthmus][thin][function]")
	TEST_CASE_METHOD (Fixture_isthmus, "Persistence thin", "[persistence][isthmus][thin][function]")
	TEST_CASE_METHOD (Fixture_X, "X Thin", "[x][persistence][isthmus][thin][function]")
	TEST_CASE_METHOD (Fixture_X, "X Thin with Isthmus, and tables", "[x][isthmus][thin][function][table]")
	TEST_CASE_METHOD (Fixture_X, "X DistanceMap", "[x][distance][thin]")
	Use distance map in the Select function.

Detailed Description

This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser 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 http://www.gnu.org/licenses/.

Author

Pablo Hernandez-Cerdan (pablo.nosp@m..her.nosp@m.nande.nosp@m.z.ce.nosp@m.rdan@.nosp@m.outl.nosp@m.ook.c.nosp@m.om) Institute of Fundamental Sciences. Massey University. Palmerston North, New Zealand

Date

2018/01/01

Testing class for VoxelComplex.

This file is part of the DGtal library.

Definition in file testVoxelComplex.cpp.

Function Documentation

TEST_CASE_METHOD() [1/18]

TEST_CASE_METHOD	(	Fixture_complex_diamond	,
		"Cliques Masks K_0"	,
		""	[clique] )

Definition at line 402 of file testVoxelComplex.cpp.

                                                                           {
    auto &vc = complex_fixture;
    auto itc = vc.begin(3);
    for (std::size_t n = 0; n < 10; ++n)
        ++itc;
    auto cell = itc->first;
    Point p_cell = vc.space().uCoords(cell);
 
    SECTION("K_0 mask from a pointel") {
        auto pointel = vc.space().uPointel(p_cell);
        // auto pointel = vc.space().uPointel(Point{0,0,0});
 
        using namespace DGtal::functions;
        auto k0_mask = vc.K_0(pointel, true);
 
        auto &is_critical = k0_mask.first;
        CHECK(is_critical == false);
        auto &k0_clique = k0_mask.second;
        // numer of voxels in clique
        CHECK(k0_clique.nbCells(3) == 1);
    }
} // test

References SECTION().

TEST_CASE_METHOD() [2/18]

TEST_CASE_METHOD	(	Fixture_complex_diamond	,
		"Cliques Masks K_1"	,
		""	[clique] )

Definition at line 380 of file testVoxelComplex.cpp.

                                                                           {
    auto &vc = complex_fixture;
    auto itc = vc.begin(3);
    for (std::size_t n = 0; n < 10; ++n)
        ++itc;
    auto cell = itc->first;
    Point p_cell = vc.space().uCoords(cell);
 
    SECTION("K_1 mask from a linel") {
        auto linel =
            vc.space().uCell(cell.preCell().coordinates + Point{0, 1, 1});
 
        using namespace DGtal::functions;
        auto k1p = vc.K_1(linel, true);
        auto &is_critical = k1p.first;
        CHECK(is_critical == true);
        auto &k1_clique = k1p.second;
        // numer of voxels in clique
        CHECK(k1_clique.nbCells(3) == 3);
    }
} // test

References SECTION().

TEST_CASE_METHOD() [3/18]

TEST_CASE_METHOD	(	Fixture_complex_diamond	,
		"Cliques Masks K_2"	,
		""	[clique] )

Definition at line 341 of file testVoxelComplex.cpp.

                                                                           {
    auto &vc = complex_fixture;
    auto itc = vc.begin(3);
    for (std::size_t n = 0; n < 10; ++n)
        ++itc;
    auto cell = itc->first;
    Point p_cell = vc.space().uCoords(cell);
    auto neigh6 = vc.space().uProperNeighborhood(cell);
    REQUIRE(neigh6.size() == 6);
    KSpace::Cells cells;
    for(auto & n : neigh6)
        if(vc.belongs(n)) cells.push_back(n);
    REQUIRE(cells.size() == 2);
 
    std::vector<std::pair<bool, FixtureComplex::Clique>> cliques_p;
    bool verbose = true;
    for (auto && cell_n : cells) {
        auto cell_point = vc.space().uCoords(cell_n);
        cliques_p.emplace_back(vc.K_2(p_cell, cell_point, verbose));
        auto &is_critical = cliques_p.back().first;
        auto &k2_clique = cliques_p.back().second;
        CHECK(is_critical == true);
        CHECK(k2_clique.nbCells(3) == 2);
    }
 
    SECTION(" Check same results for different K_2 interfaces") {
        for (auto && cell_n : cells) {
            auto co_face = vc.surfelBetweenAdjacentSpels(cell_n, cell);
 
            auto cell_point = vc.space().uCoords(cell_n);
            using namespace DGtal::functions;
            CHECK(isEqual(vc.K_2(p_cell, cell_point, false).second,
                          vc.K_2(cell, cell_n, false).second) == true);
            CHECK(isEqual(vc.K_2(p_cell, cell_point, false).second,
                          vc.K_2(co_face, false).second) == true);
        } // endfor
    }     // then_interfaces
} // test

References isEqual(), REQUIRE(), and SECTION().

TEST_CASE_METHOD() [4/18]

TEST_CASE_METHOD	(	Fixture_complex_diamond	,
		"Faces of voxel"	,
		""	[neighborhood][faces] )

Definition at line 180 of file testVoxelComplex.cpp.

                                          {
    auto &vc = complex_fixture;
    auto &ks = vc.space();
    bool closed = true;
    bool no_hint = false;
    auto not_found = vc.end(3);
 
    SECTION("Voxel is in the interior of the complex.") {
        Point p{0, 0, 2};
        auto cellMapIt = vc.findCell(3, ks.uSpel(p));
        CHECK(cellMapIt != not_found);
        auto cell = cellMapIt->first;
        auto kfaces = ks.uFaces(cell);
        CAPTURE(p);
        CAPTURE(cell);
        CHECK(kfaces.size() == 26);
        auto vcBoundary_closed = vc.cellBoundary(cell, closed);
        CHECK(vcBoundary_closed.size() == 26);
        auto vcBoundary_no_hint = vc.cellBoundary(cell, no_hint);
        CHECK(vcBoundary_no_hint.size() == 26);
    }
    SECTION("Voxel is in the exterior") {
        Point p{0, 0, 5};
        auto cellMapIt = vc.findCell(3, ks.uSpel(p));
        CHECK(cellMapIt == not_found);
        auto cell = ks.uSpel(p);
        auto kfaces = ks.uFaces(cell);
        CAPTURE(p);
        CAPTURE(cell);
        CHECK(kfaces.size() == 26);
        // We know that is not closed, but checking the differences:
        auto vcBoundary_closed = vc.cellBoundary(cell, closed);
        CHECK(vcBoundary_closed.size() == 26);
        // Right method to call:
        auto vcBoundary_no_hint = vc.cellBoundary(cell, no_hint);
        CHECK(vcBoundary_no_hint.size() == 0);
    }
    SECTION("Voxel is out, but surrounded by in voxels") {
        Point p{0, 0, 0};
        auto cellMapIt = vc.findCell(3, ks.uSpel(p));
        CHECK(cellMapIt == not_found);
        auto cell = ks.uSpel(p);
        auto kfaces = ks.uFaces(cell);
        CAPTURE(p);
        CAPTURE(cell);
        CHECK(kfaces.size() == 26);
        auto vcBoundary_closed = vc.cellBoundary(cell, closed);
        CHECK(vcBoundary_closed.size() == 26);
        auto vcBoundary_no_hint = vc.cellBoundary(cell, no_hint);
        CHECK(vcBoundary_no_hint.size() == 26);
    }
    SECTION("Voxel is in the border") {
        Point p{0, 0, 3};
        auto cellMapIt = vc.findCell(3, ks.uSpel(p));
        CHECK(cellMapIt != not_found);
        auto cell = cellMapIt->first;
        auto kfaces = ks.uFaces(cell);
        CAPTURE(p);
        CAPTURE(cell);
        CHECK(kfaces.size() == 26);
        auto vcBoundary_closed = vc.cellBoundary(cell, closed);
        CHECK(vcBoundary_closed.size() == 26);
        auto vcBoundary_no_hint = vc.cellBoundary(cell, no_hint);
        CHECK(vcBoundary_no_hint.size() == 26);
    }
}

References CAPTURE(), and SECTION().

TEST_CASE_METHOD() [5/18]

TEST_CASE_METHOD	(	Fixture_complex_diamond	,
		"Get All Critical Cliques of diamond"	,
		""	[critical][clique] )

Definition at line 425 of file testVoxelComplex.cpp.

                                       {
    auto &vc = complex_fixture;
    using namespace DGtal::functions;
    SECTION(" Get all criticalCliques() ") {
        auto criticals = vc.criticalCliques();
        CHECK(criticals.size() == 4);
 
        CHECK(vc.nbCells(3) == 62);
        CHECK(criticals[3].size() == 18);
        CHECK(vc.nbCells(2) == 264);
        CHECK(criticals[2].size() == 108);
        CHECK(vc.nbCells(1) == 360);
        CHECK(criticals[1].size() == 168);
        CHECK(vc.nbCells(0) == 160);
        CHECK(criticals[0].size() == 32);
    }
}

References SECTION().

TEST_CASE_METHOD() [6/18]

TEST_CASE_METHOD	(	Fixture_complex_diamond	,
		"insertVoxel"	,
		""	[insert][close] )

Definition at line 120 of file testVoxelComplex.cpp.

                                                                            {
    auto &vc = complex_fixture;
    auto &ks = vc.space();
    auto s3 = vc.nbCells(3);
    auto s2 = vc.nbCells(2);
    auto s1 = vc.nbCells(1);
    auto s0 = vc.nbCells(0);
    SECTION("insertVoxel in border") {
        Point p{0, 0, 4};
        auto vc_new = vc;
        vc_new.insertVoxelPoint(p);
        auto sa3 = vc_new.nbCells(3);
        auto sa2 = vc_new.nbCells(2);
        auto sa1 = vc_new.nbCells(1);
        auto sa0 = vc_new.nbCells(0);
        auto d3 = sa3 - s3;
        CHECK(d3 == 1);
        auto d2 = sa2 - s2;
        CHECK(d2 == 5);
        auto d1 = sa1 - s1;
        CHECK(d1 == 8);
        auto d0 = sa0 - s0;
        CHECK(d0 == 4);
    }
    SECTION("insertVoxel isolated") {
        Point p{5, 0, 0};
        auto vc_new = vc;
        vc_new.insertVoxelCell(ks.uSpel(p));
        auto sa3 = vc_new.nbCells(3);
        auto sa2 = vc_new.nbCells(2);
        auto sa1 = vc_new.nbCells(1);
        auto sa0 = vc_new.nbCells(0);
        auto d3 = sa3 - s3;
        CHECK(d3 == 1);
        auto d2 = sa2 - s2;
        CHECK(d2 == 6);
        auto d1 = sa1 - s1;
        CHECK(d1 == 12);
        auto d0 = sa0 - s0;
        CHECK(d0 == 8);
    }
    SECTION("insertVoxel interior") {
        Point p{0, 2, 0};
        auto vc_new = vc;
        vc_new.insertVoxelCell(ks.uSpel(p));
        auto sa3 = vc_new.nbCells(3);
        auto sa2 = vc_new.nbCells(2);
        auto sa1 = vc_new.nbCells(1);
        auto sa0 = vc_new.nbCells(0);
        auto d3 = sa3 - s3;
        CHECK(d3 == 0);
        auto d2 = sa2 - s2;
        CHECK(d2 == 0);
        auto d1 = sa1 - s1;
        CHECK(d1 == 0);
        auto d0 = sa0 - s0;
        CHECK(d0 == 0);
    }
}

References SECTION().

TEST_CASE_METHOD() [7/18]

TEST_CASE_METHOD	(	Fixture_complex_diamond	,
		"Neighbors from Object and KSpace"	,
		""	[neighborhood] )

Definition at line 248 of file testVoxelComplex.cpp.

                          {
    auto &vc = complex_fixture;
    SECTION(" get neighbors from Kspace") {
        {
            Dimension dim_voxel = 3;
            auto it = vc.begin(dim_voxel);
            for (std::size_t n = 0; n < 10; ++n)
                ++it;
            auto cell = it->first;
            auto point_from_kspace_1 = cell.preCell().coordinates;
            size_t expected_num_adjacent_voxels = 12;
 
            SECTION("properNeighborhood from KSpace"
                    "does not output all adjacent voxels.") {
 
                size_t expected_kspace_neighborhood = 7;
                auto neigh_k = vc.space().uNeighborhood(cell);
                CHECK(neigh_k.size() == expected_kspace_neighborhood);
 
                auto propN_k = vc.space().uProperNeighborhood(cell);
                CHECK(propN_k.size() == expected_kspace_neighborhood - 1);
            }
 
            SECTION("Getting associated pointels and voxels from input_cell") {
                std::set<FixtureComplex::Cell> pointel_set;
                vc.pointelsFromCell(pointel_set, cell);
                std::set<FixtureComplex::Cell> voxel_set;
                for (auto &&p : pointel_set)
                    vc.spelsFromCell(voxel_set, p);
                SECTION("Gets desired full adjancency for voxels") {
                    CHECK(voxel_set.size() == expected_num_adjacent_voxels);
                }
                auto clique = vc.Kneighborhood(cell);
                CHECK(clique.nbCells(3) == expected_num_adjacent_voxels);
            }
        }
    }
}

References SECTION().

TEST_CASE_METHOD() [8/18]

TEST_CASE_METHOD	(	Fixture_complex_diamond	,
		"Test Simplicity"	,
		""	[simplicity] )

Definition at line 288 of file testVoxelComplex.cpp.

                                                                             {
    auto &vc = complex_fixture;
    Dimension dim_voxel = 3;
    auto cit = vc.begin(dim_voxel);
    for (std::size_t n = 0; n < 10; ++n)
        ++cit;
    auto cell = cit->first;
 
    SECTION("querying voxel simplicity") {
        size_t nsimples{0};
        std::vector<FixtureComplex::Cell> non_simple_cells;
        for (auto it = vc.begin(dim_voxel); it != vc.end(dim_voxel); ++it) {
            if (vc.isSimple(it->first))
                ++nsimples;
            else
                non_simple_cells.emplace_back(it->first);
        }
 
        // Border points are simple in diamond.
        // auto border_size = vc.object().border().size();
        size_t border_size = 44;
        REQUIRE(nsimples == border_size);
    }
}

References REQUIRE(), and SECTION().

TEST_CASE_METHOD() [9/18]

TEST_CASE_METHOD	(	Fixture_complex_diamond	,
		"Test table wrappers"	,
		""	[table][simple] )

Definition at line 313 of file testVoxelComplex.cpp.

                                    {
    auto &vc = complex_fixture;
    trace.beginBlock("loadTable");
    vc.setSimplicityTable(functions::loadTable(simplicity::tableSimple26_6));
    trace.endBlock();
    auto dim_voxel = 3;
    auto cit = vc.begin(dim_voxel);
    for (std::size_t n = 0; n < 10; ++n)
        ++cit;
    auto cell = cit->first;
 
    SECTION("querying voxel simplicity") {
        size_t nsimples{0};
        std::vector<FixtureComplex::Cell> non_simple_cells;
        for (auto it = vc.begin(dim_voxel); it != vc.end(dim_voxel); ++it) {
            if (vc.isSimple(it->first))
                ++nsimples;
            else
                non_simple_cells.emplace_back(it->first);
        }
 
        // Border points are simple in diamond.
        size_t border_size = 44;
        REQUIRE(nsimples == border_size);
    }
}

References DGtal::functions::loadTable(), REQUIRE(), SECTION(), and DGtal::trace.

TEST_CASE_METHOD() [10/18]

TEST_CASE_METHOD	(	Fixture_complex_fig4	,
		"Get All Critical Cliques of fig4"	,
		""	[critical][clique] )

Definition at line 524 of file testVoxelComplex.cpp.

                                       {
    auto &vc = complex_fixture;
    using namespace DGtal::functions;
    SECTION(" Get all criticalCliques() ") {
        auto criticals = vc.criticalCliques(true);
        CHECK(criticals.size() == 4);
 
        CHECK(vc.nbCells(3) == 12);
        CHECK(criticals[3].size() == 1);
        CHECK(vc.nbCells(2) == 64);
        CHECK(criticals[2].size() == 3);
        CHECK(vc.nbCells(1) == 109);
        CHECK(criticals[1].size() == 2);
        CHECK(vc.nbCells(0) == 58);
        CHECK(criticals[0].size() == 6);
    }
}

References SECTION().

TEST_CASE_METHOD() [11/18]

TEST_CASE_METHOD	(	Fixture_complex_fig4	,
		"zeroSurface and oneSurface"	,
		""	[isSurface][function] )

Definition at line 544 of file testVoxelComplex.cpp.

                                          {
    auto &vc = complex_fixture;
    using namespace DGtal::functions;
    vc.clear();
    Point c(0, 0, 0);
    {
        vc.insertCell(3, vc.space().uSpel(c));
    }
    Point r(0, 1, 0);
    {
        vc.insertCell(3, vc.space().uSpel(r));
    }
    Point l(0, -1, 0);
    {
        vc.insertCell(3, vc.space().uSpel(l));
    }
    // Init an object
    using DigitalTopology = DGtal::Z3i::DT26_6;
    using DigitalSet = DGtal::DigitalSetByAssociativeContainer<
        DGtal::Z3i::Domain,
        std::unordered_set<typename DGtal::Z3i::Domain::Point>>;
    using Object = DGtal::Object<DigitalTopology, DigitalSet>;
    DigitalTopology::ForegroundAdjacency adjF;
    DigitalTopology::BackgroundAdjacency adjB;
    auto domain = DGtal::Z3i::Domain(ks_fixture.lowerBound(), ks_fixture.upperBound());
    DigitalTopology topo(
            adjF, adjB, DGtal::DigitalTopologyProperties::JORDAN_DT);
 
    SECTION("checking zero surfaces of original set") {
        std::set<Point> zeroSurfacesCells;
        DigitalSet voxel_set(domain);
        vc.dumpVoxels(voxel_set);
        Object object(topo, voxel_set);
        for (const auto &p : voxel_set) {
            auto small_obj = object.properNeighborhood(p);
            if (isZeroSurface(small_obj))
                zeroSurfacesCells.insert(p);
        }
        CHECK(zeroSurfacesCells.size() == 1);
    }
 
    SECTION("checking one surfaces of original set") {
        Point u(-1, 0, 0);
        {
            vc.insertCell(3, vc.space().uSpel(u));
        }
        Point d(1, 0, 0);
        {
            vc.insertCell(3, vc.space().uSpel(d));
        }
 
        std::set<Point> oneSurfacesCells;
        DigitalSet voxel_set(domain);
        vc.dumpVoxels(voxel_set);
        Object object(topo, voxel_set);
 
        for (const auto &p : voxel_set) {
            auto small_obj = object.properNeighborhood(p);
            if (isOneSurface(small_obj))
                oneSurfacesCells.insert(p);
        }
        CHECK(oneSurfacesCells.size() == 1);
    }
}

References domain, DGtal::functions::isOneSurface(), DGtal::functions::isZeroSurface(), DGtal::JORDAN_DT, and SECTION().

TEST_CASE_METHOD() [12/18]

TEST_CASE_METHOD	(	Fixture_isthmus	,
		"Check isthmus"	,
		""	[isthmus][function] )

Definition at line 736 of file testVoxelComplex.cpp.

                                                                          {
    auto &vc = complex_fixture;
    using namespace DGtal::functions;
    auto &ks = vc.space();
    Point x(-1, 4, 0); // oneIsthmus
    Point y(-1, 1, 0); // twoIsthmus
 
    SECTION("checking one isthmus") {
        std::set<Point> isthmus;
        for (const auto &p : set_fixture) {
            if (oneIsthmus(vc, ks.uSpel(p)))
                isthmus.insert(p);
        }
        CHECK(isthmus.size() == 1);
        auto xit = isthmus.find(x);
        CHECK(*xit == x);
    }
 
    SECTION("checking 2 isthmus") {
        std::set<Point> isthmus;
        for (const auto &p : set_fixture) {
            if (twoIsthmus(vc, ks.uSpel(p)))
                isthmus.insert(p);
        }
        CHECK(isthmus.size() == 1);
        auto yit = isthmus.find(y);
        CHECK(*yit == y);
    }
 
    SECTION("checking 1 and 2 isthmus") {
        std::set<Point> isthmus;
        for (const auto &p : set_fixture) {
            if (skelIsthmus(vc, ks.uSpel(p)))
                isthmus.insert(p);
        }
        CHECK(isthmus.size() == 2);
        auto xit = isthmus.find(x);
        auto yit = isthmus.find(y);
        CHECK(xit != isthmus.end());
        CHECK(yit != isthmus.end());
    }
}

References DGtal::functions::oneIsthmus(), SECTION(), DGtal::functions::skelIsthmus(), and DGtal::functions::twoIsthmus().

TEST_CASE_METHOD() [13/18]

TEST_CASE_METHOD	(	Fixture_isthmus	,
		"Persistence thin"	,
		""	[persistence][isthmus][thin][function] )

Definition at line 810 of file testVoxelComplex.cpp.

                                                           {
    using namespace DGtal::functions;
    auto &vc = complex_fixture;
    auto &ks = vc.space();
    boost::ignore_unused_variable_warning(ks);
    SECTION("with skelUltimate") {
        auto vc_new = persistenceAsymetricThinningScheme<FixtureComplex>(
            vc, selectRandom<FixtureComplex>, skelUltimate<FixtureComplex>, 0);
        CHECK(vc_new.nbCells(3) == 1);
    }
    SECTION("with skelEnd") {
        auto vc_new = persistenceAsymetricThinningScheme<FixtureComplex>(
            vc, selectRandom<FixtureComplex>, skelEnd<FixtureComplex>, 0);
        CHECK(vc_new.nbCells(3) == 5);
    }
    SECTION("with oneIsthmus") {
        // Not using LUT skel function (slow):
        //auto vc_new = persistenceAsymetricThinningScheme< FixtureComplex >(
        //    vc, selectRandom<FixtureComplex>, oneIsthmus<FixtureComplex>, 0);
        //
        // with LUT:
        auto table = *functions::loadTable(isthmusicity::tableOneIsthmus);
        auto pointToMaskMap =
            *functions::mapZeroPointNeighborhoodToConfigurationMask<Point>();
        auto oneIsthmusTable =
            [&table, &pointToMaskMap](const FixtureComplex &fc,
                                      const FixtureComplex::Cell &c) {
                return skelWithTable(table, pointToMaskMap, fc, c);
            };
        auto vc_new = persistenceAsymetricThinningScheme<FixtureComplex>(
            vc, selectRandom<FixtureComplex>, oneIsthmusTable, 0);
        CHECK(vc_new.nbCells(3) == 3);
    }
    SECTION("with twoIsthmus") {
        // Not using LUT skel function (slow):
        //auto vc_new = persistenceAsymetricThinningScheme< FixtureComplex >(
        //    vc, selectRandom<FixtureComplex>, twoIsthmus<FixtureComplex>, 0);
        //
        // with LUT:
        auto table = *functions::loadTable(isthmusicity::tableTwoIsthmus);
        auto pointToMaskMap =
            *functions::mapZeroPointNeighborhoodToConfigurationMask<Point>();
        auto twoIsthmusTable =
            [&table, &pointToMaskMap](const FixtureComplex &fc,
                                      const FixtureComplex::Cell &c) {
                return skelWithTable(table, pointToMaskMap, fc, c);
            };
        auto vc_new = persistenceAsymetricThinningScheme<FixtureComplex>(
            vc, selectRandom<FixtureComplex>, twoIsthmusTable, 0);
        CHECK(vc_new.nbCells(3) == 1);
    }
    SECTION("with skelIsthmus") {
        // Not using LUT skel function (slow):
        //auto vc_new = persistenceAsymetricThinningScheme< FixtureComplex >(
        //   vc, selectRandom<FixtureComplex>, skelIsthmus<FixtureComplex>, 0);
        //
        // with LUT:
        auto table = *functions::loadTable(isthmusicity::tableIsthmus);
        auto pointToMaskMap =
            *functions::mapZeroPointNeighborhoodToConfigurationMask<Point>();
        auto isthmusTable = [&table,
                             &pointToMaskMap](const FixtureComplex &fc,
                                              const FixtureComplex::Cell &c) {
            return skelWithTable(table, pointToMaskMap, fc, c);
        };
        auto vc_new = persistenceAsymetricThinningScheme<FixtureComplex>(
            vc, selectRandom<FixtureComplex>, isthmusTable, 0);
        CHECK(vc_new.nbCells(3) == 3);
    }
}

References DGtal::functions::loadTable(), DGtal::functions::mapZeroPointNeighborhoodToConfigurationMask(), DGtal::functions::persistenceAsymetricThinningScheme(), SECTION(), DGtal::functions::selectRandom(), DGtal::functions::skelEnd(), DGtal::functions::skelUltimate(), and DGtal::functions::skelWithTable().

TEST_CASE_METHOD() [14/18]

TEST_CASE_METHOD	(	Fixture_isthmus	,
		"Thin complex"	,
		""	[isthmus][thin][function] )

Definition at line 778 of file testVoxelComplex.cpp.

                                                                               {
    using namespace DGtal::functions;
    auto &vc = complex_fixture;
    auto &ks = vc.space();
    boost::ignore_unused_variable_warning(ks);
    SECTION("with skelUltimate") {
        auto vc_new = asymetricThinningScheme<FixtureComplex>(
            vc, selectFirst<FixtureComplex>, skelUltimate<FixtureComplex>);
        CHECK(vc_new.nbCells(3) == 1);
    }
    SECTION("with skelEnd") {
        auto vc_new = asymetricThinningScheme<FixtureComplex>(
            vc, selectFirst<FixtureComplex>, skelEnd<FixtureComplex>);
        CHECK(vc_new.nbCells(3) == 5);
    }
    SECTION("with oneIsthmus") {
        auto vc_new = asymetricThinningScheme<FixtureComplex>(
            vc, selectRandom<FixtureComplex>, oneIsthmus<FixtureComplex>);
        CHECK(vc_new.nbCells(3) == 3);
    }
    SECTION("with twoIsthmus") {
        auto vc_new = asymetricThinningScheme<FixtureComplex>(
            vc, selectRandom<FixtureComplex>, twoIsthmus<FixtureComplex>);
        CHECK(vc_new.nbCells(3) == 1);
    }
    SECTION("with skelIsthmus") {
        auto vc_new = asymetricThinningScheme<FixtureComplex>(
            vc, selectRandom<FixtureComplex>, skelIsthmus<FixtureComplex>);
        CHECK(vc_new.nbCells(3) == 3);
    }
}

References DGtal::functions::asymetricThinningScheme(), DGtal::functions::oneIsthmus(), SECTION(), DGtal::functions::selectFirst(), DGtal::functions::selectRandom(), DGtal::functions::skelEnd(), DGtal::functions::skelIsthmus(), DGtal::functions::skelUltimate(), and DGtal::functions::twoIsthmus().

TEST_CASE_METHOD() [15/18]

TEST_CASE_METHOD	(	Fixture_isthmus	,
		"Thin disconnected complex"	,
		""	[isthmus][thin][function] )

Definition at line 716 of file testVoxelComplex.cpp.

                                              {
    using namespace DGtal::functions;
    auto &vc = complex_fixture;
    auto &ks = vc.space();
    boost::ignore_unused_variable_warning(ks);
    Point x(-1, 4, 0);
    set_fixture.erase(x);
    // Delete one point and reconstruct complex.
    /* obj_fixture.pointSet().erase(x); */
    vc.clear();
    vc.construct(set_fixture);
    SECTION("with skelUltimate") {
        auto vc_new = asymetricThinningScheme<FixtureComplex>(
            vc, selectFirst<FixtureComplex>, skelUltimate<FixtureComplex>);
        CHECK(vc_new.nbCells(3) == 2);
    }
}

References DGtal::functions::asymetricThinningScheme(), SECTION(), DGtal::functions::selectFirst(), and DGtal::functions::skelUltimate().

TEST_CASE_METHOD() [16/18]

TEST_CASE_METHOD	(	Fixture_X	,
		"X DistanceMap"	,
		""	[x][distance][thin] )

Use distance map in the Select function.

Definition at line 1059 of file testVoxelComplex.cpp.

                                                                    {
    using namespace DGtal::functions;
    auto &vc = complex_fixture;
    auto &ks = vc.space();
    boost::ignore_unused_variable_warning(ks);
    using Predicate = Z3i::DigitalSet;
    using L3Metric = ExactPredicateLpSeparableMetric<Z3i::Space, 3>;
    using DT = DistanceTransformation<Z3i::Space, Predicate, L3Metric>;
    bool verbose = true;
    SECTION("Fixture_X Distance Map") {
        trace.beginBlock("With a Distance Map");
        L3Metric l3;
        DT dt(set_fixture.domain(), set_fixture, l3);
        // Create wrap around selectMaxValue to use the thinning.
        auto selectDistMax = [&dt](const FixtureComplex::Clique &clique) {
            return selectMaxValue<DT, FixtureComplex>(dt, clique);
        };
        SECTION("asymetricThinning"){
            auto vc_new = asymetricThinningScheme<FixtureComplex>(
                    vc, selectDistMax, skelEnd<FixtureComplex>, verbose);
        }
        SECTION("persistenceThinning"){
            auto table = *functions::loadTable(isthmusicity::tableOneIsthmus);
            auto pointToMaskMap =
                *functions::mapZeroPointNeighborhoodToConfigurationMask<Point>();
            auto oneIsthmusTable =
                [&table, &pointToMaskMap](const FixtureComplex &fc,
                        const FixtureComplex::Cell &c) {
                    return skelWithTable(table, pointToMaskMap, fc, c);
                };
            int persistence = 3;
            auto vc_new = persistenceAsymetricThinningScheme<FixtureComplex>(
                    vc, selectDistMax, oneIsthmusTable,
                    persistence, verbose);
            // SECTION( "visualize the thining" ){
            //     int argc(1);
            //     char** argv(nullptr);
            //     PolyscopeViewer<> viewer(ks_fixture);
            //     // viewer.allowReuseList = true;
            //     viewer.drawColor(Color(200, 200, 200, 100));
            //     for ( auto it = vc_new.begin(3); it!= vc_new.end(3); ++it )
            //         viewer << it->first;
            //
            //     // All kspace voxels
            //     viewer.drawColor(Color(40, 40, 40, 10));
            //     for ( auto it = vc.begin(3); it!= vc.end(3); ++it )
            //         viewer << it->first;
            //
            //     viewer.show();
            //
            // }
        }
 
    }
 
    trace.endBlock();
}

References DGtal::functions::asymetricThinningScheme(), dt, DGtal::functions::loadTable(), DGtal::functions::mapZeroPointNeighborhoodToConfigurationMask(), DGtal::functions::persistenceAsymetricThinningScheme(), SECTION(), DGtal::functions::selectMaxValue(), DGtal::functions::skelEnd(), DGtal::functions::skelWithTable(), and DGtal::trace.

TEST_CASE_METHOD() [17/18]

TEST_CASE_METHOD	(	Fixture_X	,
		"X Thin with	Isthmus,
		and tables"	,
		""	[x][isthmus][thin][function][table] )

Definition at line 1004 of file testVoxelComplex.cpp.

                                                        {
    using namespace DGtal::functions;
    auto &vc = complex_fixture;
    auto &ks = vc.space();
    boost::ignore_unused_variable_warning(ks);
    bool verbose = true;
 
    // Disabled to reduce test time
    // SECTION("Compute with skelIsthmus") {
    //     trace.beginBlock("Fixture_X skelIsthmus");
    //     auto vc_new = asymetricThinningScheme<FixtureComplex>(
    //         vc, selectRandom<FixtureComplex>, skelIsthmus<FixtureComplex>,
    //         verbose);
    //     trace.endBlock();
    // }
    SECTION("Compute with skelWithTable (isIsthmus)") {
        trace.beginBlock("Fixture_X skelIsthmus with table");
        auto table = *functions::loadTable(isthmusicity::tableIsthmus);
        auto pointToMaskMap =
            *functions::mapZeroPointNeighborhoodToConfigurationMask<Point>();
        auto skelWithTableIsthmus =
            [&table, &pointToMaskMap](const FixtureComplex &fc,
                                      const FixtureComplex::Cell &c) {
                return skelWithTable(table, pointToMaskMap, fc, c);
            };
 
        auto vc_new = asymetricThinningScheme<FixtureComplex>(
            vc, selectRandom<FixtureComplex>, skelWithTableIsthmus, verbose);
 
        trace.endBlock();
    }
 
    SECTION("Compute with skelWithTable (isIsthmus) and empty Object") {
        trace.beginBlock("Fixture_X skelIsthmus with table (empty objectSet)");
        vc.setSimplicityTable(
            functions::loadTable(simplicity::tableSimple26_6));
        vc.clear();
        auto table = *functions::loadTable(isthmusicity::tableIsthmus);
        auto pointToMaskMap =
            *functions::mapZeroPointNeighborhoodToConfigurationMask<Point>();
        auto skelWithTableIsthmus =
            [&table, &pointToMaskMap](const FixtureComplex &fc,
                                      const FixtureComplex::Cell &c) {
                return skelWithTable(table, pointToMaskMap, fc, c);
            };
 
        auto vc_new = asymetricThinningScheme<FixtureComplex>(
            vc, selectRandom<FixtureComplex>, skelWithTableIsthmus, verbose);
 
        trace.endBlock();
    }
}

References DGtal::functions::asymetricThinningScheme(), DGtal::functions::loadTable(), DGtal::functions::mapZeroPointNeighborhoodToConfigurationMask(), SECTION(), DGtal::functions::selectRandom(), DGtal::functions::skelWithTable(), and DGtal::trace.

TEST_CASE_METHOD() [18/18]

TEST_CASE_METHOD	(	Fixture_X	,
		"X Thin"	,
		""	[x][persistence][isthmus][thin][function] )

Definition at line 977 of file testVoxelComplex.cpp.

                                                              {
    using namespace DGtal::functions;
    auto &vc = complex_fixture;
    auto &ks = vc.space();
    boost::ignore_unused_variable_warning(ks);
    bool verbose = true;
    SECTION(
        "persistence value of 1 is equivalent to the assymetric algorithm") {
        auto vc_new = persistenceAsymetricThinningScheme<FixtureComplex>(
            vc, selectFirst<FixtureComplex>, skelEnd<FixtureComplex>, 1,
            verbose);
 
        auto vc_assymetric = asymetricThinningScheme<FixtureComplex>(
            vc, selectFirst<FixtureComplex>, skelEnd<FixtureComplex>, true);
        // 10% tolerance
        CHECK(vc_assymetric.nbCells(3) ==
              Approx(vc_new.nbCells(3)).epsilon(0.1));
    }
    SECTION("persistence value: infinite is equivalent to ultimate skeleton") {
        auto vc_new = persistenceAsymetricThinningScheme<FixtureComplex>(
            vc, selectRandom<FixtureComplex>, skelEnd<FixtureComplex>, 100,
            verbose);
        REQUIRE(vc_new.nbCells(3) == 1);
    }
}

References DGtal::functions::asymetricThinningScheme(), DGtal::functions::persistenceAsymetricThinningScheme(), REQUIRE(), SECTION(), DGtal::functions::selectFirst(), DGtal::functions::selectRandom(), and DGtal::functions::skelEnd().