DGtal  0.9.3
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/ExactPredicateLpSeparableMetric.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.
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 std::binder1st< Distance > DistanceToPoint;
MyDistanceVisitor;
typedef MyDistanceVisitor::Node MyNode;
typedef MyDistanceVisitor::Scalar MySize;
SCellEmbedder embedder( ks );
Distance distance;
DistanceToPoint distanceToPoint = std::bind1st( distance, embedder( bel ) );
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();
}