DGtal 1.3.0
Loading...
Searching...
No Matches
CubicalComplexFunctions.h
1
17#pragma once
18
31#if defined(CubicalComplexFunctions_RECURSES)
32#error Recursive header files inclusion detected in CubicalComplexFunctions.h
33#else // defined(CubicalComplexFunctions_RECURSES)
35#define CubicalComplexFunctions_RECURSES
36
37#if !defined CubicalComplexFunctions_h
39#define CubicalComplexFunctions_h
40
42// Inclusions
43#include <iostream>
44#include "DGtal/base/Common.h"
45#include "DGtal/topology/CubicalComplex.h"
46#include <DGtal/topology/helpers/NeighborhoodConfigurationsHelper.h>
48
49namespace DGtal
50{
59 template <typename TKSpace, typename TCellContainer>
60 inline CubicalComplex< TKSpace, TCellContainer >
61 operator~( const CubicalComplex< TKSpace, TCellContainer >& S1 )
62 {
63 CubicalComplex< TKSpace, TCellContainer > S( S1 );
64 S.close();
65 return S;
66 }
67
76 template <typename TKSpace, typename TCellContainer>
77 inline CubicalComplex< TKSpace, TCellContainer >
78 operator*( const CubicalComplex< TKSpace, TCellContainer >& S1 )
79 {
80 CubicalComplex< TKSpace, TCellContainer > S( S1 );
81 S.open();
82 return S;
83 }
84
95 template <typename TKSpace, typename TCellContainer>
96 inline CubicalComplex< TKSpace, TCellContainer >&
97 operator-=( CubicalComplex< TKSpace, TCellContainer >& S1,
98 const CubicalComplex< TKSpace, TCellContainer >& S2 )
99 {
100 typedef CubicalComplex< TKSpace, TCellContainer > CC;
101 for ( Dimension i = 0; i <= CC::dimension; ++i )
102 functions::setops::operator-=( S1.myCells[ i ],S2.myCells[ i ] );
103 return S1;
104 }
105
116 template <typename TKSpace, typename TCellContainer>
117 inline CubicalComplex< TKSpace, TCellContainer >
118 operator-( const CubicalComplex< TKSpace, TCellContainer >& S1,
119 const CubicalComplex< TKSpace, TCellContainer >& S2 )
120 {
121 typedef CubicalComplex< TKSpace, TCellContainer > CC;
122 CC S( S1 );
123 for ( Dimension i = 0; i <= CC::dimension; ++i )
124 functions::setops::operator-=( S.myCells[ i ],S2.myCells[ i ] );
125 return S;
126 }
127
137 template <typename TKSpace, typename TCellContainer>
138 inline CubicalComplex< TKSpace, TCellContainer >
139 operator|( const CubicalComplex< TKSpace, TCellContainer >& S1,
140 const CubicalComplex< TKSpace, TCellContainer >& S2 )
141 {
142 typedef CubicalComplex< TKSpace, TCellContainer > CC;
143 CC S( S1 );
144 for ( Dimension i = 0; i <= CC::dimension; ++i )
145 functions::setops::operator|=( S.myCells[ i ],S2.myCells[ i ] );
146 return S;
147 }
148
158 template <typename TKSpace, typename TCellContainer>
159 inline CubicalComplex< TKSpace, TCellContainer >&
160 operator|=( CubicalComplex< TKSpace, TCellContainer >& S1,
161 const CubicalComplex< TKSpace, TCellContainer >& S2 )
162 {
163 typedef CubicalComplex< TKSpace, TCellContainer > CC;
164 for ( Dimension i = 0; i <= CC::dimension; ++i )
165 functions::setops::operator|=( S1.myCells[ i ], S2.myCells[ i ] );
166 return S1;
167 }
168
178 template <typename TKSpace, typename TCellContainer>
179 inline CubicalComplex< TKSpace, TCellContainer >
180 operator&( const CubicalComplex< TKSpace, TCellContainer >& S1,
181 const CubicalComplex< TKSpace, TCellContainer >& S2 )
182 {
183 typedef CubicalComplex< TKSpace, TCellContainer > CC;
184 CC S( S1 );
185 for ( Dimension i = 0; i <= CC::dimension; ++i )
186 functions::setops::operator&=( S.myCells[ i ], S2.myCells[ i ] );
187 return S;
188 }
189
199 template <typename TKSpace, typename TCellContainer>
200 inline CubicalComplex< TKSpace, TCellContainer >&
201 operator&=( CubicalComplex< TKSpace, TCellContainer >& S1,
202 const CubicalComplex< TKSpace, TCellContainer >& S2 )
203 {
204 typedef CubicalComplex< TKSpace, TCellContainer > CC;
205 for ( Dimension i = 0; i <= CC::dimension; ++i )
206 functions::setops::operator&=( S1.myCells[ i ], S2.myCells[ i ] );
207 return S1;
208 }
209
220 template <typename TKSpace, typename TCellContainer>
221 inline CubicalComplex< TKSpace, TCellContainer >
222 operator^( const CubicalComplex< TKSpace, TCellContainer >& S1,
223 const CubicalComplex< TKSpace, TCellContainer >& S2 )
224 {
225 typedef CubicalComplex< TKSpace, TCellContainer > CC;
226 CC S( S1 );
227 for ( Dimension i = 0; i <= CC::dimension; ++i )
228 functions::setops::operator^=( S.myCells[ i ], S2.myCells[ i ] );
229 return S;
230 }
231
243 template <typename TKSpace, typename TCellContainer>
244 inline CubicalComplex< TKSpace, TCellContainer >&
245 operator^=( CubicalComplex< TKSpace, TCellContainer >& S1,
246 const CubicalComplex< TKSpace, TCellContainer >& S2 )
247 {
248 typedef CubicalComplex< TKSpace, TCellContainer > CC;
249 for ( Dimension i = 0; i <= CC::dimension; ++i )
250 functions::setops::operator^=( S1.myCells[ i ], S2.myCells[ i ] );
251 return S1;
252 }
253
255
264 template <typename TKSpace, typename TCellContainer>
265 bool
266 operator==( const CubicalComplex< TKSpace, TCellContainer >& S1,
267 const CubicalComplex< TKSpace, TCellContainer >& S2 )
268 {
269 typedef CubicalComplex< TKSpace, TCellContainer > CC;
270 ASSERT( &(S1.space()) == &(S2.space()) );
271 for ( Dimension i = 0; i <= CC::dimension; ++i )
272 if ( ! functions::isEqual( S1.myCells[ i ], S2.myCells[ i ] ) )
273 return false;
274 return true;
275 }
276
278
291 template <typename TKSpace, typename TCellContainer>
292 bool
293 operator!=( const CubicalComplex< TKSpace, TCellContainer >& S1,
294 const CubicalComplex< TKSpace, TCellContainer >& S2 )
295 {
296 typedef CubicalComplex< TKSpace, TCellContainer > CC;
297 ASSERT( &(S1.space()) == &(S2.space()) );
298 for ( Dimension i = 0; i <= CC::dimension; ++i )
299 if ( ! functions::isEqual( S1.myCells[ i ], S2.myCells[ i ] ) )
300 return true;
301 return false;
302 }
303
305
315 template <typename TKSpace, typename TCellContainer>
316 bool
317 operator<=( const CubicalComplex< TKSpace, TCellContainer >& S1,
318 const CubicalComplex< TKSpace, TCellContainer >& S2 )
319 {
320 typedef CubicalComplex< TKSpace, TCellContainer > CC;
321 ASSERT( &(S1.space()) == &(S2.space()) );
322 for ( Dimension i = 0; i <= CC::dimension; ++i )
323 if ( ! functions::isSubset( S1.myCells[ i ], S2.myCells[ i ] ) )
324 return false;
325 return true;
326 }
327
338 template <typename TKSpace, typename TCellContainer>
339 bool
340 operator>=( const CubicalComplex< TKSpace, TCellContainer >& S1,
341 const CubicalComplex< TKSpace, TCellContainer >& S2 )
342 {
343 typedef CubicalComplex< TKSpace, TCellContainer > CC;
344 ASSERT( &(S1.space()) == &(S2.space()) );
345 for ( Dimension i = 0; i <= CC::dimension; ++i )
346 if ( ! functions::isSubset( S2.myCells[ i ], S1.myCells[ i ] ) )
347 return false;
348 return true;
349 }
350
351 namespace functions {
352
392 template <typename TKSpace, typename TCellContainer,
393 typename CellConstIterator,
394 typename CellMapIteratorPriority >
395 uint64_t collapse( CubicalComplex< TKSpace, TCellContainer > & K,
396 CellConstIterator S_itB, CellConstIterator S_itE,
397 const CellMapIteratorPriority& priority,
398 bool hintIsSClosed = false, bool hintIsKClosed = false,
399 bool verbose = false );
400
431 template <typename TKSpace, typename TCellContainer,
432 typename BdryCellOutputIterator,
433 typename InnerCellOutputIterator>
434 void
435 filterCellsWithinBounds( const CubicalComplex< TKSpace, TCellContainer > & K,
436 const typename TKSpace::Point& kLow,
437 const typename TKSpace::Point& kUp,
438 BdryCellOutputIterator itBdry,
439 InnerCellOutputIterator itInner );
440
457 template < typename TObject, typename TKSpace, typename TCellContainer>
458 std::unique_ptr<TObject>
459 objectFromSpels(const CubicalComplex< TKSpace, TCellContainer > & C);
460
482 template<typename TComplex>
483 NeighborhoodConfiguration
484 getSpelNeighborhoodConfigurationOccupancy(
485 const TComplex & input_complex,
486 const typename TComplex::Point & center,
487 const std::unordered_map<
488 typename TComplex::Point, NeighborhoodConfiguration> & mapPointToMask);
489 } // namespace functions
490
491} // namespace DGtal
492
493
495// Includes inline functions.
496#include "DGtal/topology/CubicalComplexFunctions.ih"
497
498// //
500
501#endif // !defined CubicalComplexFunctions_h
502
503#undef CubicalComplexFunctions_RECURSES
504#endif // else defined(CubicalComplexFunctions_RECURSES)
DGtal::CubicalComplex
Aim: This class represents an arbitrary cubical complex living in some Khalimsky space....
Definition: CubicalComplex.h:176
DGtal::CubicalComplex::space
const KSpace & space() const
DGtal::CubicalComplex::myCells
std::vector< CellMap > myCells
Definition: CubicalComplex.h:1301
DGtal::CubicalComplex::dimension
static const Dimension dimension
The dimension of the embedding space.
Definition: CubicalComplex.h:242
DGtal::functions::getSpelNeighborhoodConfigurationOccupancy
NeighborhoodConfiguration getSpelNeighborhoodConfigurationOccupancy(const TComplex &input_complex, const typename TComplex::Point &center, const std::unordered_map< typename TComplex::Point, NeighborhoodConfiguration > &mapPointToMask)
DGtal::functions::collapse
uint64_t collapse(CubicalComplex< TKSpace, TCellContainer > &K, CellConstIterator S_itB, CellConstIterator S_itE, const CellMapIteratorPriority &priority, bool hintIsSClosed=false, bool hintIsKClosed=false, bool verbose=false)
DGtal::functions::filterCellsWithinBounds
void filterCellsWithinBounds(const CubicalComplex< TKSpace, TCellContainer > &K, const typename TKSpace::Point &kLow, const typename TKSpace::Point &kUp, BdryCellOutputIterator itBdry, InnerCellOutputIterator itInner)
DGtal::functions::isEqual
bool isEqual(const Container &S1, const Container &S2)
Definition: SetFunctions.h:789
DGtal::functions::objectFromSpels
std::unique_ptr< TObject > objectFromSpels(const CubicalComplex< TKSpace, TCellContainer > &C)
DGtal::functions::isSubset
bool isSubset(const Container &S1, const Container &S2)
Definition: SetFunctions.h:845
DGtal
DGtal is the top-level namespace which contains all DGtal functions and types.
Definition: ClosedIntegerHalfPlane.h:49
DGtal::operator>=
bool operator>=(PointVector< ptDim, LeftEuclideanRing, LeftContainer > const &lhs, PointVector< ptDim, RightEuclideanRing, RightContainer > const &rhs)
Comparison operator on Points/Vectors (GreaterOrEqualThan).
DGtal::operator*
KForm< Calculus, order, duality > operator*(const typename Calculus::Scalar &scalar, const KForm< Calculus, order, duality > &form)
DGtal::operator^=
CubicalComplex< TKSpace, TCellContainer > & operator^=(CubicalComplex< TKSpace, TCellContainer > &, const CubicalComplex< TKSpace, TCellContainer > &)
Definition: CubicalComplexFunctions.h:245
DGtal::operator==
bool operator==(PointVector< ptDim, LeftEuclideanRing, LeftContainer > const &lhs, PointVector< ptDim, RightEuclideanRing, RightContainer > const &rhs)
Equality operator between two Points/Vectors.
DGtal::NeighborhoodConfiguration
uint32_t NeighborhoodConfiguration
Definition: NeighborhoodConfigurationsHelper.h:43
DGtal::operator&=
CubicalComplex< TKSpace, TCellContainer > & operator&=(CubicalComplex< TKSpace, TCellContainer > &, const CubicalComplex< TKSpace, TCellContainer > &)
Definition: CubicalComplexFunctions.h:201
DGtal::operator!=
bool operator!=(PointVector< ptDim, LeftEuclideanRing, LeftContainer > const &lhs, PointVector< ptDim, RightEuclideanRing, RightContainer > const &rhs)
Difference operator on Points/Vectors.
DGtal::operator~
CubicalComplex< TKSpace, TCellContainer > operator~(const CubicalComplex< TKSpace, TCellContainer > &)
Definition: CubicalComplexFunctions.h:61
DGtal::operator<=
bool operator<=(PointVector< ptDim, LeftEuclideanRing, LeftContainer > const &lhs, PointVector< ptDim, RightEuclideanRing, RightContainer > const &rhs)
Comparison operator on Points/Vectors (LesserOrEqualThan).
DGtal::Dimension
DGtal::uint32_t Dimension
Definition: Common.h:137
DGtal::uint64_t
boost::uint64_t uint64_t
unsigned 64-bit integer.
Definition: BasicTypes.h:65
DGtal::operator|=
CubicalComplex< TKSpace, TCellContainer > & operator|=(CubicalComplex< TKSpace, TCellContainer > &, const CubicalComplex< TKSpace, TCellContainer > &)
Definition: CubicalComplexFunctions.h:160
DGtal::operator|
CubicalComplex< TKSpace, TCellContainer > operator|(const CubicalComplex< TKSpace, TCellContainer > &, const CubicalComplex< TKSpace, TCellContainer > &)
Definition: CubicalComplexFunctions.h:139
DGtal::operator-=
CubicalComplex< TKSpace, TCellContainer > & operator-=(CubicalComplex< TKSpace, TCellContainer > &, const CubicalComplex< TKSpace, TCellContainer > &)
Definition: CubicalComplexFunctions.h:97
K
KSpace K
Definition: testCubicalComplex.cpp:62
CC
CubicalComplex< KSpace, Map > CC
Definition: testCubicalComplex.cpp:58
Generated on Sun Nov 27 2022 15:15:51 for DGtal by doxygen 1.9.5