/usr/include/dolfin/geometry/IntersectionTriangulation.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 | // 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-15
#include <vector>
#include <dolfin/log/log.h>
#ifndef __INTERSECTION_TRIANGULATION_H
#define __INTERSECTION_TRIANGULATION_H
namespace dolfin
{
// Forward declarations
class MeshEntity;
/// This class implements algorithms for computing triangulations of
/// pairwise intersections of simplices.
class IntersectionTriangulation
{
public:
/// Compute triangulation of intersection of two entities
///
/// *Arguments*
/// entity_0 (_MeshEntity_)
/// The first entity.
/// entity_1 (_MeshEntity_)
/// The second entity.
///
/// *Returns*
/// std::vector<double>
/// A flattened array of simplices of dimension
/// num_simplices x num_vertices x gdim =
/// num_simplices x (tdim + 1) x gdim
static std::vector<double>
triangulate_intersection(const MeshEntity& entity_0,
const MeshEntity& entity_1);
/// Compute triangulation of intersection of two intervals
///
/// *Arguments*
/// T0 (_MeshEntity_)
/// The first interval.
/// T1 (_MeshEntity_)
/// The second interval.
///
/// *Returns*
/// std::vector<double>
/// A flattened array of simplices of dimension
/// num_simplices x num_vertices x gdim =
/// num_simplices x (tdim + 1) x gdim
static std::vector<double>
triangulate_intersection_interval_interval(const MeshEntity& interval_0,
const MeshEntity& interval_1);
/// Compute triangulation of intersection of two triangles
///
/// *Arguments*
/// T0 (_MeshEntity_)
/// The first triangle.
/// T1 (_MeshEntity_)
/// The second triangle.
///
/// *Returns*
/// std::vector<double>
/// A flattened array of simplices of dimension
/// num_simplices x num_vertices x gdim =
/// num_simplices x (tdim + 1) x gdim
static std::vector<double>
triangulate_intersection_triangle_triangle(const MeshEntity& triangle_0,
const MeshEntity& triangle_1);
/// Compute triangulation of intersection of a tetrahedron and a triangle
///
/// *Arguments*
/// T0 (_MeshEntity_)
/// The tetrahedron.
/// T1 (_MeshEntity_)
/// The triangle
///
/// *Returns*
/// std::vector<double>
/// A flattened array of simplices of dimension
/// num_simplices x num_vertices x gdim =
/// num_simplices x (tdim + 1) x gdim
static std::vector<double>
triangulate_intersection_tetrahedron_triangle(const MeshEntity& tetrahedron,
const MeshEntity& triangle);
/// Compute triangulation of intersection of two tetrahedra
///
/// *Arguments*
/// T0 (_MeshEntity_)
/// The first tetrahedron.
/// T1 (_MeshEntity_)
/// The second tetrahedron.
///
/// *Returns*
/// std::vector<double>
/// A flattened array of simplices of dimension
/// num_simplices x num_vertices x gdim =
/// num_simplices x (tdim + 1) x gdim
static std::vector<double>
triangulate_intersection_tetrahedron_tetrahedron(const MeshEntity& tetrahedron_0,
const MeshEntity& tetrahedron_1);
private:
// Helper function
static bool intersection_edge_edge(const Point& a,
const Point& b,
const Point& c,
const Point& d,
Point& pt);
// Helper function
static bool intersection_face_edge(const Point& r,
const Point& s,
const Point& t,
const Point& a,
const Point& b,
Point& pt);
};
}
#endif
|