inclusion.hpp 9.82 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 36 37 38 39 40 41
 * Contact information: cgogn@unistra.fr                                        *
 *                                                                              *
 *******************************************************************************/

#include "Algo/Geometry/intersection.h"
#include "Algo/Geometry/orientation.h"
#include "Algo/Geometry/basic.h"
#include "Algo/Geometry/plane.h"

#include <limits>

namespace CGoGN
{

namespace Algo
{

namespace Geometry
{

template <typename PFP>
42
bool isConvex(typename PFP::MAP& map, Dart d, const VertexAttribute<typename PFP::VEC3>& position, bool CCW, unsigned int thread)
Pierre Kraemer's avatar
Pierre Kraemer committed
43 44 45 46
{
	//get all the dart of the volume
	std::vector<Dart> vStore;
	FunctorStore fs(vStore);
47
	map.foreach_dart_of_volume(d, fs, thread);
Pierre Kraemer's avatar
Pierre Kraemer committed
48 49 50

	bool convex = true;

51
	DartMarkerStore m(map, thread);
Pierre Kraemer's avatar
Pierre Kraemer committed
52 53 54 55 56
	for (std::vector<Dart>::iterator it = vStore.begin() ; it != vStore.end() && convex ; ++it)
	{
		Dart e = *it;
		if (!m.isMarked(e))
		{
Pierre Kraemer's avatar
Pierre Kraemer committed
57
			m.markOrbit<EDGE>(e) ;
58
			convex = isTetrahedronWellOriented<PFP>(map, e, position, CCW) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
59 60 61 62 63 64 65
		}
	}

	return convex;
}

template <typename PFP>
66
bool isPointInVolume(typename PFP::MAP& map, Dart d, const VertexAttribute<typename PFP::VEC3>& position, const typename PFP::VEC3& point)
Pierre Kraemer's avatar
Pierre Kraemer committed
67 68 69 70 71 72 73
{
	typedef typename PFP::VEC3 VEC3;

	//number of intersection between a ray and the volume must be odd
	int countInter = 0;

// 	if(isConvex<PFP>(map,d)) {
74
// 		CGoGNout << "optimize point in volume" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91
// 	}

	std::list<Dart> visitedFaces;			// Faces that are traversed
	visitedFaces.push_back(d);				// Start with the face of d
	std::list<Dart>::iterator face;
	VEC3 dir(0.5f,0.5f,0.5f);
	VEC3 inter;
	std::vector<VEC3> interPrec;

	DartMarkerStore mark(map);					// Lock a marker
	// For every face added to the list
	// search the number of faces intersected by a ray whose origin is the tested point
	for (face = visitedFaces.begin(); face != visitedFaces.end(); ++face)
	{
		if (!mark.isMarked(*face))			// Face has not been visited yet
		{
			bool alreadyfound = false;
92
			bool interRes = Algo::Geometry::intersectionLineConvexFace<PFP>(map, *face, position, point, dir, inter);
Pierre Kraemer's avatar
Pierre Kraemer committed
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
			if(interRes && (dir * (inter-point)) >= 0.0f)
			{
				if(interPrec.size() > 0)
				{
					for(typename std::vector<VEC3>::iterator it = interPrec.begin(); !alreadyfound && it != interPrec.end(); ++it)
					{
						if((*it)[0] == inter[0])
							alreadyfound = true;
					}
				}
				if(!alreadyfound)
				{
					++countInter;
					interPrec.push_back(inter);
				}

				// add non visited adjacent faces to the list of face
				Dart dNext = *face ;
				do
				{
					mark.mark(dNext);					// Mark
					Dart adj = map.phi2(dNext);			// Get adjacent face
					if (adj != dNext && !mark.isMarked(adj))
						visitedFaces.push_back(adj);	// Add it
					dNext = map.phi1(dNext) ;
				} while(dNext != *face) ;
			}
		}
	}

	//if the point is in the volume there is an odd number of intersection with all faces with any direction
	return (countInter % 2) == 1;
}

template <typename PFP>
128
bool isPointInConvexVolume(typename PFP::MAP& map, Dart d, const VertexAttribute<typename PFP::VEC3>& position, const typename PFP::VEC3& point, bool CCW)
Pierre Kraemer's avatar
Pierre Kraemer committed
129 130 131 132 133 134 135 136 137 138 139 140 141 142 143
{
	typedef typename PFP::VEC3 VEC3 ;
	typedef typename PFP::REAL REAL;

	bool inside = true;
	std::list<Dart> visitedFaces;			// Faces that are traversed
	visitedFaces.push_back(d);				// Start with the face of d
	std::list<Dart>::iterator face;
	VEC3 N;

	DartMarkerStore mark(map);					// Lock a marker
	for (face = visitedFaces.begin(); inside && face != visitedFaces.end(); ++face)
	{
		if (!mark.isMarked(*face))
		{
144
			Geom::Plane3D<REAL> p = Geometry::facePlane<PFP>(map, *face, position);
Pierre Kraemer's avatar
Pierre Kraemer committed
145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170
			Geom::Orientation3D o3d = p.orient(point);
			if(CCW)
			{
				if(o3d == Geom::OVER)
					inside = false;
			}
			else if(o3d == Geom::UNDER)
				inside = false;

			Dart dNext = *face ;
			do
			{
				mark.mark(dNext);					// Mark
				Dart adj = map.phi2(dNext);			// Get adjacent face
				if (adj != dNext && !mark.isMarked(adj))
					visitedFaces.push_back(adj);	// Add it
				dNext = map.phi1(dNext) ;
			} while(dNext != *face) ;
		}
	}

	//if the point is in the volume there is an odd number of intersection with all faces with any direction
	return inside;
}

template <typename PFP>
171
bool isPointInConvexFace(typename PFP::MAP& map, Dart d, const VertexAttribute<typename PFP::VEC3>& position, const typename PFP::VEC3& point, bool CCW)
Pierre Kraemer's avatar
Pierre Kraemer committed
172 173 174 175 176 177
{
	typedef typename PFP::VEC3 VEC3 ;
	typedef typename PFP::REAL REAL;

	bool inside = true;

178
	Geom::Plane3D<REAL> pl = Geometry::facePlane<PFP>(map, d, position);
Pierre Kraemer's avatar
Pierre Kraemer committed
179 180 181
	Geom::Orientation3D o3d = pl.orient(point);
	if(o3d == Geom::ON)
	{
182 183
		Traversor2FV<typename PFP::MAP> tfv(map, d) ;
		for(Dart it = tfv.begin(); it != tfv.end(); it = tfv.next())
Pierre Kraemer's avatar
Pierre Kraemer committed
184 185
		{
			VEC3 N = pl.normal();
186
			VEC3 v2(position[map.phi1(it)] - position[it]);
Pierre Kraemer's avatar
Pierre Kraemer committed
187
			VEC3 norm2 = N^v2;
188
			Geom::Plane3D<REAL> pl2(norm2, position[it]);
Pierre Kraemer's avatar
Pierre Kraemer committed
189 190 191 192 193 194 195
			o3d = pl2.orient(point);
			if(CCW)
			{
				if(o3d == Geom::UNDER)
					inside = false;
			}
			else if(o3d == Geom::OVER)
196 197
				inside = false;
		}
Pierre Kraemer's avatar
Pierre Kraemer committed
198 199 200 201 202 203 204
		return inside;
	}

	return false;
}

template <typename PFP>
205
bool isPointInConvexFace2D(typename PFP::MAP& map, Dart d, const VertexAttribute<typename PFP::VEC3>& position, const typename PFP::VEC3& point, bool CCW )
Pierre Kraemer's avatar
Pierre Kraemer committed
206 207 208 209
{
	typedef typename PFP::VEC3 VEC3 ;
	typedef typename PFP::REAL REAL;

210
// 	CGoGNout << "point " << point << "d " << d << "faceDeg " << map.faceDegree(d) << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
211 212 213

	bool convex=true;
	Geom::Orientation2D o2d;
214 215 216

	Traversor2FV<typename PFP::MAP> tfv(map, d) ;
	for(Dart it = tfv.begin(); it != tfv.end(); it = tfv.next())
Pierre Kraemer's avatar
Pierre Kraemer committed
217
	{
218
		o2d = Geom::testOrientation2D(point, position[it], position[map.phi1(it)]);
Pierre Kraemer's avatar
Pierre Kraemer committed
219 220 221 222 223 224 225
		if(CCW)
		{
			if(o2d == Geom::RIGHT)
				convex= false;
		}
		else if(o2d == Geom::LEFT)
			return false;
226
	}
Pierre Kraemer's avatar
Pierre Kraemer committed
227 228 229 230 231

	return convex;
}

template <typename PFP>
232
bool isPointOnEdge(typename PFP::MAP& map, Dart d, const VertexAttribute<typename PFP::VEC3>& position, const typename PFP::VEC3& point)
Pierre Kraemer's avatar
Pierre Kraemer committed
233 234 235 236 237 238 239 240 241 242 243 244
{
// 	typedef typename PFP::REAL REAL;
// 	typedef typename PFP::VEC3 VEC3 ;
// 
// 	VEC3 v1 = Algo::Geometry::vectorOutOfDart<PFP>(map, d, positions);
// 	VEC3 v2(point - positions[d]);
// 
// 	v1.normalize();
// 	v2.normalize();
// 
// 	return fabs(REAL(1) - (v1*v2)) < std::numeric_limits<REAL>::min();

245 246 247 248 249
	if(
		( Algo::Geometry::isPointOnHalfEdge<PFP>(map,d,position,point) && Algo::Geometry::isPointOnHalfEdge<PFP>(map,map.phi2(d),position,point) ) ||
		Algo::Geometry::isPointOnVertex<PFP>(map,d,position,point) ||
		Algo::Geometry::isPointOnVertex<PFP>(map,map.phi1(d),position,point)
	)
Pierre Kraemer's avatar
Pierre Kraemer committed
250
		return true;
251 252
	else
	{
253
		CGoGNout << " point " << point << CGoGNendl;
254
		CGoGNout << " d1 " << position[d] << " d2 " << position[map.phi2(d)] << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
255 256 257 258 259
		return false;
	}
}

template <typename PFP>
260
bool isPointOnHalfEdge(typename PFP::MAP& map, Dart d, const VertexAttribute<typename PFP::VEC3>& position, const typename PFP::VEC3& point)
Pierre Kraemer's avatar
Pierre Kraemer committed
261 262 263 264
{
	typedef typename PFP::REAL REAL;
	typedef typename PFP::VEC3 VEC3;

265 266
	VEC3 v1 = Algo::Geometry::vectorOutOfDart<PFP>(map, d, position);
	VEC3 v2(point - position[d]);
Pierre Kraemer's avatar
Pierre Kraemer committed
267 268 269 270 271 272 273 274

	v1.normalize();
	v2.normalize();

	return (v1*v2) >= -REAL(0.00001);
}

template <typename PFP>
275
bool isPointOnVertex(typename PFP::MAP& map, Dart d, const VertexAttribute<typename PFP::VEC3>& position, const typename PFP::VEC3& point)
Pierre Kraemer's avatar
Pierre Kraemer committed
276
{
277
	return Geom::arePointsEquals(point, position[d]);
Pierre Kraemer's avatar
Pierre Kraemer committed
278 279 280
}

template <typename PFP>
281
bool isConvexFaceInOrIntersectingTetrahedron(typename PFP::MAP& map, Dart d, const VertexAttribute<typename PFP::VEC3>& position, const typename PFP::VEC3 points[4], bool CCW)
Pierre Kraemer's avatar
Pierre Kraemer committed
282 283 284
{
	typedef typename PFP::VEC3 VEC3 ;

285 286
	Traversor2FV<typename PFP::MAP> tfv(map, d) ;
	for(Dart it = tfv.begin(); it != tfv.end(); it = tfv.next())
Pierre Kraemer's avatar
Pierre Kraemer committed
287
	{
288
		if(Geom::isPointInTetrahedron(points, position[it], CCW))
Pierre Kraemer's avatar
Pierre Kraemer committed
289
			return true;
290
	}
Pierre Kraemer's avatar
Pierre Kraemer committed
291 292

	VEC3 inter;
293 294 295 296 297 298
	if( intersectionSegmentConvexFace(map, d, position, points[0], points[1], inter)
	|| 	intersectionSegmentConvexFace(map, d, position, points[1], points[2], inter)
	|| 	intersectionSegmentConvexFace(map, d, position, points[2], points[0], inter)
	|| 	intersectionSegmentConvexFace(map, d, position, points[0], points[3], inter)
	|| 	intersectionSegmentConvexFace(map, d, position, points[1], points[3], inter)
	|| 	intersectionSegmentConvexFace(map, d, position, points[2], points[3], inter)
Pierre Kraemer's avatar
Pierre Kraemer committed
299 300 301 302 303 304
	)
		return true;

	return false;
}

305
} // namespace Geometry
Pierre Kraemer's avatar
Pierre Kraemer committed
306

307
} // namspace Algo
Pierre Kraemer's avatar
Pierre Kraemer committed
308

309
} // namespace CGoGN