DGtal  1.4.beta
graph/volDistanceTraversal.cpp

Displays the Euclidean distance to a starting surfel on the boundary of a vol shape (traversal by mix distance/breadth-first, see DGtal::DistanceBreadthFirstVisitor).

Graph traversal with visitors
# Commands
\$ ./examples/graph/volDistanceTraversal ../examples/samples/cat10.vol 0 255 100
Coloring vertices of a vol boundary according to the Euclidean distance to a starting surfel (distance breadth-first traversal).
#include <iostream>
#include <queue>
#include "DGtal/base/BasicFunctors.h"
#include "DGtal/topology/CanonicSCellEmbedder.h"
#include "DGtal/helpers/StdDefs.h"
#include "DGtal/topology/DigitalSurface.h"
#include "DGtal/topology/LightImplicitDigitalSurface.h"
#include "DGtal/geometry/volumes/distance/LpMetric.h"
#include "DGtal/io/viewers/Viewer3D.h"
#include "DGtal/io/Color.h"
#include "DGtal/images/ImageSelector.h"
#include "DGtal/images/imagesSetsUtils/SetFromImage.h"
using namespace std;
using namespace DGtal;
using namespace Z3i;
void usage( int, char** argv )
{
std::cerr << "Usage: " << argv[ 0 ] << " <fileName.vol> <minT> <maxT> <idxP>" << std::endl;
std::cerr << "\t - displays the Euclidean distance to the specified surfel on the boundary of the shape stored in vol file <fileName.vol>." << std::endl;
std::cerr << "\t - the shape is defined implicitly: voxel v belongs to the shape iff its value I(v) follows minT < I(v) <= maxT." << std::endl;
std::cerr << "\t - starts from the <idxP>-th surfel or first one if invalid." << std::endl;
}
int main( int argc, char** argv )
{
if ( argc < 4 )
{
usage( argc, argv );
return 1;
}
std::string inputFilename = argv[ 1 ];
unsigned int minThreshold = atoi( argv[ 2 ] );
unsigned int maxThreshold = atoi( argv[ 3 ] );
unsigned int idxP = (argc <= 4) ? 0 : atoi( argv[ 4 ] );
trace.beginBlock( "Reading vol file into an image." );
DigitalSet set3d (image.domain());
minThreshold, maxThreshold);
trace.beginBlock( "Construct the Khalimsky space from the image domain." );
KSpace ks;
bool space_ok = ks.init( image.domain().lowerBound(),
image.domain().upperBound(), true );
if (!space_ok)
{
trace.error() << "Error in the Khamisky space construction."<<std::endl;
return 2;
}
trace.beginBlock( "Set up digital surface." );
SCell bel = Surfaces<KSpace>::findABel( ks, set3d, 100000 );
MyDigitalSurfaceContainer* ptrSurfContainer =
new MyDigitalSurfaceContainer( ks, set3d, surfAdj, bel );
MyDigitalSurface digSurf( ptrSurfContainer ); // acquired
// Find first bel.
MyDigitalSurface::ConstIterator it = digSurf.begin();
for ( idxP = idxP % digSurf.size(); idxP != 0; --idxP ) ++it;
bel = *it;
trace.beginBlock( "Extracting boundary by distance tracking from an initial bel." );
typedef CanonicSCellEmbedder<KSpace> SCellEmbedder;
typedef RealPoint::Coordinate Scalar;
typedef LpMetric<Space> Distance;
using DistanceToPoint = std::function<double(const Space::RealPoint &)>;
MyDistanceVisitor;
typedef MyDistanceVisitor::Node MyNode;
typedef MyDistanceVisitor::Scalar MySize;
SCellEmbedder embedder( ks );
Distance distance(2.0);
DistanceToPoint distanceToPoint = std::bind( distance, embedder( bel ), std::placeholders::_1 );
VertexFunctor vfunctor( embedder, distanceToPoint );
MyDistanceVisitor visitor( digSurf, vfunctor, bel );
unsigned long nbSurfels = 0;
MyNode node;
while ( ! visitor.finished() )
{
node = visitor.current();
++nbSurfels;
visitor.expand();
}
MySize maxDist = node.second;
trace.beginBlock( "Displaying surface in Viewer3D." );
QApplication application(argc,argv);
Viewer3D<> viewer( ks );
viewer.show();
MyDistanceVisitor visitor2( digSurf, vfunctor, bel );
viewer << SetMode3D( bel.className(), "Basic" );
viewer << CustomColors3D( Color::Black, Color::White )
<< bel;
visitor2.expand();
std::vector< MyDistanceVisitor::Node > layer;
while ( ! visitor2.finished() )
{
MyNode n = visitor2.current();
Color c = hueShade( n.second );
viewer << CustomColors3D( Color::Red, c )
<< n.first;
visitor2.expand();
}
viewer << Viewer3D<>::updateDisplay;
trace.info() << "nb surfels = " << nbSurfels << std::endl;
return application.exec();
}
DGtal::Surfaces
Aim: A utility class for constructing surfaces (i.e. set of (n-1)-cells).
Definition: Surfaces.h:78
DGtal::DigitalSurface::ConstIterator
DigitalSurfaceContainer::SurfelConstIterator ConstIterator
Definition: DigitalSurface.h:163
DGtal::SetFromImage
Aim: Define utilities to convert a digital set into an image.
Definition: SetFromImage.h:63
DGtal::functors::Composer
Aim: Define a new Functor from the composition of two other functors.
Definition: BasicFunctors.h:417
DGtal::Trace::endBlock
double endBlock()
DGtal::PointVector::Coordinate
Component Coordinate
Type for Point elements.
Definition: PointVector.h:617
DGtal::DigitalSurface
Aim: Represents a set of n-1-cells in a nD space, together with adjacency relation between these cell...
Definition: DigitalSurface.h:139
DGtal::Trace::error
std::ostream & error()
DGtal::Color
Structure representing an RGB triple with alpha component.
Definition: Color.h:67
DGtal::KhalimskySpaceND::init
bool init(const Point &lower, const Point &upper, bool isClosed)
Specifies the upper and lower bounds for the maximal cells in this space.
Aim: This class template may be used to (linearly) convert scalar values in a given range into a colo...
DGtal::trace
Trace trace
Definition: Common.h:154
DGtal::DigitalSetBoundary
Aim: A model of CDigitalSurfaceContainer which defines the digital surface as the boundary of a given...
Definition: DigitalSetBoundary.h:69
DGtal::Trace::beginBlock
void beginBlock(const std::string &keyword="")
DGtal::SignedKhalimskyCell
Represents a signed cell in a cellular grid space by its Khalimsky coordinates and a boolean value.
Definition: KhalimskySpaceND.h:208
DGtal::Trace::info
std::ostream & info()
DGtal::LightImplicitDigitalSurface
Aim: A model of CDigitalSurfaceContainer which defines the digital surface as the boundary of an impl...
Definition: LightImplicitDigitalSurface.h:115
DGtal::SignedKhalimskyCell::className
std::string className() const
Return the style name used for drawing this object.
DGtal::Viewer3D
Definition: Viewer3D.h:131
Image
ImageContainerBySTLVector< Domain, Value > Image
Definition: testSimpleRandomAccessRangeFromPoint.cpp:45
DGtal
DGtal is the top-level namespace which contains all DGtal functions and types.
Aim: This class is useful to perform an exploration of a graph given a starting point or set (called ...
DGtal::SetMode3D
Modifier class in a Display3D stream. Useful to choose your own mode for a given class....
Definition: DrawWithDisplay3DModifier.h:73
main
int main(int argc, char **argv)
Definition: testArithmeticDSS-benchmark.cpp:147
DGtal::Image
Aim: implements association bewteen points lying in a digital domain and values.
Definition: Image.h:69
usage
void usage(int, char **argv)
Definition: approximation.cpp:64
MyDigitalSurfaceContainer
DigitalSetBoundary< KSpace, DigitalSet > MyDigitalSurfaceContainer
Definition: greedy-plane-segmentation-ex2.cpp:91
DGtal::PointVector
Aim: Implements basic operations that will be used in Point and Vector classes.
Definition: PointVector.h:165
DGtal::LpMetric
Aim: implements l_p metrics.
Definition: LpMetric.h:74
Aim: implements methods to read a "Vol" file format.
DGtal::CanonicSCellEmbedder< KSpace >
RealPoint
Z2i::RealPoint RealPoint
Definition: testAstroid2D.cpp:46
Value
double Value
Definition: testSimpleRandomAccessRangeFromPoint.cpp:38
MyDigitalSurface
DigitalSurface< MyDigitalSurfaceContainer > MyDigitalSurface
Definition: greedy-plane-segmentation-ex2.cpp:92
DGtal::DigitalSetByAssociativeContainer
Aim: A wrapper class around a STL associative container for storing sets of digital points within som...
Definition: DigitalSetByAssociativeContainer.h:89
DGtal::KhalimskySpaceND
Aim: This class is a model of CCellularGridSpaceND. It represents the cubical grid as a cell complex,...
Definition: KhalimskySpaceND.h:64