This file is indexed.

/usr/include/dolfin/generation/PolyhedronUtils.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
// Copyright (C) 2012 Benjamin Kehlet
//
// 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:  2012-10-31
// Last changed: 2012-11-14

// Some utilities for working with cgal polyhedrons


#ifndef __POLYHEDRON_UTILS_H
#define __POLYHEDRON_UTILS_H

#ifdef HAS_CGAL

#include "cgal_csg3d.h"
#include "self_intersect.h"

// This file should be be included in any other header files to avoid
// CGAL leaking into the DOLFIN code.

namespace dolfin
{

  class PolyhedronUtils
  {
  public:
    static void readSurfaceFile(std::string filename,
                                csg::Exact_Polyhedron_3& p);
    static void readSTLFile(std::string filename, csg::Exact_Polyhedron_3& p);
    static CGAL::Bbox_3 getBoundingBox(csg::Polyhedron_3& polyhedron);
    static double getBoundingSphereRadius(csg::Polyhedron_3& polyhedron);
    static bool has_degenerate_facets(csg::Exact_Polyhedron_3& p,
                                      double threshold);
    static void remove_degenerate_facets(csg::Exact_Polyhedron_3& p,
                                         const double threshold);

    template <typename Polyhedron>
    bool has_self_intersections(Polyhedron& p)
    {
      typedef typename Polyhedron::Triangle_3 Triangle;
      typedef typename std::back_insert_iterator<std::list<Triangle> > OutputIterator;

      std::list<Triangle> triangles; // intersecting triangles
      ::self_intersect<Polyhedron::Polyhedron_3, Polyhedron::Kernel,
          OutputIterator>(p, std::back_inserter(triangles));

      return triangles.size() > 0;
    }
  };
}

#endif
#endif