/usr/include/dolfin/refinement/RivaraRefinement.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 | // Copyright (C) 2008 Johan Jansson
//
// 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 Bartosz Sawicki, 2009.
// Modified by Garth N. Wells, 2010.
// Modified by Anders Logg, 2010.
//
// First added: 2008
// Last changed: 2011-01-11
#ifndef __RIVARAREFINEMENT_H
#define __RIVARAREFINEMENT_H
#include <list>
#include <vector>
#include <dolfin/mesh/Mesh.h>
#include <dolfin/mesh/MeshFunction.h>
#include <dolfin/mesh/Cell.h>
namespace dolfin
{
// Forward declarations
//class CellType;
//class Mesh
// FIXME: This implementation needs quite a bit of cleanup, in particular
// FIXME: the DMesh class. Should be possible to use plain STL data structures
// FIXME: in place of the DMesh class.
class RivaraRefinement
{
public:
/// Refine simplicial mesh locally by recursive edge bisection
static void refine(Mesh& refined_mesh,
const Mesh& mesh,
const MeshFunction<bool>& cell_marker,
MeshFunction<std::size_t>& cell_map,
std::vector<int>& facet_map);
private:
class DCell;
/// Vertex with list of connected cells
class DVertex
{
public:
DVertex();
int id;
std::list<DCell*> cells;
Point p;
};
// Cell with parent_id, deletion marker and facets markets
class DCell
{
public:
DCell();
int id;
int parent_id;
std::vector<DVertex *> vertices;
bool deleted;
std::vector<int> facets;
};
// Dynamic mesh for recursive Rivara refinement
class DMesh
{
public:
DMesh();
~DMesh();
void add_vertex(DVertex* v);
void add_cell(DCell* c, std::vector<DVertex*> vs, int parent_id);
void remove_cell(DCell* c);
void import_mesh(const Mesh& mesh);
void export_mesh(Mesh& mesh, std::vector<int>& new2old_cell, std::vector<int>& new2old_facet);
void number();
void bisect(DCell* dcell, DVertex* hangv, DVertex* hv0, DVertex* hv1);
void bisect_marked(std::vector<bool> marked_ids);
DCell* opposite(DCell* dcell, DVertex* v1, DVertex* v2);
void propagate_facets(DCell* dcell, DCell* c0, DCell* c1, std::size_t ii, std::size_t jj, DVertex* mv);
std::list<DVertex*> vertices;
std::list<DCell*> cells;
const CellType* cell_type;
std::size_t tdim;
std::size_t gdim;
};
};
}
#endif
|