DGtal  1.0.0
testTriangulatedSurface.cpp
Go to the documentation of this file.
1 
30 #include <iostream>
32 #include <algorithm>
33 #include "DGtal/base/Common.h"
34 #include "ConfigTest.h"
35 #include "DGtalCatch.h"
36 #include "DGtal/helpers/StdDefs.h"
37 #include "DGtal/kernel/PointVector.h"
38 #include "DGtal/graph/CUndirectedSimpleGraph.h"
39 #include "DGtal/graph/BreadthFirstVisitor.h"
40 #include "DGtal/shapes/TriangulatedSurface.h"
41 #include "DGtal/shapes/MeshHelpers.h"
43 
44 using namespace std;
45 using namespace DGtal;
46 
48 // Functions for testing class TriangulatedSurface.
50 
55 typedef TriMesh::Arc ArcT; //Arc already defined in wingdi.h
59 
61 {
62  TriMesh mesh;
63  mesh.addVertex( RealPoint( 0, 0, 0 ) );
64  mesh.addVertex( RealPoint( 1, 0, 0 ) );
65  mesh.addVertex( RealPoint( 0, 1, 0 ) );
66  mesh.addVertex( RealPoint( 1, 1, 1 ) );
67  mesh.addTriangle( 0, 1, 2 );
68  mesh.addTriangle( 2, 1, 3 );
69  mesh.build();
70  return mesh;
71 }
72 
73 SCENARIO( "TriangulatedSurface< RealPoint3 > build tests", "[trisurf][build]" )
74 {
75  GIVEN( "Two triangles incident by an edge" ) {
76  TriMesh trimesh = makeTwoTriangles();
77  THEN( "The mesh has 4 vertices, v0 has 2 neighbors, v1 has 3 neighbors, etc" ) {
78  REQUIRE( trimesh.size() == 4 );
79  REQUIRE( trimesh.degree( 0 ) == 2 );
80  REQUIRE( trimesh.degree( 1 ) == 3 );
81  REQUIRE( trimesh.degree( 2 ) == 3 );
82  REQUIRE( trimesh.degree( 3 ) == 2 );
83  }
84  THEN( "Euler number is 1 as is the Euler number of a disk." )
85  {
86  REQUIRE( trimesh.nbVertices() == 4 );
87  REQUIRE( trimesh.nbEdges() == 5 );
88  REQUIRE( trimesh.nbFaces() == 2 );
89  REQUIRE( trimesh.Euler() == 1 );
90  }
91  THEN( "Breadth-first visiting the mesh from vertex 3, visit 3, then {1,2}, then 0." )
92  {
93  BreadthFirstVisitor< TriMesh > visitor( trimesh, 3 );
94  std::vector<unsigned long> vertices;
95  std::vector<unsigned long> distances;
96  while ( ! visitor.finished() )
97  {
98  vertices.push_back( visitor.current().first );
99  distances.push_back( visitor.current().second );
100  visitor.expand();
101  }
102  REQUIRE( vertices.size() == 4 );
103  REQUIRE( distances.size() == 4 );
104  int expected_vertices1[] = { 3, 1, 2, 0};
105  int expected_vertices2[] = { 3, 2, 1, 0};
106  int expected_distance [] = { 0, 1, 1, 2};
107  bool vertices_ok
108  = std::equal( vertices.begin(), vertices.end(), expected_vertices1 )
109  || std::equal( vertices.begin(), vertices.end(), expected_vertices2 );
110  REQUIRE( vertices_ok );
111  bool distances_ok
112  = std::equal( distances.begin(), distances.end(), expected_distance );
113  REQUIRE( distances_ok );
114  }
115  THEN( "The mesh has 4 boundary vertices" ) {
116  VertexRange bv = trimesh.allBoundaryVertices();
117  std::sort( bv.begin(), bv.end() );
118  int expected_bv [] = { 0, 1, 2, 3};
119  REQUIRE( bv.size() == 4 );
120  bool bv_ok = std::equal( bv.begin(), bv.end(), expected_bv );
121  REQUIRE( bv_ok );
122  }
123  THEN( "The mesh has 4 boundary arcs" ) {
124  ArcRange ba = trimesh.allBoundaryArcs();
125  REQUIRE( ba.size() == 4 );
126  }
127  THEN( "The face along (1,2) is a triangle (0,1,2)" ) {
128  ArcT a12 = trimesh.arc( 1, 2 );
129  Face f = trimesh.faceAroundArc( a12 );
130  ArcRange A = trimesh.arcsAroundFace( f );
131  VertexRange T = trimesh.verticesAroundFace( f );
132  REQUIRE( A.size() == 3 );
133  REQUIRE( T.size() == 3 );
134  REQUIRE( trimesh.head( A[ 0 ] ) == T[ 0 ] );
135  REQUIRE( trimesh.head( A[ 1 ] ) == T[ 1 ] );
136  REQUIRE( trimesh.head( A[ 2 ] ) == T[ 2 ] );
137  std::sort( T.begin(), T.end() );
138  REQUIRE( T[ 0 ] == 0 );
139  REQUIRE( T[ 1 ] == 1 );
140  REQUIRE( T[ 2 ] == 2 );
141  }
142  THEN( "The face along (2,1) is a triangle (2,1,3)" ) {
143  ArcT a21 = trimesh.arc( 2, 1 );
144  Face f = trimesh.faceAroundArc( a21 );
145  VertexRange T = trimesh.verticesAroundFace( f );
146  REQUIRE( T.size() == 3 );
147  std::sort( T.begin(), T.end() );
148  REQUIRE( T[ 0 ] == 1 );
149  REQUIRE( T[ 1 ] == 2 );
150  REQUIRE( T[ 2 ] == 3 );
151  }
152  THEN( "The mesh has the barycenter (0.5, 0.5, 0.25) " ) {
153  PositionsMap positions = trimesh.positions();
154  RealPoint b;
155  for ( Vertex v = 0; v < trimesh.size(); ++v )
156  b += positions( v );
157  b /= 4;
158  REQUIRE( b[ 0 ] == 0.5 );
159  REQUIRE( b[ 1 ] == 0.5 );
160  REQUIRE( b[ 2 ] == 0.25 );
161  }
162  THEN( "We can convert the triangulated surface to a mesh and vice versa" ) {
163  Mesh<RealPoint> mesh;
164  MeshHelpers::triangulatedSurface2Mesh( trimesh, mesh );
165  TriMesh trimesh2;
166  MeshHelpers::mesh2TriangulatedSurface( mesh, trimesh2 );
167  REQUIRE( mesh.nbVertex() == trimesh.nbVertices() );
168  REQUIRE( mesh.nbFaces() == trimesh.nbFaces() );
169  REQUIRE( trimesh2.nbVertices() == trimesh.nbVertices() );
170  REQUIRE( trimesh2.nbArcs() == trimesh.nbArcs() );
171  REQUIRE( trimesh2.nbFaces() == trimesh.nbFaces() );
172  }
173  THEN( "We can iterate over the vertices" ) {
174  PositionsMap positions = trimesh.positions();
175  RealPoint exp_positions[] = { { 0,0,0 }, { 1,0,0 }, { 0,1,0 }, { 1,1,1 } };
176  for ( auto it = trimesh.begin(), itE = trimesh.end(); it != itE; ++it ) {
177  REQUIRE( positions[ *it ] == exp_positions[ *it ] );
178  }
179  }
180  }
181 }
182 
183 SCENARIO( "TriangulatedSurface< RealPoint3 > concept check tests", "[trisurf][concepts]" )
184 {
185  BOOST_CONCEPT_ASSERT(( concepts::CUndirectedSimpleGraph< TriMesh > ));
186 }
187 
Size nbVertex() const
Arc arc(const Vertex &t, const Vertex &h) const
TriMesh::VertexRange VertexRange
VertexIndex addVertex(const Point &vdata)
ConstIterator begin() const
Size degree(const Vertex &v) const
const Node & current() const
Aim: This class is defined to represent a surface mesh through a set of vertices and faces....
Definition: Mesh.h:91
TriMesh::Face Face
PointVector< 3, double > RealPoint
TriMesh::Arc ArcT
FaceIndex addTriangle(VertexIndex v0, VertexIndex v1, VertexIndex v2)
Size nbFaces() const
REQUIRE(domain.isInside(aPoint))
Face faceAroundArc(const Arc &a) const
Aim: Represents a triangulated surface. The topology is stored with a half-edge data structure....
TriMesh::PositionsMap PositionsMap
SCENARIO("TriangulatedSurface< RealPoint3 > build tests", "[trisurf][build]")
VertexRange verticesAroundFace(const Face &f) const
TriMesh::Vertex Vertex
std::vector< Vertex > VertexRange
ArcRange allBoundaryArcs() const
DGtal is the top-level namespace which contains all DGtal functions and types.
HalfEdgeDataStructure::HalfEdgeIndex Arc
Aim: Represents the concept of local graph: each vertex has neighboring vertices, but we do not neces...
Aim: This class is useful to perform a breadth-first exploration of a graph given a starting point or...
TriangulatedSurface< RealPoint > TriMesh
TriMesh makeTwoTriangles()
ArcRange arcsAroundFace(const Face &f) const
HalfEdgeDataStructure::FaceIndex Face
GIVEN("A cubical complex with random 3-cells")
TriMesh::ArcRange ArcRange
VertexRange allBoundaryVertices() const
Vertex head(const Arc &a) const