DGtal 2.1.0
Loading...
Searching...
No Matches
testArithmeticalDSSComputerOnSurfels.cpp File Reference
#include <iostream>
#include <string>
#include <iterator>
#include "DGtal/base/Common.h"
#include "DGtal/helpers/StdDefs.h"
#include "DGtal/helpers/Shortcuts.h"
#include "DGtal/topology/DigitalSurface2DSlice.h"
#include "ConfigTest.h"
#include "DGtalCatch.h"
#include "DGtal/geometry/curves/ArithmeticalDSSComputer.h"
#include "DGtal/geometry/surfaces/ArithmeticalDSSComputerOnSurfels.h"
#include "DGtal/geometry/curves/SaturatedSegmentation.h"
Include dependency graph for testArithmeticalDSSComputerOnSurfels.cpp:

Go to the source code of this file.

Data Structures

struct  Slice
 

Typedefs

using KSpace = Z3i::KSpace
 
using SH3 = Shortcuts< KSpace >
 
using Surfel = KSpace::SCell
 
using SegmentComputerOnSurfels = ArithmeticalDSSComputerOnSurfels< KSpace, std::vector< Surfel >::const_iterator, int >
 
using SegmentationSurfels = SaturatedSegmentation< SegmentComputerOnSurfels >
 
using SegmentComputer = ArithmeticalDSSComputer< std::vector< Z2i::Point >::const_iterator, int, 4 >
 
using Segmentation = SaturatedSegmentation< SegmentComputer >
 

Functions

std::pair< KSpace, SlicegetSlice (std::string const &shape="ellipsoid", double gridstep=1.0)
 
std::vector< Z2i::PointextractPoints (SegmentComputerOnSurfels const &sc, Slice const &slice)
 
 TEST_CASE ("Testing ArithmeticalDSSComputerOnSurfels")
 

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
Jocelyn Meyron (jocel.nosp@m.yn.m.nosp@m.eyron.nosp@m.@lir.nosp@m.is.cn.nosp@m.rs.f.nosp@m.r ) Laboratoire d'InfoRmatique en Image et Systemes d'information - LIRIS (CNRS, UMR 5205), CNRS, France
Date
2021/02/12

Functions for testing class DGtal::ArithmeticalDSSComputerOnSurfels.

This file is part of the DGtal library.

Definition in file testArithmeticalDSSComputerOnSurfels.cpp.

Typedef Documentation

◆ KSpace

◆ Segmentation

◆ SegmentationSurfels

◆ SegmentComputer

◆ SegmentComputerOnSurfels

using SegmentComputerOnSurfels = ArithmeticalDSSComputerOnSurfels<KSpace, std::vector<Surfel>::const_iterator, int>

Definition at line 52 of file testArithmeticalDSSComputerOnSurfels.cpp.

◆ SH3

◆ Surfel

Function Documentation

◆ extractPoints()

std::vector< Z2i::Point > extractPoints ( SegmentComputerOnSurfels const &  sc,
Slice const &  slice 
)

Definition at line 95 of file testArithmeticalDSSComputerOnSurfels.cpp.

96{
97 std::vector<Z2i::Point> points;
98
99 auto initialPoints = sc.getProjectedPointsFromSurfel(slice.start);
100 points.push_back(initialPoints.first);
101 points.push_back(initialPoints.second);
102
103 for (auto sit = slice.contour.begin() + 1; sit != slice.contour.end(); ++sit)
104 {
105 Surfel s = *sit;
106 auto pt = sc.getNextProjectedPoint(s);
107 points.push_back(pt);
108 }
109
110 return points;
111}
Represents a signed cell in a cellular grid space by its Khalimsky coordinates and a boolean value.

References Slice::contour, and Slice::start.

Referenced by TEST_CASE().

◆ getSlice()

std::pair< KSpace, Slice > getSlice ( std::string const &  shape = "ellipsoid",
double  gridstep = 1.0 
)

Definition at line 66 of file testArithmeticalDSSComputerOnSurfels.cpp.

67{
69
70 auto params = SH3::defaultParameters();
71 params("polynomial", shape)("gridstep", gridstep);
72
73 auto implicit_shape = SH3::makeImplicitShape3D(params);
74 auto digitized_shape = SH3::makeDigitizedImplicitShape3D(implicit_shape, params);
75 auto binary_image = SH3::makeBinaryImage(digitized_shape, params);
76 auto kspace = SH3::getKSpace(binary_image, params);
77 auto surface = SH3::makeDigitalSurface(binary_image, kspace, params);
78
79 Surfel surfel = Surfaces<KSpace>::findABel(kspace, *binary_image, 10000);
80
81 KSpace::DirIterator q1 = kspace.sDirs(surfel);
82 KSpace::DirIterator q2 = kspace.sOrthDirs(surfel);
83 Dimension dim1 = *q1, dim2 = *q2;
84 auto tracker = surface->container().newTracker(surfel);
85 SurfaceSlice surfaceSlice(tracker, dim1);
86 delete tracker;
87
88 std::vector<Surfel> contour(surfaceSlice.begin(), surfaceSlice.end());
89
90 Slice slice{dim1, dim2, surfel, contour};
91
92 return { kspace, slice };
93}
Aim: Represents a 2-dimensional slice in a DigitalSurface. In a sense, it is a 4-connected contour,...
typename PreCellularGridSpace::DirIterator DirIterator
static SCell findABel(const KSpace &K, const PointPredicate &pp, unsigned int nbtries=1000)
CountedPtr< SH3::DigitalSurface > surface
CountedPtr< SH3::BinaryImage > binary_image
DGtal::uint32_t Dimension
Definition Common.h:119

References binary_image, DGtal::Surfaces< TKSpace >::findABel(), and surface.

Referenced by TEST_CASE().

◆ TEST_CASE()

TEST_CASE ( "Testing ArithmeticalDSSComputerOnSurfels"  )

Definition at line 114 of file testArithmeticalDSSComputerOnSurfels.cpp.

115{
116 // Construct and extract a slice of a digital surface
117 KSpace kspace;
118 Slice slice;
119 std::tie(kspace, slice) = getSlice();
120
121 // Do a segmentation using the surfel class
122 SegmentComputerOnSurfels recognitionAlgorithmSurfels(kspace, slice.dim1, slice.dim2);
123 SegmentationSurfels segmentationSurfels(slice.contour.begin(), slice.contour.end(), recognitionAlgorithmSurfels);
124
125 // Extract the projected points
126 std::vector<Z2i::Point> points = extractPoints(recognitionAlgorithmSurfels, slice);
127
128 // Do a segmentation on the projected points
129 SegmentComputer recognitionAlgorithm;
130 Segmentation segmentation(points.begin(), points.end(), recognitionAlgorithm);
131
132 // The two segmentations must be the same
133 bool allEqual = true;
134 auto segIt = segmentation.begin();
135 auto segSurfelIt = segmentationSurfels.begin();
136 while (segIt != segmentation.end() && segSurfelIt != segmentationSurfels.end()) {
137
138 allEqual = allEqual && (segIt->primitive() == segSurfelIt->primitive());
139 ++segIt;
140 ++segSurfelIt;
141 }
142
143 REQUIRE(allEqual);
144}
Aim: This class is a model of CCellularGridSpaceND. It represents the cubical grid as a cell complex,...
std::vector< Surfel > contour
std::pair< KSpace, Slice > getSlice(std::string const &shape="ellipsoid", double gridstep=1.0)
SaturatedSegmentation< SegmentComputerOnSurfels > SegmentationSurfels
ArithmeticalDSSComputerOnSurfels< KSpace, std::vector< Surfel >::const_iterator, int > SegmentComputerOnSurfels
std::vector< Z2i::Point > extractPoints(SegmentComputerOnSurfels const &sc, Slice const &slice)
SaturatedSegmentation< SegmentComputer > Segmentation
REQUIRE(domain.isInside(aPoint))

References Slice::contour, Slice::dim1, Slice::dim2, extractPoints(), getSlice(), and REQUIRE().