#include <DGtal/geometry/volumes/CellGeometry.h>

Public Types
typedef TKSpace	KSpace

typedef KSpace::Space	Space

typedef KSpace::Cell	Cell

Public Member Functions
	BOOST_CONCEPT_ASSERT ((concepts::CCellularGridSpaceND< TKSpace >))

	BOOST_STATIC_ASSERT (TKSpace::dimension==3)

Static Public Member Functions
template<typename PointelIterator >
static std::unordered_set< typename KSpace::Cell >	getIncidentCellsToPointels (const KSpace &K, PointelIterator itB, PointelIterator itE)

template<typename PointIterator >
static std::unordered_set< typename KSpace::Cell >	getIncidentCellsToPoints (const KSpace &K, PointIterator itB, PointIterator itE)

template<typename PointIterator >
static UnorderedSetByBlock< typename KSpace::Point, Splitter< typename KSpace::Point, uint64_t > >	getIncidentKPointsToPoints (const KSpace &K, PointIterator itB, PointIterator itE)

Detailed Description

template<typename TKSpace>
struct DGtal::CellGeometryFunctions< TKSpace, 1, 3 >

Specialization for 1-cells in 3D.

Template Parameters

TKSpace an arbitrary model of CCellularGridSpaceND.

Definition at line 614 of file CellGeometry.h.

Member Typedef Documentation

◆ Cell

template<typename TKSpace >

typedef KSpace::Cell DGtal::CellGeometryFunctions< TKSpace, 1, 3 >::Cell

Definition at line 620 of file CellGeometry.h.

◆ KSpace

template<typename TKSpace >

typedef TKSpace DGtal::CellGeometryFunctions< TKSpace, 1, 3 >::KSpace

Definition at line 618 of file CellGeometry.h.

◆ Space

template<typename TKSpace >

typedef KSpace::Space DGtal::CellGeometryFunctions< TKSpace, 1, 3 >::Space

Definition at line 619 of file CellGeometry.h.

Member Function Documentation

◆ BOOST_CONCEPT_ASSERT()

template<typename TKSpace >

DGtal::CellGeometryFunctions< TKSpace, 1, 3 >::BOOST_CONCEPT_ASSERT ( (concepts::CCellularGridSpaceND< TKSpace >) )

◆ BOOST_STATIC_ASSERT()

template<typename TKSpace >

DGtal::CellGeometryFunctions< TKSpace, 1, 3 >::BOOST_STATIC_ASSERT ( TKSpace::dimension = =3 )

◆ getIncidentCellsToPointels()

template<typename TKSpace >

template<typename PointelIterator >

static std::unordered_set<typename KSpace::Cell> DGtal::CellGeometryFunctions< TKSpace, 1, 3 >::getIncidentCellsToPointels	(	const KSpace &	K,
		PointelIterator	itB,
		PointelIterator	itE
	)

inlinestatic

Template Parameters

PointelIterator any model of forward iterator on pointels.

Parameters

K	a valid cellular grid space large enough to hold the cells.
itB	the start of a range of pointels.
itE	past the end of a range of pointels.

Returns: the incident 1-cells to the given range of pointels [itB, itE).

Definition at line 630 of file CellGeometry.h.

     {
       std::unordered_set<typename KSpace::Cell> cells;
       for ( auto it = itB; it != itE; ++it )
         {
           auto pointel = *it;
           cells.insert( K.uIncident( pointel, 0, true ) );
           cells.insert( K.uIncident( pointel, 0, false ) );
           cells.insert( K.uIncident( pointel, 1, true ) );
           cells.insert( K.uIncident( pointel, 1, false ) );
           cells.insert( K.uIncident( pointel, 2, true ) );
           cells.insert( K.uIncident( pointel, 2, false ) );
         }
       return cells;
     }

References K, and DGtal::KhalimskySpaceND< dim, TInteger >::uIncident().

◆ getIncidentCellsToPoints()

template<typename TKSpace >

template<typename PointIterator >

static std::unordered_set<typename KSpace::Cell> DGtal::CellGeometryFunctions< TKSpace, 1, 3 >::getIncidentCellsToPoints	(	const KSpace &	K,
		PointIterator	itB,
		PointIterator	itE
	)

inlinestatic

Template Parameters

PointIterator any model of forward iterator on points.

Parameters

K	a valid cellular grid space large enough to hold the cells.
itB	the start of a range of points.
itE	past the end of a range of points.

Returns: the incident 1-cells to the given range of points [itB, itE).

Note: General method. Note as efficient as specializations.

Definition at line 656 of file CellGeometry.h.

     {
       std::cout << "<1,3> specialization" << std::endl;
       std::unordered_set<typename KSpace::Cell> cells;
       for ( auto it = itB; it != itE; ++it )
         {
           auto pointel = K.uPointel( *it );
           cells.insert( K.uIncident( pointel, 0, true ) );
           cells.insert( K.uIncident( pointel, 0, false ) );
           cells.insert( K.uIncident( pointel, 1, true ) );
           cells.insert( K.uIncident( pointel, 1, false ) );
           cells.insert( K.uIncident( pointel, 2, true ) );
           cells.insert( K.uIncident( pointel, 2, false ) );
         }
       return cells;
     }

References K, DGtal::KhalimskySpaceND< dim, TInteger >::uIncident(), and DGtal::KhalimskySpaceND< dim, TInteger >::uPointel().

◆ getIncidentKPointsToPoints()

template<typename TKSpace >

template<typename PointIterator >

static UnorderedSetByBlock< typename KSpace::Point, Splitter< typename KSpace::Point, uint64_t > > DGtal::CellGeometryFunctions< TKSpace, 1, 3 >::getIncidentKPointsToPoints	(	const KSpace &	K,
		PointIterator	itB,
		PointIterator	itE
	)

inlinestatic

Template Parameters

PointIterator any model of forward iterator on points.

Parameters

K	a valid cellular grid space large enough to hold the cells.
itB	the start of a range of points.
itE	past the end of a range of points.

Returns: the incident 1-kpoints to the given range of points [itB, itE).

Definition at line 683 of file CellGeometry.h.

     {
       UnorderedSetByBlock< typename KSpace::Point,
                            Splitter< typename KSpace::Point, uint64_t > > kpoints;
       for ( auto it = itB; it != itE; ++it )
         {
           auto kp = K.uKCoords( K.uPointel( *it ) );
           kpoints.emplace( kp[ 0 ] - 1, kp[ 1 ]    , kp[ 2 ]     );
           kpoints.emplace( kp[ 0 ] + 1, kp[ 1 ]    , kp[ 2 ]     );
           kpoints.emplace( kp[ 0 ]    , kp[ 1 ] - 1, kp[ 2 ]     );
           kpoints.emplace( kp[ 0 ]    , kp[ 1 ] + 1, kp[ 2 ]     );
           kpoints.emplace( kp[ 0 ]    , kp[ 1 ]    , kp[ 2 ] - 1 );
           kpoints.emplace( kp[ 0 ]    , kp[ 1 ]    , kp[ 2 ] + 1 );
         }
       return kpoints;
     }