File failed to load: https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.3/config/TeX-MML-AM_CHTML/MathJax.js
DGtal 2.0.0
DGtal::CellGeometryFunctions< TKSpace, 1, 3 > Struct Template Reference

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

Inheritance diagram for DGtal::CellGeometryFunctions< TKSpace, 1, 3 >:
[legend]

Public Types

typedef TKSpace KSpace
typedef KSpace::Space Space
typedef KSpace::Cell Cell
typedef KSpace::Point Point

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

Member Typedef Documentation

◆ Cell

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

Definition at line 616 of file CellGeometry.h.

◆ KSpace

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

Definition at line 614 of file CellGeometry.h.

◆ Point

Definition at line 435 of file CellGeometry.h.

◆ Space

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

Definition at line 615 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>
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 626 of file CellGeometry.h.

628 {
630 for ( auto it = itB; it != itE; ++it )
631 {
632 auto pointel = *it;
633 cells.insert( K.uIncident( pointel, 0, true ) );
634 cells.insert( K.uIncident( pointel, 0, false ) );
635 cells.insert( K.uIncident( pointel, 1, true ) );
636 cells.insert( K.uIncident( pointel, 1, false ) );
637 cells.insert( K.uIncident( pointel, 2, true ) );
638 cells.insert( K.uIncident( pointel, 2, false ) );
639 }
640 return cells;
641 }

References K.

◆ getIncidentCellsToPoints()

template<typename TKSpace>
template<typename PointIterator>
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 652 of file CellGeometry.h.

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

References K.

◆ getIncidentKPointsToPoints()

template<typename TKSpace>
template<typename PointIterator>
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 679 of file CellGeometry.h.

681 {
684 for ( auto it = itB; it != itE; ++it )
685 {
686 auto kp = K.uKCoords( K.uPointel( *it ) );
687 kpoints.emplace( kp[ 0 ] - 1, kp[ 1 ] , kp[ 2 ] );
688 kpoints.emplace( kp[ 0 ] + 1, kp[ 1 ] , kp[ 2 ] );
689 kpoints.emplace( kp[ 0 ] , kp[ 1 ] - 1, kp[ 2 ] );
690 kpoints.emplace( kp[ 0 ] , kp[ 1 ] + 1, kp[ 2 ] );
691 kpoints.emplace( kp[ 0 ] , kp[ 1 ] , kp[ 2 ] - 1 );
692 kpoints.emplace( kp[ 0 ] , kp[ 1 ] , kp[ 2 ] + 1 );
693 }
694 return kpoints;
695 }

References K.


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