DGtal 1.3.0
Loading...
Searching...
No Matches
Public Types | Public Member Functions | Static Public Member Functions
DGtal::CellGeometryFunctions< TKSpace, 2, 2 > 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==2)
 

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, 2, 2 >

Specialization for 2-cells in 2D.

Template Parameters
TKSpacean arbitrary model of CCellularGridSpaceND.

Definition at line 706 of file CellGeometry.h.

Member Typedef Documentation

◆ Cell

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

Definition at line 712 of file CellGeometry.h.

◆ KSpace

template<typename TKSpace >
typedef TKSpace DGtal::CellGeometryFunctions< TKSpace, 2, 2 >::KSpace

Definition at line 710 of file CellGeometry.h.

◆ Space

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

Definition at line 711 of file CellGeometry.h.

Member Function Documentation

◆ BOOST_CONCEPT_ASSERT()

template<typename TKSpace >
DGtal::CellGeometryFunctions< TKSpace, 2, 2 >::BOOST_CONCEPT_ASSERT ( (concepts::CCellularGridSpaceND< TKSpace >)  )

◆ BOOST_STATIC_ASSERT()

template<typename TKSpace >
DGtal::CellGeometryFunctions< TKSpace, 2, 2 >::BOOST_STATIC_ASSERT ( TKSpace::dimension  = =2)

◆ getIncidentCellsToPointels()

template<typename TKSpace >
template<typename PointelIterator >
static std::unordered_set< typename KSpace::Cell > DGtal::CellGeometryFunctions< TKSpace, 2, 2 >::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 2-cells to the given range of pointels [itB, itE).

Definition at line 722 of file CellGeometry.h.

724 {
725 std::unordered_set<typename KSpace::Cell> cells;
726 for ( auto it = itB; it != itE; ++it )
727 {
728 auto pointel = *it;
729 auto linelxp = K.uIncident( pointel, 0, true );
730 auto linelxm = K.uIncident( pointel, 0, false );
731 cells.insert( K.uIncident( linelxp, 1, true ) );
732 cells.insert( K.uIncident( linelxp, 1, false ) );
733 cells.insert( K.uIncident( linelxm, 1, true ) );
734 cells.insert( K.uIncident( linelxm, 1, false ) );
735 }
736 return cells;
737 }
KSpace K

References K.

◆ getIncidentCellsToPoints()

template<typename TKSpace >
template<typename PointIterator >
static std::unordered_set< typename KSpace::Cell > DGtal::CellGeometryFunctions< TKSpace, 2, 2 >::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 2-cells to the given range of points [itB, itE).
Note
General method. Note as efficient as specializations.

Definition at line 748 of file CellGeometry.h.

750 {
751 std::cout << "<2,2> specialization" << std::endl;
752 std::unordered_set<typename KSpace::Cell> cells;
753 for ( auto it = itB; it != itE; ++it )
754 {
755 auto pointel = K.uPointel( *it );
756 auto linelxp = K.uIncident( pointel, 0, true );
757 auto linelxm = K.uIncident( pointel, 0, false );
758 cells.insert( K.uIncident( linelxp, 1, true ) );
759 cells.insert( K.uIncident( linelxp, 1, false ) );
760 cells.insert( K.uIncident( linelxm, 1, true ) );
761 cells.insert( K.uIncident( linelxm, 1, false ) );
762 }
763 return cells;
764 }

References K.

◆ getIncidentKPointsToPoints()

template<typename TKSpace >
template<typename PointIterator >
static UnorderedSetByBlock< typename KSpace::Point, Splitter< typename KSpace::Point, uint64_t > > DGtal::CellGeometryFunctions< TKSpace, 2, 2 >::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 2-kpoints to the given range of points [itB, itE).

Definition at line 775 of file CellGeometry.h.

777 {
778 UnorderedSetByBlock< typename KSpace::Point,
779 Splitter< typename KSpace::Point, uint64_t> > kpoints;
780 for ( auto it = itB; it != itE; ++it )
781 {
782 auto kp = K.uKCoords( K.uPointel( *it ) );
783 kpoints.emplace( kp[ 0 ] - 1, kp[ 1 ] - 1 );
784 kpoints.emplace( kp[ 0 ] + 1, kp[ 1 ] - 1 );
785 kpoints.emplace( kp[ 0 ] - 1, kp[ 1 ] + 1 );
786 kpoints.emplace( kp[ 0 ] + 1, kp[ 1 ] + 1 );
787 }
788 return kpoints;
789 }
PointVector< dim, Integer > Point

References K.


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