DGtal 1.3.0
Loading...
Searching...
No Matches
Functions
viewMarchingCubes.cpp File Reference
#include <iostream>
#include <queue>
#include "DGtal/base/Common.h"
#include "DGtal/kernel/CanonicEmbedder.h"
#include "DGtal/io/readers/VolReader.h"
#include "DGtal/images/ImageSelector.h"
#include "DGtal/images/imagesSetsUtils/SetFromImage.h"
#include "DGtal/images/ImageLinearCellEmbedder.h"
#include "DGtal/shapes/Shapes.h"
#include "DGtal/helpers/StdDefs.h"
#include "DGtal/topology/helpers/Surfaces.h"
#include "DGtal/topology/DigitalSurface.h"
#include "DGtal/topology/SetOfSurfels.h"
#include "DGtal/shapes/Mesh.h"
#include "DGtal/shapes/TriangulatedSurface.h"
#include "DGtal/shapes/MeshHelpers.h"
#include "DGtal/io/viewers/Viewer3D.h"

Go to the source code of this file.

Functions

void usage (int, char **argv)
 
int main (int argc, char **argv)
 

Detailed Description

Author
Jacques-Olivier Lachaud (jacqu.nosp@m.es-o.nosp@m.livie.nosp@m.r.la.nosp@m.chaud.nosp@m.@uni.nosp@m.v-sav.nosp@m.oie..nosp@m.fr ) Laboratory of Mathematics (CNRS, UMR 5127), University of Savoie, France
Date
2012/02/06

An example file named viewMarchingCubes to display an isosurface from a vol file.

This file is part of the DGtal library.

Definition in file viewMarchingCubes.cpp.

Function Documentation

◆ main()

int main ( int  argc,
char **  argv 
)

[viewMarchingCubes-readVol]

[viewMarchingCubes-readVol]

[viewMarchingCubes-KSpace]

[viewMarchingCubes-KSpace]

[viewMarchingCubes-SurfelAdjacency]

[viewMarchingCubes-SurfelAdjacency]

[viewMarchingCubes-ExtractingSurface]

[viewMarchingCubes-ExtractingSurface]

[viewMarchingCubes-makingMesh]

[viewMarchingCubes-makingMesh]

Definition at line 55 of file viewMarchingCubes.cpp.

56{
57 if ( argc < 5 )
58 {
59 usage( argc, argv );
60 return 1;
61 }
62 std::string inputFilename = argv[ 1 ];
63 unsigned int minThreshold = atoi( argv[ 2 ] );
64 unsigned int maxThreshold = argc > 3 ? atoi( argv[ 3 ] ) : 255;
65 bool intAdjacency = argc > 4 ? (atoi( argv[ 4 ] ) == 0) : true;
66
68
70 trace.beginBlock( "Reading vol file into an image." );
71 Image image = VolReader<Image>::importVol(inputFilename);
72 DigitalSet set3d (image.domain());
74 minThreshold, maxThreshold);
77
78
80 trace.beginBlock( "Construct the Khalimsky space from the image domain." );
81 KSpace ks;
82 bool space_ok = ks.init( image.domain().lowerBound(),
83 image.domain().upperBound(), true );
84 if (!space_ok)
85 {
86 trace.error() << "Error in the Khamisky space construction."<<std::endl;
87 return 2;
88 }
91
93 typedef SurfelAdjacency<KSpace::dimension> MySurfelAdjacency;
94 MySurfelAdjacency surfAdj( intAdjacency ); // interior in all directions.
96
98 trace.beginBlock( "Extracting boundary by scanning the space. " );
100 typedef SetOfSurfels< KSpace, SurfelSet > MySetOfSurfels;
102 MySetOfSurfels theSetOfSurfels( ks, surfAdj );
103 Surfaces<KSpace>::sMakeBoundary( theSetOfSurfels.surfelSet(),
104 ks, set3d,
105 image.domain().lowerBound(),
106 image.domain().upperBound() );
107 MyDigitalSurface digSurf( theSetOfSurfels );
108 trace.info() << "Digital surface has " << digSurf.size() << " surfels."
109 << std::endl;
110 trace.endBlock();
112
114 trace.beginBlock( "Making triangulated surface. " );
115 typedef CanonicEmbedder< Space > TrivialEmbedder;
117 typedef CellEmbedder::Value RealPoint;
119 typedef Mesh< RealPoint > ViewMesh;
120 typedef std::map< MyDigitalSurface::Vertex, TriMesh::Index > VertexMap;
121 TriMesh trimesh;
122 ViewMesh viewmesh;
123 TrivialEmbedder trivialEmbedder;
124 CellEmbedder cellEmbedder;
125 // The +0.5 is to avoid isosurface going exactly through a voxel
126 // center, especially for binary volumes.
127 cellEmbedder.init( ks, image, trivialEmbedder,
128 ( (double) minThreshold ) + 0.5 );
129 VertexMap vmap; // stores the map Vertex -> Index
131 ( digSurf, cellEmbedder, trimesh, vmap );
132 trace.info() << "Triangulated surface is " << trimesh << std::endl;
133 MeshHelpers::triangulatedSurface2Mesh( trimesh, viewmesh );
134 trace.info() << "Mesh has " << viewmesh.nbVertex()
135 << " vertices and " << viewmesh.nbFaces() << " faces." << std::endl;
136 trace.endBlock();
138
139 QApplication application(argc,argv);
140 Viewer3D<> viewer;
141 viewer.show();
142 viewer.setLineColor(Color(150,0,0,254));
143 viewer << viewmesh;
144 viewer << Viewer3D<>::updateDisplay;
145 application.exec();
146
147}
Structure representing an RGB triple with alpha component.
Definition: Color.h:68
Aim: A wrapper class around a STL associative container for storing sets of digital points within som...
Aim: Represents a set of n-1-cells in a nD space, together with adjacency relation between these cell...
virtual void setLineColor(DGtal::Color aColor)
Aim: a cellular embedder for images. (default constructible, copy constructible, assignable)....
Aim: implements association bewteen points lying in a digital domain and values.
Definition: Image.h:70
Aim: This class is a model of CCellularGridSpaceND. It represents the cubical grid as a cell complex,...
std::set< SCell > SurfelSet
Preferred type for defining a set of surfels (always signed cells).
bool init(const Point &lower, const Point &upper, bool isClosed)
Specifies the upper and lower bounds for the maximal cells in this space.
static void digitalSurface2DualTriangulatedSurface(const DigitalSurface< DigitalSurfaceContainer > &dsurf, const CellEmbedder &cembedder, TriangulatedSurface< typename CellEmbedder::Value > &trisurf, VertexMap &vertexmap)
static void triangulatedSurface2Mesh(const TriangulatedSurface< Point > &trisurf, Mesh< Point > &mesh)
Aim: This class is defined to represent a surface mesh through a set of vertices and faces....
Definition: Mesh.h:92
Aim: A model of CDigitalSurfaceContainer which defines the digital surface as connected surfels....
Definition: SetOfSurfels.h:74
static void sMakeBoundary(SCellSet &aBoundary, const KSpace &aKSpace, const PointPredicate &pp, const Point &aLowerBound, const Point &aUpperBound)
Aim: Represent adjacencies between surfel elements, telling if it follows an interior to exterior ord...
void beginBlock(const std::string &keyword="")
std::ostream & error()
std::ostream & info()
double endBlock()
Aim: Represents a triangulated surface. The topology is stored with a half-edge data structure....
virtual void show()
Overload QWidget method in order to add a call to updateList() method (to ensure that the lists are w...
DigitalSurface< MyDigitalSurfaceContainer > MyDigitalSurface
MyDigitalSurface::SurfelSet SurfelSet
Space::RealPoint RealPoint
Definition: StdDefs.h:170
Trace trace
Definition: Common.h:154
Aim: A trivial embedder for digital points, which corresponds to the canonic injection of Zn into Rn.
ImageContainerBySTLVector< Domain, Value > Type
Definition: ImageSelector.h:78
Aim: Define utilities to convert a digital set into an image.
Definition: SetFromImage.h:64
static ImageContainer importVol(const std::string &filename, const Functor &aFunctor=Functor())
TriangulatedSurface< RealPoint > TriMesh

References DGtal::Trace::beginBlock(), DGtal::MeshHelpers::digitalSurface2DualTriangulatedSurface(), DGtal::DigitalSetByAssociativeContainer< TDomain, TContainer >::domain(), DGtal::Trace::endBlock(), DGtal::Trace::error(), DGtal::VolReader< TImageContainer, TFunctor >::importVol(), DGtal::Trace::info(), DGtal::KhalimskySpaceND< dim, TInteger >::init(), DGtal::Display3D< Space, KSpace >::setLineColor(), DGtal::Viewer3D< TSpace, TKSpace >::show(), DGtal::DigitalSurface< TDigitalSurfaceContainer >::size(), DGtal::Surfaces< TKSpace >::sMakeBoundary(), DGtal::trace, and DGtal::MeshHelpers::triangulatedSurface2Mesh().

◆ usage()

void usage ( int  ,
char **  argv 
)

Definition at line 43 of file viewMarchingCubes.cpp.

44{
45 std::cerr << "Usage: " << argv[ 0 ] << " <fileName.vol> <minT> [<maxT>=255] [<Adj>=0]" << std::endl;
46 std::cerr << "\t - displays the boundary of the shape stored in vol file <fileName.vol>" << std::endl;
47 std::cerr << "\t as a Marching-Cube triangulated surface (more precisely a dual" << std::endl;
48 std::cerr << "\t surface to the digital boundary)." << std::endl;
49 std::cerr << "\t - voxel v belongs to the shape iff its value I(v) follows minT < I(v) <= maxT." << std::endl;
50 std::cerr << "\t - minT is the iso-surface level." << std::endl;
51 std::cerr << "\t - maxT should be equal to the maximum possible value in the image." << std::endl;
52 std::cerr << "\t - 0: interior adjacency, 1: exterior adjacency (rules used to connect surface elements unambiguously)." << std::endl;
53}