traverse_cells.cpp 6.24 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
/*******************************************************************************
* CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps  *
* version 0.1                                                                  *
* Copyright (C) 2009-2012, IGG Team, LSIIT, University of Strasbourg           *
*                                                                              *
* This library is free software; you can redistribute it and/or modify it      *
* under the terms of the GNU Lesser General Public License as published by the *
* Free Software Foundation; either version 2.1 of the License, or (at your     *
* option) any later version.                                                   *
*                                                                              *
* This library is distributed in the hope that it will be useful, but WITHOUT  *
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or        *
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License  *
* for more details.                                                            *
*                                                                              *
* You should have received a copy of the GNU Lesser General Public License     *
* along with this library; if not, write to the Free Software Foundation,      *
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301 USA.           *
*                                                                              *
* Web site: http://cgogn.unistra.fr/                                           *
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/


#include "Topology/generic/parameters.h"
#include "Topology/map/embeddedMap2.h"
#include "Algo/Tiling/Surface/square.h"
Sylvain Thery's avatar
Sylvain Thery committed
29
#include "Algo/Geometry/area.h"
30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57

using namespace CGoGN ;

/**
 * Struct that contains some informations about the types of the manipulated objects
 * Mainly here to be used by the algorithms that are parameterized by it
 */
struct PFP: public PFP_STANDARD
{
	// definition of the type of the map
	typedef EmbeddedMap2 MAP;
};

// some typedef shortcuts
typedef PFP::MAP MAP ;				// map type
typedef PFP::MAP::IMPL MAP_IMPL ;	// map implementation
typedef PFP::VEC3 VEC3 ;			// type of R³ vector 


int main()
{
	// declare a map to handle the mesh
	MAP myMap;

	// add position attribute on vertices and get handler on it
	VertexAttribute<VEC3, MAP_IMPL> position = myMap.addAttribute<VEC3, VERTEX>("position");

	// create a topo grid of 2x2 squares
Sylvain Thery's avatar
Sylvain Thery committed
58
	Algo::Surface::Tilings::Square::Grid<PFP> grid(myMap, 4, 4, true);
59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101

	// and embed it using position attribute
    grid.embedIntoGrid(position, 1.,1.,0.);

	// ALGO:
	// foreach vertex of the map
	//    print position of the vertex

	// 4 versions 	

	// low level traversal using pure topo
	DartMarker<MAP> dm(myMap);
	for (Dart d = myMap.begin(); d != myMap.end(); myMap.next(d)) // traverse all darts of map
	{
		if (!dm.isMarked(d))			// is dart not marked ?
		{
			dm.markOrbit<VERTEX>(d);	// mark all dart of vertex orbit to be sure to not traverse it again
			std::cout << d << " : " << position[d]<< " / ";
		}
	}
	std::cout <<  std::endl;


	// low level traversal using cell marking (use marker on embedding is available)
	CellMarker<MAP,VERTEX> cm(myMap);
	for (Dart d = myMap.begin(); d != myMap.end(); myMap.next(d))
	{
		if (!cm.isMarked(d))	// is dart of the vertex cell not marked ?
		{
			cm.mark(d);			// 
			std::cout << d << " : " << position[d]<< " / ";
		}
	}
	std::cout <<  std::endl;


	// using traversal
	TraversorV<MAP> tv(myMap);	// alias for Traversor<MAP,VERTEX> 
	for (Dart d=tv.begin(); d!=tv.end(); d=tv.next())// traverse all vertices (d one dart of each vertex)
		std::cout << d << " : " << position[d]<< " / ";
	std::cout <<  std::endl;


102 103 104
	//using foreach function (C++11 lambda expression)
	foreach_cell<VERTEX>(myMap,[&](Vertex v) // for each Vertex v of the MAP myMap
	{
105
		std::cout << v << " : " << position[v]<< " / ";
106
	});
Sylvain Thery's avatar
Sylvain Thery committed
107
	// warning here v is a Vertex and not a Dart (but can cast automatically into)
108

109
	std::cout <<  std::endl;
Sylvain Thery's avatar
Sylvain Thery committed
110 111 112 113 114 115 116


	// example of parallel traversal of cells
	Parallel::foreach_cell<VERTEX>(myMap,[&](Vertex v, unsigned int thread) // for each Vertex v of the MAP myMap
	{
		position[v] += VEC3(0.0,0.0,PFP::REAL(thread)*0.1f);
		// WARNING thread vary here from 1 to 4 (and not from 0 to 3) !!!!
Sylvain Thery's avatar
Sylvain Thery committed
117
	},false); // 4:4 thread, false for no need for markers in threaded code.
Sylvain Thery's avatar
Sylvain Thery committed
118 119 120 121 122 123 124 125 126 127 128 129


	std::cout << "After // processing"<< std::endl;
	foreach_cell<VERTEX>(myMap,[&](Vertex v) // for each Vertex v of the MAP myMap
	{
		std::cout << position[v]<< " / ";
	});
	std::cout <<  std::endl;


	// Example with // accumulation
	// computing the sum of area faces
Sylvain Thery's avatar
Sylvain Thery committed
130 131 132 133 134


	// force number of threads to 4 (0 for traverse, 1,2,3 for computation)
	CGoGN::Parallel::NumberOfThreads = 4;

Sylvain Thery's avatar
Sylvain Thery committed
135
	// init nbthread values with 0
Sylvain Thery's avatar
Sylvain Thery committed
136
	float surf[3]={0.0f,0.0f,0.0f};
Sylvain Thery's avatar
Sylvain Thery committed
137 138 139
	// traverse face in //
	Parallel::foreach_cell<FACE>(myMap,[&](Face f, unsigned int thr)
	{
Sylvain Thery's avatar
Sylvain Thery committed
140
		// for each face add surface to accumulator (-1 because counter between 1-3 not 0-3)
Sylvain Thery's avatar
Sylvain Thery committed
141
		surf[thr-1] += Algo::Surface::Geometry::convexFaceArea<PFP>(myMap,f,position);
Sylvain Thery's avatar
Sylvain Thery committed
142
	},false);
Sylvain Thery's avatar
Sylvain Thery committed
143

Sylvain Thery's avatar
Sylvain Thery committed
144 145
	std::cout << surf[0]<< "/"<< surf[1]<< "/"<< surf[2]<< "/"<< std::endl;
	std::cout << "Total="<<surf[0]+surf[1]+surf[2]<< std::endl;
Sylvain Thery's avatar
Sylvain Thery committed
146

147

Sylvain Thery's avatar
Sylvain Thery committed
148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170
	TraversorV<MAP>   tv0(myMap);
	TraversorCellEven<MAP,VERTEX> tv1(tv0);
	TraversorCellOdd<MAP,VERTEX>  tv2(tv0);

	std::cout << "PAIR:";
	for (Dart d=tv1.begin(); d!=tv1.end(); d=tv1.next())// traverse all vertices (d one dart of each vertex)
		std::cout << d << " / ";
	std::cout << std::endl;

	std::cout << "IMPPAIR:";
	for (Dart d=tv2.begin(); d!=tv2.end(); d=tv2.next())// traverse all vertices (d one dart of each vertex)
		std::cout << d << " / ";
	std::cout <<  std::endl;

	std::cout << "PAIR:";
	for (Dart d=tv1.begin(); d!=tv1.end(); d=tv1.next())// traverse all vertices (d one dart of each vertex)
		std::cout << d << " / ";
	std::cout << std::endl;

	std::cout << "IMPPAIR:";
	for (Dart d=tv2.begin(); d!=tv2.end(); d=tv2.next())// traverse all vertices (d one dart of each vertex)
		std::cout << d << " / ";
	std::cout <<  std::endl;
171 172
	return 0;
}