This file is indexed.

/usr/include/sofa/helper/MarchingCubeUtility.h is in libsofa1-dev 1.0~beta4-12.

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
227
228
229
230
231
232
233
234
/******************************************************************************
*       SOFA, Simulation Open-Framework Architecture, version 1.0 beta 4      *
*                (c) 2006-2009 MGH, INRIA, USTL, UJF, CNRS                    *
*                                                                             *
* This library 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 2.1 of the License, or (at     *
* your option) any later version.                                             *
*                                                                             *
* This 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 Lesser General Public License *
* for more details.                                                           *
*                                                                             *
* You should have received a copy of the GNU Lesser General Public License    *
* along with this library; if not, write to the Free Software Foundation,     *
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301 USA.          *
*******************************************************************************
*                              SOFA :: Framework                              *
*                                                                             *
* Authors: M. Adam, J. Allard, B. Andre, P-J. Bensoussan, S. Cotin, C. Duriez,*
* H. Delingette, F. Falipou, F. Faure, S. Fonteneau, L. Heigeas, C. Mendoza,  *
* M. Nesme, P. Neumann, J-P. de la Plata Alcade, F. Poyer and F. Roy          *
*                                                                             *
* Contact information: contact@sofa-framework.org                             *
******************************************************************************/
#ifndef MARCHINGCUBEUTILITY_H
#define MARCHINGCUBEUTILITY_H

#include <sofa/helper/helper.h>

#include <sofa/defaulttype/Vec.h>
#include <sofa/helper/vector.h>
#include <sofa/helper/set.h>
#include <sofa/helper/io/Mesh.h>
#include <map>



namespace sofa
{

  namespace helper
  {
    using sofa::defaulttype::Vec;
    using sofa::defaulttype::Vector3;
    using sofa::helper::vector;
    using sofa::helper::set;

    class SOFA_HELPER_API MarchingCubeUtility
    {
      public:
        typedef unsigned int PointID;
        typedef Vec<3, int> Vec3i;
        typedef Vec<6, int> Vec6i;

      public:
        MarchingCubeUtility();

        ~MarchingCubeUtility() {};

        void setDataResolution ( const Vec3i   &resolution )
        {
          dataResolution = resolution;
          setROI( Vec3i ( 0, 0, 0 ), resolution );
          setBoundingBox ( Vec3i ( 0, 0, 0 ), resolution );
        }

        void setDataVoxelSize ( const Vector3 &voxelSize )
        {
          dataVoxelSize = voxelSize;
        }

        void setStep ( const unsigned int step )
        {
          cubeStep = step;
        }

        void setConvolutionSize ( const unsigned int convolutionSize )
        {
          this->convolutionSize = convolutionSize;
        }

        /// Set the bounding box from real coords to apply mCube localy.
        void setBoundingBoxFromRealCoords ( const Vector3& min, const Vector3& max )
        {
          Vector3 gridSize = dataVoxelSize * cubeStep;
          gridSize = Vector3 ( 1.0 / gridSize[0], 1.0 / gridSize[1], 1.0 / gridSize[2] );

          Vec3i bbMin = ( min - ( dataVoxelSize/2.0 ) ).linearProduct ( gridSize );
          Vec3i bbMax = ( max - ( dataVoxelSize/2.0 ) ).linearProduct ( gridSize );
          setBoundingBox( min, max);
        }


        /// Set the bounding box (in the data space) to apply mCube localy.
        void setROI ( const Vec3i& min, const Vec3i& max )
        {
          this->roi.min = min;
          this->roi.max = max;
          if ( roi.min[0] < 0 ) roi.min[0] = 0;
          if ( roi.min[1] < 0 ) roi.min[1] = 0;
          if ( roi.min[2] < 0 ) roi.min[2] = 0;
          if ( roi.max[0] > dataResolution[0] )roi.max[0] = dataResolution[0];
          if ( roi.max[1] > dataResolution[1] )roi.max[1] = dataResolution[1];
          if ( roi.max[2] > dataResolution[2] )roi.max[2] = dataResolution[2];
        }


        /// Set the bounding box (in the data space) to apply mCube localy.
        void setBoundingBox ( const Vec6i& roi )
        {
          Vec3i min( roi[0], roi[1], roi[2]);
          Vec3i max( roi[3], roi[4], roi[5]);
          setBoundingBox( min, max);
        }

        /// Set the bounding box (in the data space) to apply mCube localy.
        void setBoundingBox ( const Vec3i& min, const Vec3i& max )
        {
          this->bbox.min = min;
          this->bbox.max = max;
          if ( bbox.min[0] < 0 ) bbox.min[0] = 0;
          if ( bbox.min[1] < 0 ) bbox.min[1] = 0;
          if ( bbox.min[2] < 0 ) bbox.min[2] = 0;
          if ( bbox.max[0] > dataResolution[0] )bbox.max[0] = dataResolution[0];
          if ( bbox.max[1] > dataResolution[1] )bbox.max[1] = dataResolution[1];
          if ( bbox.max[2] > dataResolution[2] )bbox.max[2] = dataResolution[2];
        }

        void setMaxIsoValue( float value) { maxIsoValue = value;};

        /// Set the border to localy remesh from real coords
		void setBordersFromRealCoords ( const sofa::helper::set<Vector3>& borders );


        /// given a set of data (size of the data and size of the marching cube beeing defined previously),
        /// we construct the surface.
        /// mesh is a vector containing the triangles defined as a sequence of three indices
        /// map_indices gives the correspondance between an indice and a 3d position in space
        void run ( unsigned char *data, const float isolevel,
                   sofa::helper::vector< PointID > &triangles,
                   sofa::helper::vector< Vector3>  &vertices,
                   helper::vector< helper::vector<unsigned int> > *triangleIndexInRegularGrid = NULL ) const;

        /// Same as the previous function but the surfaces are constructed by propagating from seeds.
        /// Faster than previous but it need the precomputation of the seeds.
        void run ( unsigned char *data, const vector<Vec3i>& seeds,
                   const float isolevel,
                   sofa::helper::vector< PointID > &triangles,
                   sofa::helper::vector< Vector3>  &vertices,
                   helper::vector< helper::vector<unsigned int> > *triangleIndexInRegularGrid = NULL ) const;

        /// given a set of data (size of the data and size of the marching cube beeing defined previously),
        /// we construct a Sofa mesh.
        void run ( unsigned char *data,  const float isolevel, sofa::helper::io::Mesh &m ) const;

        /// given a set of data, find seeds to run quickly.
        void findSeeds ( vector<Vec3i>& seeds, const float isoValue, unsigned char *_data );

        /// Given coords in the scene, find seeds coords.
        void findSeedsFromRealCoords ( vector<Vec3i>& mCubeCoords, const vector<Vector3>& realCoords ) const;
      private:

        struct GridCell
        {
          float val[8];
          Vector3 pos[8];
        };

        struct BoundingBox
        {
          Vec3i min;
          Vec3i max;
        };

        inline void initCell ( GridCell& cell, const Vec3i& coord, const unsigned char* data, const Vector3& gridStep, const Vec3i& dataGridStep ) const;

        inline void vertexInterp ( Vector3 &p, const float isolevel, const Vector3 &p1, const Vector3 &p2, const float valp1, const float valp2 ) const ;

        inline bool testGrid ( const float v, const float isolevel ) const;

        inline void updateTriangleInRegularGridVector ( helper::vector< helper::vector<unsigned int /*regular grid space index*/> >& triangleIndexInRegularGrid, const Vec3i& coord, const GridCell& cell, unsigned int nbTriangles ) const;

        int polygonise ( const GridCell &grid, int& cubeConf, const float isolevel,
                         sofa::helper::vector< PointID > &triangles,
                         std::map< Vector3, PointID> &map_vertices,
                         sofa::helper::vector< Vector3 > &map_indices ) const ;

        bool getVoxel ( unsigned int index, const unsigned char *dataVoxels ) const
        {
          const int i = index%8;
          return ( ( dataVoxels[index>>3]& ( ( int ) ( pow ( 2.0f, i ) ) ) ) >> i ) == 1;
        }

        void findConnectedVoxels ( set<unsigned int>& connectedVoxels, const float isoValue, const Vec3i& from, unsigned char* data );

        void createGaussianConvolutionKernel ( vector< float >  &convolutionKernel ) const;

        void applyConvolution ( const float* convolutionKernel,
                                unsigned int x, unsigned int y, unsigned int z,
                                const unsigned char *input_data,
                                unsigned char *output_data ) const;

        void smoothData ( unsigned char *data ) const;

        /// Propagate the triangulation surface creation from a cell.
        void propagateFrom ( const Vec3i coord,
                             unsigned char* data, const float isolevel,
                             sofa::helper::vector< PointID >& triangles,
                             sofa::helper::vector< Vector3 >& vertices,
                             sofa::helper::set<Vec3i>& generatedCubes,
                             helper::vector< helper::vector<unsigned int> >* triangleIndexInRegularGrid = NULL ) const;

      private:
        unsigned int  cubeStep;
        unsigned int  convolutionSize;
        Vec3i     dataResolution;
        Vector3     dataVoxelSize;
        float maxIsoValue; // if you want to limit between two iso-value.
        BoundingBox bbox; //bbox used to remesh
        BoundingBox roi; // Set value to 0 on this limit to always obtain manifold mesh. (Set to dataResolution by default but can be changed for ROI)
        set<Vec3i> borders;
    };

    extern SOFA_HELPER_API const int MarchingCubeEdgeTable[256];
    extern SOFA_HELPER_API const int MarchingCubeFaceTable[256];
    extern SOFA_HELPER_API const int MarchingCubeTriTable[256][16];

  } // namespace helper

} // namespace sofa

#endif