basic.h 4.45 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-2012, 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.unistra.fr/                                           *
Pierre Kraemer's avatar
Pierre Kraemer committed
21 22 23 24 25 26 27 28 29 30 31 32 33 34 35
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/

#ifndef __ALGO_GEOMETRY_BASIC_H__
#define __ALGO_GEOMETRY_BASIC_H__

#include "Geometry/basic.h"

namespace CGoGN
{

namespace Algo
{

36 37 38
namespace Surface
{

Pierre Kraemer's avatar
Pierre Kraemer committed
39 40 41 42 43 44 45
namespace Geometry
{

/**
 * vectorOutOfDart return a dart from the position of vertex attribute of d to the position of vertex attribute of phi1(d)
 */
template <typename PFP>
46
inline typename PFP::VEC3 vectorOutOfDart(typename PFP::MAP& map, Dart d, const VertexAttribute<typename PFP::VEC3, typename PFP::MAP>& position)
Pierre Kraemer's avatar
Pierre Kraemer committed
47 48 49 50 51 52 53
{
	typename PFP::VEC3 vec = position[map.phi1(d)] ;
	vec -= position[d] ;
	return vec ;
}

template <typename PFP>
54
inline typename PFP::REAL edgeLength(typename PFP::MAP& map, Dart d, const VertexAttribute<typename PFP::VEC3, typename PFP::MAP>& position)
Pierre Kraemer's avatar
Pierre Kraemer committed
55
{
Pierre Kraemer's avatar
Pierre Kraemer committed
56 57 58 59
	typename PFP::VEC3 v = vectorOutOfDart<PFP>(map, d, position) ;
	return v.norm() ;
}

60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79
namespace Parallel
{

template <typename PFP>
typename PFP::REAL meanEdgeLength(typename PFP::MAP& map, const VertexAttribute<typename PFP::VEC3, typename PFP::MAP>& position)
{
	std::vector<typename PFP::REAL> lengths;
	std::vector<unsigned int> nbedges;
	lengths.resize(CGoGN::Parallel::NumberOfThreads);
	nbedges.resize(CGoGN::Parallel::NumberOfThreads);

	CGoGN::Parallel::foreach_cell<EDGE>(map, [&] (Edge e, unsigned int thr)
	{
		lengths[thr-1] += edgeLength<PFP>(map, e, position);
		++nbedges[thr-1];
	}
	,AUTO);

	typename PFP::REAL length(0);
	unsigned int nbe = 0;
Sylvain Thery's avatar
Sylvain Thery committed
80
	for (int i = 0; i < CGoGN::Parallel::NumberOfThreads; ++i)
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
	{
		length += lengths[i];
		nbe += nbedges[i];
	}

	return length / nbe;
}

} // namespace Parallel

template <typename PFP>
inline typename PFP::REAL meanEdgeLength(typename PFP::MAP& map,const VertexAttribute<typename PFP::VEC3, typename PFP::MAP>& position)
{
	if (CGoGN::Parallel::NumberOfThreads > 1)
	{
		return Parallel::meanEdgeLength<PFP>(map, position);
	}

	typename PFP::REAL length(0);
	unsigned int nbe = 0;

	foreach_cell<EDGE>(map, [&] (Edge e)
	{
		length += edgeLength<PFP>(map, e, position);
		++nbe;
	}
	,AUTO);

	return length / nbe;
}

Pierre Kraemer's avatar
Pierre Kraemer committed
112
template <typename PFP>
113
inline float angle(typename PFP::MAP& map, Dart d1, Dart d2, const VertexAttribute<typename PFP::VEC3, typename PFP::MAP>& position)
Pierre Kraemer's avatar
Pierre Kraemer committed
114 115 116
{
	typename PFP::VEC3 v1 = vectorOutOfDart<PFP>(map, d1, position) ;
	typename PFP::VEC3 v2 = vectorOutOfDart<PFP>(map, d2, position) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
117 118 119
	return Geom::angle(v1, v2) ;
}

120
template <typename PFP>
121
bool isTriangleObtuse(typename PFP::MAP& map, Dart d, const VertexAttribute<typename PFP::VEC3, typename PFP::MAP>& position)
122 123 124 125
{
	return Geom::isTriangleObtuse(position[d], position[map.phi1(d)], position[map.phi_1(d)]) ;
}

Pierre Kraemer's avatar
Pierre Kraemer committed
126 127
} // namespace Geometry

128
} // namespace Surface
129

Pierre Kraemer's avatar
Pierre Kraemer committed
130 131 132 133 134
} // namespace Algo

} // namespace CGoGN

#endif