/usr/include/gofigure2/Geometry.h is in libgofigure-dev 0.9.0-3+b1.
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 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 | /*=========================================================================
Authors: Michael Kazhdan and Matthew Bolitho
at Johns Hopkins University, 2006-10
Copyright (c) 2006-10, Michael Kazhdan and Matthew Bolitho,
Johns Hopkins University.
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 Johns Hopkins University 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 COPYRIGHT OWNER 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.
=========================================================================*/
#ifndef GEOMETRY_INCLUDED
#define GEOMETRY_INCLUDED
#include <cmath>
#include <vector>
#include "Hash.h"
#include "PoissonReconstructionConfigure.h"
template< class Real >
Real Random(void);
template< class Real >
struct Point3D { Real coords[3]; };
template< class Real >
Point3D< Real > RandomBallPoint(void);
template< class Real >
Point3D< Real > RandomSpherePoint(void);
template< class Real >
double Length(const Point3D< Real > & p);
template< class Real >
double SquareLength(const Point3D< Real > & p);
template< class Real >
double Distance(const Point3D< Real > & p1, const Point3D< Real > & p2);
template< class Real >
double SquareDistance(const Point3D< Real > & p1, const Point3D< Real > & p2);
template< class Real >
void CrossProduct(const Point3D< Real > & p1, const Point3D< Real > & p2, Point3D< Real > & p);
class Edge
{
public:
double p[2][2];
double Length(void) const
{
double d[2];
d[0] = p[0][0] - p[1][0];
d[1] = p[0][1] - p[1][1];
return sqrt(d[0] * d[0] + d[1] * d[1]);
}
};
class Triangle
{
public:
double p[3][3];
double Area(void) const
{
double v1[3], v2[3], v[3];
for ( int d = 0; d < 3; d++ )
{
v1[d] = p[1][d] - p[0][d];
v2[d] = p[2][d] - p[0][d];
}
v[0] = v1[1] * v2[2] - v1[2] * v2[1];
v[1] = -v1[0] * v2[2] + v1[2] * v2[0];
v[2] = v1[0] * v2[1] - v1[1] * v2[0];
return sqrt(v[0] * v[0] + v[1] * v[1] + v[2] * v[2]) / 2;
}
double AspectRatio(void) const
{
double d = 0;
int i, j;
for ( i = 0; i < 3; i++ )
{
for ( i = 0; i < 3; i++ )
{
for ( j = 0; j < 3; j++ ) { d += ( p[( i + 1 ) % 3][j] - p[i][j] ) * ( p[( i + 1 ) % 3][j] - p[i][j] ); } }
}
return Area() / d;
}
};
class CoredPointIndex
{
public:
int index;
char inCore;
int operator==(const CoredPointIndex & cpi) const { return ( index == cpi.index ) && ( inCore == cpi.inCore ); }
int operator!=(const CoredPointIndex & cpi) const { return ( index != cpi.index ) || ( inCore != cpi.inCore ); }
};
class EdgeIndex
{
public:
int idx[2];
};
class CoredEdgeIndex
{
public:
CoredPointIndex idx[2];
};
class TriangleIndex
{
public:
int idx[3];
};
class TriangulationEdge
{
public:
TriangulationEdge(void);
int pIndex[2];
int tIndex[2];
};
class TriangulationTriangle
{
public:
TriangulationTriangle(void);
int eIndex[3];
};
template< class Real >
class Triangulation
{
public:
std::vector< Point3D< Real > > points;
std::vector< TriangulationEdge > edges;
std::vector< TriangulationTriangle > triangles;
int factor(const int & tIndex, int & p1, int & p2, int & p3);
double area(void);
double area(const int & tIndex);
double area(const int & p1, const int & p2, const int & p3);
int flipMinimize(const int & eIndex);
int addTriangle(const int & p1, const int & p2, const int & p3);
protected:
hash_map< long long, int > edgeMap;
static long long EdgeIndex(const int & p1, const int & p2);
double area(const Triangle & t);
};
template< class Real >
void EdgeCollapse(const Real & edgeRatio,
std::vector< TriangleIndex > & triangles,
std::vector< Point3D< Real > > & positions,
std::vector< Point3D< Real > > *normals);
template< class Real >
void TriangleCollapse(const Real & edgeRatio,
std::vector< TriangleIndex > & triangles,
std::vector< Point3D< Real > > & positions,
std::vector< Point3D< Real > > *normals);
class CoredMeshData
{
public:
CoredMeshData() {}
virtual ~CoredMeshData() {}
std::vector< Point3D< float > > inCorePoints;
const static int IN_CORE_FLAG[3];
virtual void resetIterator(void) = 0;
virtual int addOutOfCorePoint(const Point3D< float > & p) = 0;
virtual int addTriangle( const TriangleIndex & t,
const int & icFlag = ( IN_CORE_FLAG[0] | IN_CORE_FLAG[1] | IN_CORE_FLAG[2] ) ) = 0;
virtual int nextOutOfCorePoint(Point3D< float > & p) = 0;
virtual int nextTriangle(TriangleIndex & t, int & inCoreFlag) = 0;
virtual int outOfCorePointCount(void) = 0;
virtual int triangleCount(void) = 0;
};
class CoredVectorMeshData:public CoredMeshData
{
std::vector< Point3D< float > > oocPoints;
std::vector< TriangleIndex > triangles;
int oocPointIndex, triangleIndex;
public:
CoredVectorMeshData();
void resetIterator();
int addOutOfCorePoint(const Point3D< float > & p);
int addTriangle(
const TriangleIndex & t,
const int & inCoreFlag =
( CoredMeshData::IN_CORE_FLAG[0] | CoredMeshData::IN_CORE_FLAG[1] | CoredMeshData::IN_CORE_FLAG[2] ) );
int nextOutOfCorePoint(Point3D< float > & p);
int nextTriangle(TriangleIndex & t, int & inCoreFlag);
int outOfCorePointCount(void);
int triangleCount(void);
};
class CoredFileMeshData:public CoredMeshData
{
FILE *oocPointFile, *triangleFile;
int oocPoints, triangles;
public:
CoredFileMeshData(void);
~CoredFileMeshData(void);
void resetIterator(void);
int addOutOfCorePoint(const Point3D< float > & p);
int addTriangle(
const TriangleIndex & t,
const int & inCoreFlag =
( CoredMeshData::IN_CORE_FLAG[0] | CoredMeshData::IN_CORE_FLAG[1] | CoredMeshData::IN_CORE_FLAG[2] ) );
int nextOutOfCorePoint(Point3D< float > & p);
int nextTriangle(TriangleIndex & t, int & inCoreFlag);
int outOfCorePointCount(void);
int triangleCount(void);
};
#include "Geometry.inl"
#endif // GEOMETRY_INCLUDED
|