compact.cpp 4.19 KB
Newer Older
Sylvain Thery's avatar
Sylvain Thery committed
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 53 54 55 56 57 58 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 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124
/*******************************************************************************
* 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"
#include "Algo/Geometry/area.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 PFP2: public PFP_STANDARD
{
	// definition of the type of the map
	typedef EmbeddedMap2 MAP;
};


typedef PFP2::MAP MAP;
typedef PFP2::VEC3 VEC3;


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

	// add position attribute on vertices and get handler on it
	VertexAttribute<VEC3, MAP> position = myMap.addAttribute<VEC3, VERTEX, MAP>("position");
	Algo::Surface::Tilings::Square::Cube<PFP2> cube(myMap, 2, 2, 2);
	cube.embedIntoCube(position, 10.0f, 10.0f, 10.0f);

	FaceAttribute<VEC3, MAP> color = myMap.addAttribute<VEC3, FACE, MAP>("colorFace");

	foreach_cell<FACE>(myMap, [&](Face f)
	{
		color[f] =(Algo::Surface::Geometry::faceCentroid<PFP2>(myMap,f,position)+ VEC3(5,5,5))/10.0f;
	});


	CGoGNout.toStd(false);
	CGoGNout.toFile("compact_init.csv");
	myMap.dumpCSV();
	std::cout << "MAP dumped in compact_init.csv"<< std::endl;

	// mark central vertex of each face of the cube
	CellMarker<MAP,VERTEX> cm(myMap);
	foreach_cell<VERTEX>(myMap, [&](Vertex v)
	{
		int nb=0;
		if (position[v][0] == 0.0f)
			nb++;
		if (position[v][1] == 0.0f)
			nb++;
		if (position[v][2] == 0.0f)
			nb++;

		if (nb == 2)
			cm.mark(v);
	});

	// remove central vertex of each face of the cube
	foreach_cell<VERTEX>(myMap, [&](Vertex v)
	{
		if (cm.isMarked(v))
		{
			std::cout << "delete vertex"<< std::endl;
			myMap.deleteVertex(v);
		}
	});

	// remove middle points of each edge of the cube
	foreach_cell<EDGE>(myMap, [&](Edge e)
	{
		Vertex v(e.dart);
		if (myMap.vertexDegree(v)==2)
			myMap.uncutEdge(myMap.phi_1(v));
	});


	CGoGNout.toFile("compact_before.csv");
	myMap.dumpCSV();
	std::cout << "MAP with holes dumped in compact_before.csv"<< std::endl;

	std::cout << "Total area "<< Algo::Surface::Geometry::totalArea<PFP2>(myMap,position)<< std::endl;


	myMap.compact();

	CGoGNout.toFile("compact_after.csv");
	myMap.dumpCSV();
	std::cout << "Compacted MAP dumped in compact_after.csv"<< std::endl;

	std::cout << "Total area "<< Algo::Surface::Geometry::totalArea<PFP2>(myMap,position)<< std::endl;

	myMap.saveMapBin("compacted_map2.map");

	return 0;
}