/usr/include/palabos/offLattice/triangleToDef.h is in libplb-dev 1.5~r1+repack1-3.
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 | /* This file is part of the Palabos library.
*
* Copyright (C) 2011-2015 FlowKit Sarl
* Route d'Oron 2
* 1010 Lausanne, Switzerland
* E-mail contact: contact@flowkit.com
*
* The most recent release of Palabos can be downloaded at
* <http://www.palabos.org/>
*
* The library Palabos is free software: you can redistribute it and/or
* modify it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* The 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/* Main author: Dimitrios Kontaxakis */
#ifndef TRIANGLE_TO_DEF_H
#define TRIANGLE_TO_DEF_H
#include "core/globalDefs.h"
#include "core/geometry3D.h"
#include "offLattice/triangularSurfaceMesh.h"
#include "offLattice/triangleSet.h"
#include <vector>
#include <map>
#include <set>
#include <queue>
namespace plb {
template<typename T>
class TriangleToDef {
public:
typedef typename TriangleSet<T>::Triangle Triangle;
private: // This class should only be used by the function constructSurfaceMesh().
TriangleToDef(std::vector<Triangle> const& triangles, T epsilon=std::numeric_limits<float>::epsilon());
void generateOnce (
std::vector<Array<T,3> >& vertexList_,
std::vector<plint>& emanatingEdgeList_,
std::vector<Edge>& edgeList_ );
private:
struct EdgeListNode {
plint maxv; /* Integer key value representing the maximum of the global
indices of the two vertices that constitute a mesh edge */
plint t1, t2; /* Indices of the adjacent triangles to the specific
edge. The value -1 in t2 indicates that the edge has no
triangle neighbor and therefore is a boundary edge */
};
struct VertexSetNode {
VertexSetNode(plint i_, Array<T,3> const* vertex_)
: i(i_), vertex(vertex_)
{ }
plint i; // Global index of the vertex
Array<T,3> const* vertex; // Pointer to vertex coordinates
};
struct BoundaryVertexMapNode {
BoundaryVertexMapNode()
: v1(-1), t1(-1), v2(-1), t2(-1), counter(0)
{ }
plint v1; /* Global index of the vertex that the boundary edge
that points to the boundary vertex of index equal to
the map key starts from */
plint t1; /* Index of the adjacent triangle of the boundary edge
that points to the boundary vertex of index equal to
the map key */
plint v2; /* Global index of the vertex that the boundary edge
that starts from the boundary vertex of index equal
to the map key points to */
plint t2; /* Index of the adjacent triangle of the boundary edge
that starts from the boundary vertex of index equal
to the map key */
plint counter; /* Counter of boundary edges attached to the boundary
vertex of index equal to the map key. If `counter'
is not equal to two then there is a problem with
the mesh */
};
class VsLessThan {
public:
VsLessThan(T epsilon_=std::numeric_limits<float>::epsilon())
: epsilon(epsilon_)
{ }
bool operator()(VertexSetNode const& node1, VertexSetNode const& node2);
private:
bool vertexComponentLessThan(T x, T y);
bool vertexComponentEqual(T x, T y);
bool vertexLessThan(Array<T,3> const& v1, Array<T,3> const& v2);
private:
T epsilon;
};
typedef std::set<VertexSetNode,VsLessThan> VertexSet;
typedef typename VertexSet::iterator VsNodeIt;
typedef typename VertexSet::const_iterator VsNodeConstIt;
typedef std::map<plint, BoundaryVertexMapNode> BoundaryVertexMap;
typedef typename BoundaryVertexMap::iterator BvmNodeIt;
typedef typename BoundaryVertexMap::const_iterator BvmNodeConstIt;
private:
void vsAdd( Array<T,3> const& coord, plint& index, plint& count );
void vsOrder();
plint searchEdgeList (
std::vector<EdgeListNode> const& edgeList, plint maxv ) const;
BvmNodeIt bvmAdd(plint id);
bool bvmCheck() const;
void bvmLabel();
plint& globalVertex(plint triangle, plint localVertex);
plint uniqueVertices(std::vector<Triangle> const& triangles);
void computePointingVertex();
plint createEdgeTable();
void findBoundaryVertices();
void computeNeighboringEdges();
void computeInternalNeighboringEdges (
plint iVertex, plint jVertex, plint triangle1, plint triangle2,
plint localEdge1, plint va1, plint vb1 );
void computeEmanatingEdges();
bool fixOrientation();
void fixOrientationOfNeighbors(plint iTriangle, std::queue<plint>& trianglesToFixNeighbors,
char* visitedTriangles, bool& flag);
private:
std::vector<Array<plint,3> > triangleIndices;
VertexSet vertexSet;
std::vector<std::vector<EdgeListNode> > edgeTable;
BoundaryVertexMap boundaryVertexMap;
private:
std::vector<Array<T,3> > vertexList;
std::vector<plint> emanatingEdgeList;
std::vector<Edge> edgeList;
plint numTriangles, numVertices;
template<typename U> friend
void constructSurfaceMesh (
std::vector<typename TriangleToDef<U>::Triangle> const& triangles,
std::vector<Array<U,3> >& vertexList,
std::vector<plint>& emanatingEdgeList,
std::vector<Edge>& edgeList, U epsilon );
};
template<typename T>
void constructSurfaceMesh (
std::vector<typename TriangleToDef<T>::Triangle> const& triangles,
std::vector<Array<T,3> >& vertexList,
std::vector<plint>& emanatingEdgeList,
std::vector<Edge>& edgeList,
T epsilon=std::numeric_limits<float>::epsilon() )
{
TriangleToDef<T>(triangles, epsilon).generateOnce (
vertexList, emanatingEdgeList, edgeList );
}
} // namespace plb
#endif // TRIANGLE_TO_DEF_H
|