inclusion.hpp 10.9 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
		}
	}

	return convex;
}

Sylvain Thery's avatar
Sylvain Thery committed
65
// TODO add thread Pameter
Pierre Kraemer's avatar
Pierre Kraemer committed
66
template <typename PFP>
67
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
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;

Sylvain Thery's avatar
Sylvain Thery committed
74
	VEC3 dir(1.0f,1.0f,1.0f);
Pierre Kraemer's avatar
Pierre Kraemer committed
75 76
	VEC3 inter;
	std::vector<VEC3> interPrec;
Sylvain Thery's avatar
Sylvain Thery committed
77
	interPrec.reserve(16);
Pierre Kraemer's avatar
Pierre Kraemer committed
78

Sylvain Thery's avatar
Sylvain Thery committed
79 80
	Traversor3WF<typename PFP::MAP> trav(map,d);
	for (Dart e = trav.begin(); e!= trav.end(); e = trav.next())
Pierre Kraemer's avatar
Pierre Kraemer committed
81
	{
Sylvain Thery's avatar
Sylvain Thery committed
82 83
		bool interRes = Algo::Geometry::intersectionLineConvexFace<PFP>(map, e, position, point, dir, inter);
		if(interRes && (dir * (inter-point)) >= 0.0f)
Pierre Kraemer's avatar
Pierre Kraemer committed
84
		{
Sylvain Thery's avatar
Sylvain Thery committed
85
			// check if already intersect on same point (a vertex certainly)
Pierre Kraemer's avatar
Pierre Kraemer committed
86
			bool alreadyfound = false;
Sylvain Thery's avatar
Sylvain Thery committed
87 88 89 90 91 92 93
			for(typename std::vector<VEC3>::iterator it = interPrec.begin(); !alreadyfound && it != interPrec.end(); ++it)
			{
				if (Geom::arePointsEquals(*it,inter))
						alreadyfound = true;
			}

			if (!alreadyfound)
Pierre Kraemer's avatar
Pierre Kraemer committed
94
			{
Sylvain Thery's avatar
Sylvain Thery committed
95 96
				++countInter;
				interPrec.push_back(inter);
Pierre Kraemer's avatar
Pierre Kraemer committed
97 98 99 100 101
			}
		}
	}
	//if the point is in the volume there is an odd number of intersection with all faces with any direction
	return (countInter % 2) == 1;
Sylvain Thery's avatar
Sylvain Thery committed
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 154 155 156 157



// 	if(isConvex<PFP>(map,d)) {
// 		CGoGNout << "optimize point in volume" << CGoGNendl;
// 	}
//
//	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;
//			bool interRes = Algo::Geometry::intersectionLineConvexFace<PFP>(map, *face, position, point, dir, inter);
//			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 (Geom::arePointsEquals(*it,inter))
////						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;
Pierre Kraemer's avatar
Pierre Kraemer committed
158 159 160
}

template <typename PFP>
161
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
162 163 164 165 166 167 168 169 170 171 172 173 174 175 176
{
	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))
		{
177
			Geom::Plane3D<REAL> p = Geometry::facePlane<PFP>(map, *face, position);
Pierre Kraemer's avatar
Pierre Kraemer committed
178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
			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>
204
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
205 206 207 208 209 210
{
	typedef typename PFP::VEC3 VEC3 ;
	typedef typename PFP::REAL REAL;

	bool inside = true;

211
	Geom::Plane3D<REAL> pl = Geometry::facePlane<PFP>(map, d, position);
Pierre Kraemer's avatar
Pierre Kraemer committed
212 213 214
	Geom::Orientation3D o3d = pl.orient(point);
	if(o3d == Geom::ON)
	{
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
		{
			VEC3 N = pl.normal();
219
			VEC3 v2(position[map.phi1(it)] - position[it]);
Pierre Kraemer's avatar
Pierre Kraemer committed
220
			VEC3 norm2 = N^v2;
221
			Geom::Plane3D<REAL> pl2(norm2, position[it]);
Pierre Kraemer's avatar
Pierre Kraemer committed
222 223 224 225 226 227 228
			o3d = pl2.orient(point);
			if(CCW)
			{
				if(o3d == Geom::UNDER)
					inside = false;
			}
			else if(o3d == Geom::OVER)
229 230
				inside = false;
		}
Pierre Kraemer's avatar
Pierre Kraemer committed
231 232 233 234 235 236 237
		return inside;
	}

	return false;
}

template <typename PFP>
238
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
239 240 241 242
{
	typedef typename PFP::VEC3 VEC3 ;
	typedef typename PFP::REAL REAL;

243
// 	CGoGNout << "point " << point << "d " << d << "faceDeg " << map.faceDegree(d) << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
244 245 246

	bool convex=true;
	Geom::Orientation2D o2d;
247 248 249

	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
250
	{
251
		o2d = Geom::testOrientation2D(point, position[it], position[map.phi1(it)]);
Pierre Kraemer's avatar
Pierre Kraemer committed
252 253 254 255 256 257 258
		if(CCW)
		{
			if(o2d == Geom::RIGHT)
				convex= false;
		}
		else if(o2d == Geom::LEFT)
			return false;
259
	}
Pierre Kraemer's avatar
Pierre Kraemer committed
260 261 262 263 264

	return convex;
}

template <typename PFP>
265
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
266 267 268 269 270 271 272 273 274 275 276 277
{
// 	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();

278 279 280 281 282
	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
283
		return true;
284 285
	else
	{
286
		CGoGNout << " point " << point << CGoGNendl;
287
		CGoGNout << " d1 " << position[d] << " d2 " << position[map.phi2(d)] << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
288 289 290 291 292
		return false;
	}
}

template <typename PFP>
293
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
294 295 296 297
{
	typedef typename PFP::REAL REAL;
	typedef typename PFP::VEC3 VEC3;

298 299
	VEC3 v1 = Algo::Geometry::vectorOutOfDart<PFP>(map, d, position);
	VEC3 v2(point - position[d]);
Pierre Kraemer's avatar
Pierre Kraemer committed
300 301 302 303 304 305 306 307

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

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

template <typename PFP>
308
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
309
{
310
	return Geom::arePointsEquals(point, position[d]);
Pierre Kraemer's avatar
Pierre Kraemer committed
311 312 313
}

template <typename PFP>
314
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
315 316 317
{
	typedef typename PFP::VEC3 VEC3 ;

318 319
	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
320
	{
321
		if(Geom::isPointInTetrahedron(points, position[it], CCW))
Pierre Kraemer's avatar
Pierre Kraemer committed
322
			return true;
323
	}
Pierre Kraemer's avatar
Pierre Kraemer committed
324 325

	VEC3 inter;
326 327 328 329 330 331
	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
332 333 334 335 336 337
	)
		return true;

	return false;
}

338
} // namespace Geometry
Pierre Kraemer's avatar
Pierre Kraemer committed
339

340
} // namspace Algo
Pierre Kraemer's avatar
Pierre Kraemer committed
341

342
} // namespace CGoGN