/usr/include/dolfin/geometry/IntersectionTriangulation.h is in libdolfin-dev 2016.2.0-2.
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 | // 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-05-28
#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 a triangle and an interval
///
/// *Arguments*
/// T0 (_MeshEntity_)
/// The triangle.
/// T1 (_MeshEntity_)
/// The 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_triangle_interval(const MeshEntity& triangle,
const MeshEntity& interval);
/// 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);
// Function for general intersection computation of two simplices
// with different topological dimension but the same geometrical
// dimension
static std::vector<double>
triangulate_intersection(const std::vector<Point>& s0,
std::size_t tdim0,
const std::vector<Point>& s1,
std::size_t tdim1,
std::size_t gdim);
// Function for computing the intersection of a cell with a flat
// vector of simplices with topological dimension tdim. The
// geometrical dimension is assumed to be the same as for the
// cell.
static std::vector<double>
triangulate_intersection(const MeshEntity& cell,
const std::vector<double> &triangulation,
std::size_t tdim);
// Function for computing the intersection of a cell with a flat
// vector of simplices with topological dimension tdim. The
// geometrical dimension is assumed to be the same as for the
// cell. The corresponding normals are also saved.
static void
triangulate_intersection(const MeshEntity& cell,
const std::vector<double>& triangulation,
const std::vector<Point>& normals,
std::vector<double>& intersection_triangulation,
std::vector<Point>& intersection_normals,
std::size_t tdim);
private:
// Function for computing the intersection of two triangles given
// by std::vector<Point>.
static std::vector<double>
triangulate_intersection_interval_interval(const std::vector<Point>& interval_0,
const std::vector<Point>& interval_1,
std::size_t gdim);
// Function for computing the intersection of a triangle and an interval
// by std::vector<Point>.
static std::vector<double>
triangulate_intersection_triangle_interval(const std::vector<Point>& triangle,
const std::vector<Point>& interval,
std::size_t gdim);
// Function for computing the intersection of two triangles given
// by std::vector<Point>.
static std::vector<double>
triangulate_intersection_triangle_triangle(const std::vector<Point>& tri_0,
const std::vector<Point>& tri_1);
// Function for computing the intersection of two tetrahedra given
// by std::vector<Point>.
static std::vector<double>
triangulate_intersection_tetrahedron_tetrahedron(const std::vector<Point>& tet_0,
const std::vector<Point>& tet_1);
// Function for computing the intersection of a tetrahedron with a
// triangle given by std::vector<Point>.
static std::vector<double>
triangulate_intersection_tetrahedron_triangle(const std::vector<Point>& tet,
const std::vector<Point>& tri);
// 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
|