This file is indexed.

/usr/include/bullet/ConvexDecomposition/ConvexDecomposition.h is in libbullet-extras-dev 2.82-r2704+dfsg-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
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
#ifndef CONVEX_DECOMPOSITION_H

#define CONVEX_DECOMPOSITION_H

/*----------------------------------------------------------------------
Copyright (c) 2004 Open Dynamics Framework Group
www.physicstools.org
All rights reserved.

Redistribution and use in source and binary forms, with or without modification, are permitted provided
that the following conditions are met:

Redistributions of source code must retain the above copyright notice, this list of conditions
and the following disclaimer.

Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.

Neither the name of the Open Dynamics Framework Group nor the names of its contributors may
be used to endorse or promote products derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 'AS IS' AND ANY EXPRESS OR IMPLIED WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE INTEL OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-----------------------------------------------------------------------*/

// http://codesuppository.blogspot.com
//
// mailto: jratcliff@infiniplex.net
//
// http://www.amillionpixels.us
//


#ifdef _WIN32
#include <memory.h> //memcpy
#endif
#include <string.h>
#include <stdio.h>
#include "LinearMath/btAlignedObjectArray.h"



extern unsigned int MAXDEPTH ;
extern float CONCAVE_PERCENT ;
extern float MERGE_PERCENT   ;


typedef btAlignedObjectArray< unsigned int > UintVector;



namespace ConvexDecomposition
{

	class ConvexResult
	{
	public:
		ConvexResult(void)
		{
			mHullVcount = 0;
			mHullVertices = 0;
			mHullTcount = 0;
			mHullIndices = 0;
		}

		ConvexResult(unsigned int hvcount,const float *hvertices,unsigned int htcount,const unsigned int *hindices)
		{
			mHullVcount = hvcount;
			if ( mHullVcount )
			{
				mHullVertices = new float[mHullVcount*sizeof(float)*3];
				memcpy(mHullVertices, hvertices, sizeof(float)*3*mHullVcount );
			}
			else
			{
				mHullVertices = 0;
			}

			mHullTcount = htcount;

			if ( mHullTcount )
			{
				mHullIndices = new unsigned int[sizeof(unsigned int)*mHullTcount*3];
				memcpy(mHullIndices,hindices, sizeof(unsigned int)*mHullTcount*3 );
			}
			else
			{
				mHullIndices = 0;
			}

		}

		ConvexResult(const ConvexResult &r)
		{
			mHullVcount = r.mHullVcount;
			if ( mHullVcount )
			{
				mHullVertices = new float[mHullVcount*sizeof(float)*3];
				memcpy(mHullVertices, r.mHullVertices, sizeof(float)*3*mHullVcount );
			}
			else
			{
				mHullVertices = 0;
			}
			mHullTcount = r.mHullTcount;
			if ( mHullTcount )
			{
				mHullIndices = new unsigned int[sizeof(unsigned int)*mHullTcount*3];
				memcpy(mHullIndices, r.mHullIndices, sizeof(unsigned int)*mHullTcount*3 );
			}
			else
			{
				mHullIndices = 0;
			}
		}

		~ConvexResult(void)
		{
			delete [] mHullVertices;
			delete [] mHullIndices;
		}

		// the convex hull.
		unsigned int		    mHullVcount;
		float *						  mHullVertices;
		unsigned  int       mHullTcount;
		unsigned int			 *mHullIndices;

		float               mHullVolume;		    // the volume of the convex hull.

		float               mOBBSides[3];			  // the width, height and breadth of the best fit OBB
		float               mOBBCenter[3];      // the center of the OBB
		float               mOBBOrientation[4]; // the quaternion rotation of the OBB.
		float               mOBBTransform[16];  // the 4x4 transform of the OBB.
		float               mOBBVolume;         // the volume of the OBB

		float               mSphereRadius;      // radius and center of best fit sphere
		float               mSphereCenter[3];
		float               mSphereVolume;      // volume of the best fit sphere



	};

	class ConvexDecompInterface
	{
	public:
		virtual ~ConvexDecompInterface() {};
		virtual void ConvexDebugTri(const float *p1,const float *p2,const float *p3,unsigned int color) { };
		virtual void ConvexDebugPoint(const float *p,float dist,unsigned int color) { };
		virtual void ConvexDebugBound(const float *bmin,const float *bmax,unsigned int color) { };
		virtual void ConvexDebugOBB(const float *sides, const float *matrix,unsigned int color) { };

		virtual void ConvexDecompResult(ConvexResult &result) = 0;



	};

	// just to avoid passing a zillion parameters to the method the
	// options are packed into this descriptor.
	class DecompDesc
	{
	public:
		DecompDesc(void)
		{
			mVcount = 0;
			mVertices = 0;
			mTcount   = 0;
			mIndices  = 0;
			mDepth    = 5;
			mCpercent = 5;
			mPpercent = 5;
			mMaxVertices = 32;
			mSkinWidth   = 0;
			mCallback    = 0;
		}

		// describes the input triangle.
		unsigned	int	mVcount;   // the number of vertices in the source mesh.
		const float  *mVertices; // start of the vertex position array.  Assumes a stride of 3 floats.
		unsigned int  mTcount;   // the number of triangles in the source mesh.
		unsigned int *mIndices;  // the indexed triangle list array (zero index based)

		// options
		unsigned int  mDepth;    // depth to split, a maximum of 10, generally not over 7.
		float         mCpercent; // the concavity threshold percentage.  0=20 is reasonable.
		float         mPpercent; // the percentage volume conservation threshold to collapse hulls. 0-30 is reasonable.

		// hull output limits.
		unsigned int  mMaxVertices; // maximum number of vertices in the output hull. Recommended 32 or less.
		float         mSkinWidth;   // a skin width to apply to the output hulls.

		ConvexDecompInterface *mCallback; // the interface to receive back the results.

	};

	// perform approximate convex decomposition on a mesh.
	unsigned int performConvexDecomposition(const DecompDesc &desc); // returns the number of hulls produced.


	void calcConvexDecomposition(unsigned int           vcount,
		const float           *vertices,
		unsigned int           tcount,
		const unsigned int    *indices,
		ConvexDecompInterface *callback,
		float                  masterVolume,
		unsigned int           depth);


}


#endif