basic.h 4.54 KB
Newer Older
Pierre Kraemer's avatar
Pierre Kraemer committed
1 2 3
/*******************************************************************************
* CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps  *
* version 0.1                                                                  *
4
* Copyright (C) 2009-2011, IGG Team, LSIIT, University of Strasbourg           *
Pierre Kraemer's avatar
Pierre Kraemer committed
5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
*                                                                              *
* 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.           *
*                                                                              *
20
* Web site: http://cgogn.u-strasbg.fr/                                         *
Pierre Kraemer's avatar
Pierre Kraemer committed
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
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/

#ifndef __DECIMATION_BASIC_H_
#define __DECIMATION_BASIC_H_

namespace CGoGN
{

namespace Algo
{

namespace Decimation
{

template <typename PFP>
bool edgeCanCollapse(typename PFP::MAP& map, Dart d, AttributeHandler<unsigned int>& valences)
{
	Dart dd = map.phi2(d);
	Dart dp = map.phi_1(d);
	Dart ddp = map.phi_1(dd);

	// Check valency conditions

	unsigned int val_vd = valences[d];
	unsigned int val_vdd = valences[dd];
	unsigned int val_vd1 = valences[dp];
	unsigned int val_vdd1 = valences[ddp];

	if(val_vd + val_vdd < 8 || val_vd + val_vdd > 11 || val_vd1  < 5 || val_vdd1 < 5)
		return false;

	// Check vertex sharing condition

	unsigned int vu1[32]; // pas de vector mais un tableau (find a la main, mais pas d'allocation par reserve)
	val_vd -= 3; // evite le -3 dans la boucle
	val_vdd -= 3;
59
	Dart vit1 = map.phi2_1(map.phi2_1(d));
Pierre Kraemer's avatar
Pierre Kraemer committed
60 61 62

	for (unsigned int i = 0; i< val_vd; ++i)
	{
63
		unsigned int ve = map.getEmbedding(map.phi2(vit1),VERTEX);
Pierre Kraemer's avatar
Pierre Kraemer committed
64
		vu1[i] = ve;
65
		vit1 = map.phi2_1(vit1);
Pierre Kraemer's avatar
Pierre Kraemer committed
66 67 68 69
	}

	val_vd--; // pour le parcours avec while >=0

70
	Dart vit2 = map.phi2_1(map.phi2_1(dd));
Pierre Kraemer's avatar
Pierre Kraemer committed
71 72
	for (unsigned int i = 0; i< val_vdd; ++i)
	{
73
		unsigned int ve = map.getEmbedding(map.phi2(vit2),VERTEX);
Pierre Kraemer's avatar
Pierre Kraemer committed
74 75 76 77 78 79 80 81

		int j = val_vd;
		while ( j>=0)
		{
			if (vu1[j] == ve)
				return false;
			--j;
		}
82
		vit2 = map.phi2_1(vit2);
Pierre Kraemer's avatar
Pierre Kraemer committed
83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98
	}

	return true;
}

template <typename PFP>
bool edgeCanCollapse(typename PFP::MAP& map, Dart d)
{
	Dart dd = map.phi2(d);
	Dart dp = map.phi_1(d);
	Dart ddp = map.phi_1(dd);

	// Check valency conditions

	int val_vd = 0 ;
	Dart tmp = d ;
99
	do { ++val_vd ;	tmp = map.phi2_1(tmp) ; } while(tmp != d) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
100 101
	int val_vdd = 0 ;
	tmp = dd ;
102
	do { ++val_vdd ; tmp = map.phi2_1(tmp) ; } while(tmp != dd) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
103 104
	int val_vdp = 0 ;
	tmp = dp ;
105
	do { ++val_vdp ; tmp = map.phi2_1(tmp) ; } while(tmp != dp) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
106 107
	int val_vddp = 0 ;
	tmp = ddp ;
108
	do { ++val_vddp ; tmp = map.phi2_1(tmp) ; } while(tmp != ddp) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
109 110 111 112 113 114 115 116 117

	if(val_vd + val_vdd < 8 || val_vd + val_vdd > 11 || val_vdp < 5 || val_vddp < 5)
		return false;

	// Check vertex sharing condition

	unsigned int vu1[32]; // pas de vector mais un tableau (find a la main, mais pas d'allocation par reserve)
	val_vd -= 3; // evite le -3 dans la boucle
	val_vdd -= 3;
118
	Dart vit1 = map.phi2_1(map.phi2_1(d));
Pierre Kraemer's avatar
Pierre Kraemer committed
119 120 121

	for (int i = 0; i < val_vd; ++i)
	{
122
		unsigned int ve = map.getEmbedding(map.phi2(vit1),VERTEX);
Pierre Kraemer's avatar
Pierre Kraemer committed
123
		vu1[i] = ve;
124
		vit1 = map.phi2_1(vit1);
Pierre Kraemer's avatar
Pierre Kraemer committed
125 126 127 128
	}

	val_vd--; // pour le parcours avec while >=0

129
	Dart vit2 = map.phi2_1(map.phi2_1(dd));
Pierre Kraemer's avatar
Pierre Kraemer committed
130 131
	for (int i = 0; i < val_vdd; ++i)
	{
132
		unsigned int ve = map.getEmbedding(map.phi2(vit2),VERTEX);
Pierre Kraemer's avatar
Pierre Kraemer committed
133 134 135 136 137 138 139 140

		int j = val_vd;
		while (j >= 0)
		{
			if (vu1[j] == ve)
				return false;
			--j;
		}
141
		vit2 = map.phi2_1(vit2);
Pierre Kraemer's avatar
Pierre Kraemer committed
142 143 144 145 146 147 148 149 150 151 152 153
	}

	return true;
}

} // namespace Decimation

} // namespace Algo

} // namespace CGoGN

#endif