traverse_neighbours.cpp 4.39 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 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52
/*******************************************************************************
* 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"


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::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
53
	VertexAttribute<VEC3, MAP> position = myMap.addAttribute<VEC3, VERTEX, MAP>("position");
54 55 56 57 58 59 60
	// create a topo grid of 2x2 squares
	Algo::Surface::Tilings::Square::Grid<PFP> grid(myMap, 4, 4, true);
	// and embed it using position attribute
    grid.embedIntoGrid(position, 1.,1.,0.);

	// easy way to find the central vertex of the grid	
	Vertex v;
Pierre Kraemer's avatar
Pierre Kraemer committed
61
	foreach_cell_until<VERTEX>(myMap, [&] (Vertex it)
62
	{
Pierre Kraemer's avatar
Pierre Kraemer committed
63 64 65
		if (position[it] == VEC3(0,0,0))
		{
			v = it;
66
			return false;
Pierre Kraemer's avatar
Pierre Kraemer committed
67
		}
68
		return true;
69 70
	});

71 72 73 74 75 76 77
	// must test of find ok (if not v.dart is NIL)
	if (! v.valid())
		std::cerr << "could not find a vertex with position (0,0,0)" << std::endl;

// WITH TRAVERSORS:
	
	// find incident faces to vertex
Pierre Kraemer's avatar
Pierre Kraemer committed
78
	Traversor2VF<MAP> trvf(myMap, v.dart);
79 80 81 82 83 84
	for (Dart e = trvf.begin(); e != trvf.end(); e = trvf.next())
	{
		std::cout << "Face of dart "<<e<< " incident to vertex of dart " << v.dart<< std::endl;
	}

	// find adjacent vertices thru a face
Pierre Kraemer's avatar
Pierre Kraemer committed
85
	Traversor2VVaF<MAP> trvvaf(myMap, v.dart);
86 87 88 89 90
	for (Dart e = trvvaf.begin(); e != trvvaf.end(); e = trvvaf.next())
	{
		std::cout << "vertex of dart "<<e<< " adjacent to vertex of dart " << v.dart<< " by a face" << std::endl;
	}

91
// WITH FOREACH FUNCTION (C++11 lambda expression)
92

Pierre Kraemer's avatar
Pierre Kraemer committed
93 94
	// find faces incident to vertex v
	foreach_incident2<FACE>(myMap, v, [&](Face f)
95
	{
Pierre Kraemer's avatar
Pierre Kraemer committed
96
		std::cout << "Face of dart " << f << " incident to vertex of dart " << v.dart << std::endl;
97
	});
98

Pierre Kraemer's avatar
Pierre Kraemer committed
99 100
	// find vertices adjacent to vertex v thru a face
	foreach_adjacent2<FACE>(myMap, v, [&](Vertex x)
101
	{
Pierre Kraemer's avatar
Pierre Kraemer committed
102
		std::cout << "vertex of dart " << x << " adjacent to vertex of dart " << v.dart << " by a face" << std::endl;
103
	});
104

105 106 107 108 109 110 111 112 113 114 115
// WITH FOR C++11 SYNTAX
	for(Face f : facesIncidentToVertex2(myMap,v))
	{
		std::cout << "Face of dart " << f << " incident to vertex of dart " << v.dart << std::endl;
	}

	for (Vertex x : verticesAdjacentByFace2(myMap,v))
	{
		std::cout << "vertex of dart " << x << " adjacent to vertex of dart " << v.dart << " by a face" << std::endl;
	}

116 117
	return 0;
}