/usr/include/dolfin/mesh/TriangleCell.h is in libdolfin-dev 2017.2.0.post0-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 | // Copyright (C) 2006-2017 Anders Logg
//
// 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/>.
//
// Modified by Kristoffer Selim, 2008.
// Modified by Jan Blechta 2013
//
// First added: 2006-06-05
// Last changed: 2017-09-26
#ifndef __TRIANGLE_CELL_H
#define __TRIANGLE_CELL_H
#include <vector>
#include <boost/multi_array.hpp>
#include "CellType.h"
namespace dolfin
{
/// This class implements functionality for triangular meshes.
class TriangleCell : public CellType
{
public:
/// Specify cell type and facet type
TriangleCell() : CellType(Type::triangle, Type::interval) {}
/// Check if cell is a simplex
bool is_simplex() const
{ return true; }
/// Return topological dimension of cell
std::size_t dim() const;
/// Return number of entities of given topological dimension
std::size_t num_entities(std::size_t dim) const;
/// Return number of vertices for entity of given topological dimension
std::size_t num_vertices(std::size_t dim) const;
/// Return orientation of the cell
std::size_t orientation(const Cell& cell) const;
/// Create entities e of given topological dimension from vertices v
void create_entities(boost::multi_array<unsigned int, 2>& e,
std::size_t dim,
const unsigned int* v) const;
/// Compute (generalized) volume (area) of triangle
double volume(const MeshEntity& triangle) const;
/// Compute diameter of triangle
double circumradius(const MeshEntity& triangle) const;
/// Compute squared distance to given point (3D enabled)
double squared_distance(const Cell& cell, const Point& point) const;
/// Compute squared distance to given point. This version takes
/// the three vertex coordinates as 3D points. This makes it
/// possible to reuse this function for computing the (squared)
/// distance to a tetrahedron.
static double squared_distance(const Point& point,
const Point& a,
const Point& b,
const Point& c);
/// Compute component i of normal of given facet with respect to the cell
double normal(const Cell& cell, std::size_t facet, std::size_t i) const;
/// Compute of given facet with respect to the cell
Point normal(const Cell& cell, std::size_t facet) const;
/// Compute normal to given cell (viewed as embedded in 3D)
Point cell_normal(const Cell& cell) const;
/// Compute the area/length of given facet with respect to the cell
double facet_area(const Cell& cell, std::size_t facet) const;
/// Order entities locally
void order(Cell& cell,
const std::vector<std::int64_t>& local_to_global_vertex_indices) const;
/// Check whether given point collides with cell
bool collides(const Cell& cell, const Point& point) const;
/// Check whether given entity collides with cell
bool collides(const Cell& cell, const MeshEntity& entity) const;
/// Return description of cell type
std::string description(bool plural) const;
/// Mapping of DOLFIN/UFC vertex ordering to VTK/XDMF ordering
std::vector<std::int8_t> vtk_mapping() const
{ return {0, 1, 2}; }
private:
// Find local index of edge i according to ordering convention
std::size_t find_edge(std::size_t i, const Cell& cell) const;
};
}
#endif
|