DGtal 2.0.0
Loading...
Searching...
No Matches
DGtal::CellGeometryFunctions< TKSpace, 1, 3 > Struct Template Reference

#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::CellgetIncidentCellsToPointels (const KSpace &K, PointelIterator itB, PointelIterator itE)
 
template<typename PointIterator >
static std::unordered_set< typename KSpace::CellgetIncidentCellsToPoints (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
TKSpacean arbitrary model of CCellularGridSpaceND.

Definition at line 622 of file CellGeometry.h.

Member Typedef Documentation

◆ Cell

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

Definition at line 628 of file CellGeometry.h.

◆ KSpace

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

Definition at line 626 of file CellGeometry.h.

◆ Space

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

Definition at line 627 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
PointelIteratorany model of forward iterator on pointels.
Parameters
Ka valid cellular grid space large enough to hold the cells.
itBthe start of a range of pointels.
itEpast the end of a range of pointels.
Returns
the incident 1-cells to the given range of pointels [itB, itE).

Definition at line 638 of file CellGeometry.h.

640 {
641 std::unordered_set<typename KSpace::Cell> cells;
642 for ( auto it = itB; it != itE; ++it )
643 {
644 auto pointel = *it;
645 cells.insert( K.uIncident( pointel, 0, true ) );
646 cells.insert( K.uIncident( pointel, 0, false ) );
647 cells.insert( K.uIncident( pointel, 1, true ) );
648 cells.insert( K.uIncident( pointel, 1, false ) );
649 cells.insert( K.uIncident( pointel, 2, true ) );
650 cells.insert( K.uIncident( pointel, 2, false ) );
651 }
652 return cells;
653 }
KSpace K

References K.

◆ 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
PointIteratorany model of forward iterator on points.
Parameters
Ka valid cellular grid space large enough to hold the cells.
itBthe start of a range of points.
itEpast 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 664 of file CellGeometry.h.

666 {
667 std::cout << "<1,3> specialization" << std::endl;
668 std::unordered_set<typename KSpace::Cell> cells;
669 for ( auto it = itB; it != itE; ++it )
670 {
671 auto pointel = K.uPointel( *it );
672 cells.insert( K.uIncident( pointel, 0, true ) );
673 cells.insert( K.uIncident( pointel, 0, false ) );
674 cells.insert( K.uIncident( pointel, 1, true ) );
675 cells.insert( K.uIncident( pointel, 1, false ) );
676 cells.insert( K.uIncident( pointel, 2, true ) );
677 cells.insert( K.uIncident( pointel, 2, false ) );
678 }
679 return cells;
680 }

References K.

◆ 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
PointIteratorany model of forward iterator on points.
Parameters
Ka valid cellular grid space large enough to hold the cells.
itBthe start of a range of points.
itEpast the end of a range of points.
Returns
the incident 1-kpoints to the given range of points [itB, itE).

Definition at line 691 of file CellGeometry.h.

693 {
694 UnorderedSetByBlock< typename KSpace::Point,
695 Splitter< typename KSpace::Point, uint64_t > > kpoints;
696 for ( auto it = itB; it != itE; ++it )
697 {
698 auto kp = K.uKCoords( K.uPointel( *it ) );
699 kpoints.emplace( kp[ 0 ] - 1, kp[ 1 ] , kp[ 2 ] );
700 kpoints.emplace( kp[ 0 ] + 1, kp[ 1 ] , kp[ 2 ] );
701 kpoints.emplace( kp[ 0 ] , kp[ 1 ] - 1, kp[ 2 ] );
702 kpoints.emplace( kp[ 0 ] , kp[ 1 ] + 1, kp[ 2 ] );
703 kpoints.emplace( kp[ 0 ] , kp[ 1 ] , kp[ 2 ] - 1 );
704 kpoints.emplace( kp[ 0 ] , kp[ 1 ] , kp[ 2 ] + 1 );
705 }
706 return kpoints;
707 }
PointVector< dim, Integer > Point

References K.


The documentation for this struct was generated from the following file: