inclusion.h 4.89 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
/*******************************************************************************
* 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 __ALGO_GEOMETRY_INCLUSION_H_
#define __ALGO_GEOMETRY_INCLUSION_H_

#include <vector>
#include "Geometry/basic.h"
#include "Topology/generic/dart.h"
#include "Geometry/inclusion.h"

namespace CGoGN
{

namespace Algo
{

namespace Geometry
{

/**
 * test if the volume is convex
 * @param the map
 * @param a dart of the volume
 * @param true if the faces of the volume must be in CCW order (default=true)
 */
template <typename PFP>
Sylvain Thery's avatar
Sylvain Thery committed
49
bool isConvex(typename PFP::MAP& map, Dart d, const typename PFP::TVEC3& positions, bool CCW, unsigned int thread=0);
Pierre Kraemer's avatar
Pierre Kraemer committed
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

/**
 * test if a point is inside a volume
 * @param map the map
 * @param d a dart defining the volume
 * @param the point
 */
template <typename PFP>
bool isPointInVolume(typename PFP::MAP& map, Dart d, const typename PFP::TVEC3& positions, const typename PFP::VEC3& point);

/**
 * test if a point is inside a volume
 * @param map the map
 * @param d a dart defining a convex volume
 * @param the point
 */
template <typename PFP>
bool isPointInConvexVolume(typename PFP::MAP& map, Dart d, const typename PFP::TVEC3& positions, const typename PFP::VEC3& point, bool CCW);

/**
 * test if a point is inside a face in a plane
 * @param map the map
 * @param d a dart defining the face
 * @param the point
 */
template <typename PFP>
bool isPointInConvexFace2D(typename PFP::MAP& map, Dart d, const typename PFP::TVEC3& positions, const typename PFP::VEC3& point, bool CCW );

/**
 * test if a point is inside a face
 * @param map the map
 * @param d a dart defining the face
 * @param the point
 */
template <typename PFP>
bool isPointInConvexFace(typename PFP::MAP& map, Dart d, const typename PFP::TVEC3& positions, const typename PFP::VEC3& point, bool CCW);

/**
 * test if a point is on an edge
 * @param map the map
 * @param d a dart defining the edge
 * @param the point
 */
template <typename PFP>
bool isPointOnEdge(typename PFP::MAP& map, Dart d, const typename PFP::TVEC3& positions, const typename PFP::VEC3& point);

/**
 * test if a point is on an half-edge defined by a dart
 * @param map the map
 * @param d a dart defining the edge
 * @param the point
 */
template <typename PFP>
bool isPointOnHalfEdge(typename PFP::MAP& map, Dart d, const typename PFP::TVEC3& positions, const typename PFP::VEC3& point);

/**
 * test if a point is on a vertex
 * @param map the map
 * @param d a dart defining the vertex
 * @param the point
 */
template <typename PFP>
bool isPointOnVertex(typename PFP::MAP& map, Dart d, const typename PFP::TVEC3& positions, const typename PFP::VEC3& point);


/**
 * test if a face is intersecting or totally included in a tetrahedron
 * TODO to test
 * @param map the map
 * @param d a dart defining the face
 * @param the points of the tetra (0,1,2) the first face and (3) the last point of the tetra, in well oriented order
 * @param true if the faces of the tetra are in CCW order (default=true)
 */
template <typename PFP>
bool isConvexFaceInOrIntersectingTetrahedron(typename PFP::MAP& map, Dart d, const typename PFP::TVEC3& positions, const typename PFP::VEC3 points[4], bool CCW);

}

}

}

#include "Algo/Geometry/inclusion.hpp"

#endif