DGtal 1.3.0
Loading...
Searching...
No Matches
Public Types | Public Member Functions | Static Public Member Functions
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 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
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 630 of file CellGeometry.h.

632 {
633 std::unordered_set<typename KSpace::Cell> cells;
634 for ( auto it = itB; it != itE; ++it )
635 {
636 auto pointel = *it;
637 cells.insert( K.uIncident( pointel, 0, true ) );
638 cells.insert( K.uIncident( pointel, 0, false ) );
639 cells.insert( K.uIncident( pointel, 1, true ) );
640 cells.insert( K.uIncident( pointel, 1, false ) );
641 cells.insert( K.uIncident( pointel, 2, true ) );
642 cells.insert( K.uIncident( pointel, 2, false ) );
643 }
644 return cells;
645 }
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 656 of file CellGeometry.h.

658 {
659 std::cout << "<1,3> specialization" << std::endl;
660 std::unordered_set<typename KSpace::Cell> cells;
661 for ( auto it = itB; it != itE; ++it )
662 {
663 auto pointel = K.uPointel( *it );
664 cells.insert( K.uIncident( pointel, 0, true ) );
665 cells.insert( K.uIncident( pointel, 0, false ) );
666 cells.insert( K.uIncident( pointel, 1, true ) );
667 cells.insert( K.uIncident( pointel, 1, false ) );
668 cells.insert( K.uIncident( pointel, 2, true ) );
669 cells.insert( K.uIncident( pointel, 2, false ) );
670 }
671 return cells;
672 }

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 683 of file CellGeometry.h.

685 {
686 UnorderedSetByBlock< typename KSpace::Point,
687 Splitter< typename KSpace::Point, uint64_t > > kpoints;
688 for ( auto it = itB; it != itE; ++it )
689 {
690 auto kp = K.uKCoords( K.uPointel( *it ) );
691 kpoints.emplace( kp[ 0 ] - 1, kp[ 1 ] , kp[ 2 ] );
692 kpoints.emplace( kp[ 0 ] + 1, kp[ 1 ] , kp[ 2 ] );
693 kpoints.emplace( kp[ 0 ] , kp[ 1 ] - 1, kp[ 2 ] );
694 kpoints.emplace( kp[ 0 ] , kp[ 1 ] + 1, kp[ 2 ] );
695 kpoints.emplace( kp[ 0 ] , kp[ 1 ] , kp[ 2 ] - 1 );
696 kpoints.emplace( kp[ 0 ] , kp[ 1 ] , kp[ 2 ] + 1 );
697 }
698 return kpoints;
699 }
PointVector< dim, Integer > Point

References K.


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