basic.h 4.57 KB
Newer Older
Pierre Kraemer's avatar
Pierre Kraemer 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 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153
/*******************************************************************************
* CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps  *
* version 0.1                                                                  *
* Copyright (C) 2009, 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: https://iggservis.u-strasbg.fr/CGoGN/                              *
* 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;
	Dart vit1 = map.alpha1(map.alpha1(d));

	for (unsigned int i = 0; i< val_vd; ++i)
	{
		unsigned int ve = map.getEmbedding(map.phi2(vit1),VERTEX_ORBIT);
		vu1[i] = ve;
		vit1 = map.alpha1(vit1);
	}

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

	Dart vit2 = map.alpha1(map.alpha1(dd));
	for (unsigned int i = 0; i< val_vdd; ++i)
	{
		unsigned int ve = map.getEmbedding(map.phi2(vit2),VERTEX_ORBIT);

		int j = val_vd;
		while ( j>=0)
		{
			if (vu1[j] == ve)
				return false;
			--j;
		}
		vit2 = map.alpha1(vit2);
	}

	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 ;
	do { ++val_vd ;	tmp = map.alpha1(tmp) ; } while(tmp != d) ;
	int val_vdd = 0 ;
	tmp = dd ;
	do { ++val_vdd ; tmp = map.alpha1(tmp) ; } while(tmp != dd) ;
	int val_vdp = 0 ;
	tmp = dp ;
	do { ++val_vdp ; tmp = map.alpha1(tmp) ; } while(tmp != dp) ;
	int val_vddp = 0 ;
	tmp = ddp ;
	do { ++val_vddp ; tmp = map.alpha1(tmp) ; } while(tmp != ddp) ;

	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;
	Dart vit1 = map.alpha1(map.alpha1(d));

	for (int i = 0; i < val_vd; ++i)
	{
		unsigned int ve = map.getEmbedding(map.phi2(vit1),VERTEX_ORBIT);
		vu1[i] = ve;
		vit1 = map.alpha1(vit1);
	}

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

	Dart vit2 = map.alpha1(map.alpha1(dd));
	for (int i = 0; i < val_vdd; ++i)
	{
		unsigned int ve = map.getEmbedding(map.phi2(vit2),VERTEX_ORBIT);

		int j = val_vd;
		while (j >= 0)
		{
			if (vu1[j] == ve)
				return false;
			--j;
		}
		vit2 = map.alpha1(vit2);
	}

	return true;
}

} // namespace Decimation

} // namespace Algo

} // namespace CGoGN

#endif