/usr/include/dolfin/geometry/CollisionDetection.h is in libdolfin-dev 1.4.0+dfsg-4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 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 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 | // Copyright (C) 2014 Anders Logg and August Johansson
//
// This file is part of DOLFIN.
//
// DOLFIN 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 3 of the License, or
// (at your option) any later version.
//
// DOLFIN 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 DOLFIN. If not, see <http://www.gnu.org/licenses/>.
//
// First added: 2014-02-03
// Last changed: 2014-02-24
#include <vector>
#include <dolfin/log/log.h>
#ifndef __COLLISION_DETECTION_H
#define __COLLISION_DETECTION_H
namespace dolfin
{
// Forward declarations
class MeshEntity;
/// This class implements algorithms for detecting pairwise
/// collisions between mesh entities of varying dimensions.
class CollisionDetection
{
public:
/// Check whether entity collides with point.
///
/// *Arguments*
/// entity (_MeshEntity_)
/// The entity.
/// point (_Point_)
/// The point.
///
/// *Returns*
/// bool
/// True iff entity collides with cell.
static bool collides(const MeshEntity& entity,
const Point& point);
/// Check whether two entities collide.
///
/// *Arguments*
/// entity_0 (_MeshEntity_)
/// The first entity.
/// entity_1 (_MeshEntity_)
/// The second entity.
///
/// *Returns*
/// bool
/// True iff entity collides with cell.
static bool collides(const MeshEntity& entity_0,
const MeshEntity& entity_1);
/// Check whether interval collides with point.
///
/// *Arguments*
/// interval (_MeshEntity_)
/// The interval.
/// point (_Point_)
/// The point.
///
/// *Returns*
/// bool
/// True iff objects collide.
static bool collides_interval_point(const MeshEntity& interval,
const Point& point);
/// Check whether interval collides with interval.
///
/// *Arguments*
/// interval_0 (_MeshEntity_)
/// The first interval.
/// interval_1 (_MeshEntity_)
/// The second interval.
///
/// *Returns*
/// bool
/// True iff objects collide.
static bool collides_interval_interval(const MeshEntity& interval_0,
const MeshEntity& interval_1);
/// Check whether triangle collides with point.
///
/// *Arguments*
/// triangle (_MeshEntity_)
/// The triangle.
/// point (_Point_)
/// The point.
///
/// *Returns*
/// bool
/// True iff objects collide.
static bool collides_triangle_point(const MeshEntity& triangle,
const Point& point);
/// Check whether triangle collides with triangle.
///
/// *Arguments*
/// triangle_0 (_MeshEntity_)
/// The first triangle.
/// triangle_1 (_MeshEntity_)
/// The second triangle.
///
/// *Returns*
/// bool
/// True iff objects collide.
static bool collides_triangle_triangle(const MeshEntity& triangle_0,
const MeshEntity& triangle_1);
/// Check whether tetrahedron collides with point.
///
/// *Arguments*
/// tetrahedron (_MeshEntity_)
/// The tetrahedron.
/// point (_Point_)
/// The point.
///
/// *Returns*
/// bool
/// True iff objects collide.
static bool collides_tetrahedron_point(const MeshEntity& tetrahedron,
const Point& point);
/// Check whether tetrahedron collides with triangle.
///
/// *Arguments*
/// tetrahedron (_MeshEntity_)
/// The tetrahedron.
/// triangle (_MeshEntity_)
/// The triangle.
///
/// *Returns*
/// bool
/// True iff objects collide.
static bool collides_tetrahedron_triangle(const MeshEntity& tetrahedron,
const MeshEntity& triangle);
/// Check whether tetrahedron collides with tetrahedron.
///
/// *Arguments*
/// tetrahedron_0 (_MeshEntity_)
/// The first tetrahedron.
/// tetrahedron_1 (_MeshEntity_)
/// The second tetrahedron.
///
/// *Returns*
/// bool
/// True iff objects collide.
static bool collides_tetrahedron_tetrahedron(const MeshEntity& tetrahedron_0,
const MeshEntity& tetrahedron_1);
/// Check whether edge a-b collides with edge c-d.
static bool collides_edge_edge(const Point& a, const Point& b,
const Point& c, const Point& d);
private:
// The implementation of collides_triangle_point
static bool collides_triangle_point(const Point& p0,
const Point& p1,
const Point& p2,
const Point& point);
// The implementation of collides_triangle_triangle
static bool collides_triangle_triangle(const Point& p0,
const Point& p1,
const Point& p2,
const Point& q0,
const Point& q1,
const Point& q2);
// The implementation of collides_tetrahedron_point
static bool collides_tetrahedron_point(const Point& p0,
const Point& p1,
const Point& p2,
const Point& p3,
const Point& point);
// The implementation of collides_tetrahedron_triangle
static bool collides_tetrahedron_triangle(const Point& p0,
const Point& p1,
const Point& p2,
const Point& p3,
const Point& q0,
const Point& q1,
const Point& q2);
// Helper function for triangle-triangle collision
static bool edge_edge_test(int i0,
int i1,
double Ax,
double Ay,
const Point& V0,
const Point& U0,
const Point& U1);
// Helper function for triangle-triangle collision
static bool edge_against_tri_edges(int i0,
int i1,
const Point& V0,
const Point& V1,
const Point& U0,
const Point& U1,
const Point& U2);
// Helper function for triangle-triangle collision
static bool point_in_tri(int i0,
int i1,
const Point& V0,
const Point& U0,
const Point& U1,
const Point& U2);
// Helper function for triangle-triangle collision
static bool coplanar_tri_tri(const Point& N,
const Point& V0,
const Point& V1,
const Point& V2,
const Point& U0,
const Point& U1,
const Point& U2);
// Helper function for triangle-triangle collision
static bool compute_intervals(double VV0,
double VV1,
double VV2,
double D0,
double D1,
double D2,
double D0D1,
double D0D2,
double& A,
double& B,
double& C,
double& X0,
double& X1);
// Helper function for collides_tetrahedron_tetrahedron: checks if
// plane pv1 is a separating plane. Stores local coordinates bc
// and the mask bit mask_edges.
static bool separating_plane_face_A_1(const std::vector<Point>& pv1,
const Point& n,
std::vector<double>& bc,
int& mask_edges);
// Helper function for collides_tetrahedron_tetrahedron: checks if
// plane v1, v2 is a separating plane. Stores local coordinates bc
// and the mask bit mask_edges.
static bool separating_plane_face_A_2(const std::vector<Point>& v1,
const std::vector<Point>& v2,
const Point& n,
std::vector<double>& bc,
int& mask_edges);
// Helper function for collides_tetrahedron_tetrahedron: checks if
// plane pv2 is a separating plane.
static bool separating_plane_face_B_1(const std::vector<Point>& P_V2,
const Point& n)
{
return ((P_V2[0].dot(n) > 0) &&
(P_V2[1].dot(n) > 0) &&
(P_V2[2].dot(n) > 0) &&
(P_V2[3].dot(n) > 0));
}
// Helper function for collides_tetrahedron_tetrahedron: checks if
// plane v1, v2 is a separating plane.
static bool separating_plane_face_B_2(const std::vector<Point>& V1,
const std::vector<Point>& V2,
const Point& n)
{
return (((V1[0] - V2[1]).dot(n) > 0) &&
((V1[1] - V2[1]).dot(n) > 0) &&
((V1[2] - V2[1]).dot(n) > 0) &&
((V1[3] - V2[1]).dot(n) > 0));
}
// Helper function for collides_tetrahedron_tetrahedron: checks if
// edge is in the plane separating faces f0 and f1.
static bool separating_plane_edge_A(const std::vector<std::vector<double> >& coord_1,
const std::vector<int>& masks,
int f0,
int f1);
};
}
#endif
|