codespell - see #92
This commit is contained in:
parent
c275c8fa87
commit
ad75e35593
|
|
@ -67,7 +67,7 @@ class GLArea:public QGLWidget
|
||||||
Q_OBJECT
|
Q_OBJECT
|
||||||
public:
|
public:
|
||||||
GLArea (QWidget * parent = 0);
|
GLArea (QWidget * parent = 0);
|
||||||
/// we choosed a subset of the avaible drawing modes
|
/// we chose a subset of the available drawing modes
|
||||||
enum DrawMode{SMOOTH=0,POINTS,WIRE,FLATWIRE,HIDDEN,FLAT};
|
enum DrawMode{SMOOTH=0,POINTS,WIRE,FLATWIRE,HIDDEN,FLAT};
|
||||||
public slots:
|
public slots:
|
||||||
/// widget-based user interaction slots
|
/// widget-based user interaction slots
|
||||||
|
|
|
||||||
|
|
@ -71,7 +71,7 @@ public:
|
||||||
~GLArea();
|
~GLArea();
|
||||||
void resetTrackBall();
|
void resetTrackBall();
|
||||||
//unsigned int getId() const {return areaid;}
|
//unsigned int getId() const {return areaid;}
|
||||||
/// we choosed a subset of the avaible drawing modes
|
/// we chose a subset of the available drawing modes
|
||||||
|
|
||||||
signals:
|
signals:
|
||||||
/// signal for setting the statusbar message
|
/// signal for setting the statusbar message
|
||||||
|
|
|
||||||
|
|
@ -75,7 +75,7 @@ vcg::Trackball track;
|
||||||
/// window size
|
/// window size
|
||||||
int width,height;
|
int width,height;
|
||||||
|
|
||||||
/// we choosed a subset of the avaible drawing modes
|
/// we chose a subset of the available drawing modes
|
||||||
enum DrawMode{SMOOTH=0,PERPOINTS,WIRE,FLATWIRE,HIDDEN,FLAT};
|
enum DrawMode{SMOOTH=0,PERPOINTS,WIRE,FLATWIRE,HIDDEN,FLAT};
|
||||||
|
|
||||||
/// the current drawmode
|
/// the current drawmode
|
||||||
|
|
|
||||||
|
|
@ -112,7 +112,7 @@ template<class TriMeshType>
|
||||||
// ALNParser::ParseALN(rmaps, alnName);
|
// ALNParser::ParseALN(rmaps, alnName);
|
||||||
|
|
||||||
// for(size_t i=0; i<rmaps.size(); i++)
|
// for(size_t i=0; i<rmaps.size(); i++)
|
||||||
// AddSingleMesh(rmaps[i].filename.c_str(), rmaps[i].trasformation, rmaps[i].quality);
|
// AddSingleMesh(rmaps[i].filename.c_str(), rmaps[i].transformation, rmaps[i].quality);
|
||||||
|
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
|
||||||
|
|
@ -1529,7 +1529,7 @@ public:
|
||||||
std::vector< VertexPointer > minVertVec;
|
std::vector< VertexPointer > minVertVec;
|
||||||
std::vector< VertexPointer > maxVertVec;
|
std::vector< VertexPointer > maxVertVec;
|
||||||
|
|
||||||
// The set of directions to be choosen
|
// The set of directions to be chosen
|
||||||
std::vector< CoordType > dirVec;
|
std::vector< CoordType > dirVec;
|
||||||
dirVec.push_back(CoordType(1,0,0));
|
dirVec.push_back(CoordType(1,0,0));
|
||||||
dirVec.push_back(CoordType(0,1,0));
|
dirVec.push_back(CoordType(0,1,0));
|
||||||
|
|
|
||||||
|
|
@ -1005,7 +1005,7 @@ static void AllEdge(MeshType & m, VertexSampler &ps)
|
||||||
|
|
||||||
// Regular Uniform Edge sampling
|
// Regular Uniform Edge sampling
|
||||||
// Each edge is subdivided in a number of pieces proprtional to its length
|
// Each edge is subdivided in a number of pieces proprtional to its length
|
||||||
// Sample are choosen without touching the vertices.
|
// Samples are chosen without touching the vertices.
|
||||||
|
|
||||||
static void EdgeUniform(MeshType & m, VertexSampler &ps,int sampleNum, bool sampleFauxEdge=true)
|
static void EdgeUniform(MeshType & m, VertexSampler &ps,int sampleNum, bool sampleFauxEdge=true)
|
||||||
{
|
{
|
||||||
|
|
|
||||||
|
|
@ -303,7 +303,7 @@ Given a mesh the following function refines it according to two functor objects:
|
||||||
|
|
||||||
- a predicate that tells if a given edge must be splitted
|
- a predicate that tells if a given edge must be splitted
|
||||||
|
|
||||||
- a functor that gives you the new poistion of the created vertices (starting from an edge)
|
- a functor that gives you the new position of the created vertices (starting from an edge)
|
||||||
|
|
||||||
If RefineSelected is true only selected faces are taken into account for being splitted.
|
If RefineSelected is true only selected faces are taken into account for being splitted.
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -73,7 +73,7 @@ public:
|
||||||
// initializes on current geometry
|
// initializes on current geometry
|
||||||
virtual void TargetCurrentGeometry()=0;
|
virtual void TargetCurrentGeometry()=0;
|
||||||
|
|
||||||
// performs an interation. Returns largest movement.
|
// performs an iteration. Returns largest movement.
|
||||||
virtual ScalarType Iterate()=0;
|
virtual ScalarType Iterate()=0;
|
||||||
|
|
||||||
// performs an iteration (faster, but it does not tell how close it is to stopping)
|
// performs an iteration (faster, but it does not tell how close it is to stopping)
|
||||||
|
|
@ -132,7 +132,7 @@ AREA PRESERVING TEXTURE OPTIMIZATION
|
||||||
|
|
||||||
as in: Degener, P., Meseth, J., Klein, R.
|
as in: Degener, P., Meseth, J., Klein, R.
|
||||||
"An adaptable surface parameterization method."
|
"An adaptable surface parameterization method."
|
||||||
Proc. of the 12th International Meshing oundtable, 201–213 [2003].
|
Proc. of the 12th International Meshing oundtable, 201-213 [2003].
|
||||||
|
|
||||||
Features:
|
Features:
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -566,7 +566,7 @@ bool Decompose(Matrix44<T> &M, Point3<T> &ScaleV, Point3<T> &ShearV, Point3<T> &
|
||||||
return false;
|
return false;
|
||||||
if(math::Abs(M.Determinant())<1e-10) return false; // matrix should be at least invertible...
|
if(math::Abs(M.Determinant())<1e-10) return false; // matrix should be at least invertible...
|
||||||
|
|
||||||
// First Step recover the traslation
|
// First Step recover the translation
|
||||||
TranV=M.GetColumn3(3);
|
TranV=M.GetColumn3(3);
|
||||||
|
|
||||||
// Second Step Recover Scale and Shearing interleaved
|
// Second Step Recover Scale and Shearing interleaved
|
||||||
|
|
|
||||||
|
|
@ -207,7 +207,7 @@ public:
|
||||||
}
|
}
|
||||||
|
|
||||||
/* multiply the current reference frame for the matrix passed
|
/* multiply the current reference frame for the matrix passed
|
||||||
note: it is up to the caller to check the the matrix passed is a pure rototraslation
|
note: it is up to the caller to check the the matrix passed is a pure rototranslation
|
||||||
*/
|
*/
|
||||||
void MultMatrix( vcg::Matrix44<S> m44)
|
void MultMatrix( vcg::Matrix44<S> m44)
|
||||||
{
|
{
|
||||||
|
|
@ -218,7 +218,7 @@ public:
|
||||||
}
|
}
|
||||||
|
|
||||||
/* multiply the current reference frame for the similarity passed
|
/* multiply the current reference frame for the similarity passed
|
||||||
note: it is up to the caller to check the the matrix passed is a pure rototraslation
|
note: it is up to the caller to check the the matrix passed is a pure rototranslation
|
||||||
*/
|
*/
|
||||||
void MultSimilarity( const Similarity<S> & s){ MultMatrix(s.Matrix());}
|
void MultSimilarity( const Similarity<S> & s){ MultMatrix(s.Matrix());}
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -107,7 +107,7 @@ public:
|
||||||
{
|
{
|
||||||
return _min!=p._min || _max!=p._max;
|
return _min!=p._min || _max!=p._max;
|
||||||
}
|
}
|
||||||
/** Infaltes the box of a percentage..
|
/** Infltes the box of a percentage..
|
||||||
@param s Scalar value. E.g if s=0.1 the box enlarges of 10% in every direction
|
@param s Scalar value. E.g if s=0.1 the box enlarges of 10% in every direction
|
||||||
if S==0.5 box doubles (+50% in every direction)
|
if S==0.5 box doubles (+50% in every direction)
|
||||||
if S < 0 box shrinks
|
if S < 0 box shrinks
|
||||||
|
|
@ -133,12 +133,12 @@ public:
|
||||||
_min -= delta;
|
_min -= delta;
|
||||||
_max += delta;
|
_max += delta;
|
||||||
}
|
}
|
||||||
/// Initializing the box
|
/// Initializing the box
|
||||||
void Set( const PointType & p )
|
void Set( const PointType & p )
|
||||||
{
|
{
|
||||||
_min = _max = p;
|
_min = _max = p;
|
||||||
}
|
}
|
||||||
/// Set the box to a null value
|
/// Set the box to a null value
|
||||||
void SetNull()
|
void SetNull()
|
||||||
{
|
{
|
||||||
_min.X()= 1; _max.X()= -1;
|
_min.X()= 1; _max.X()= -1;
|
||||||
|
|
@ -147,7 +147,7 @@ public:
|
||||||
}
|
}
|
||||||
/** Add two boxex:
|
/** Add two boxex:
|
||||||
Returns minimal box that contains both operands.
|
Returns minimal box that contains both operands.
|
||||||
@param b The box to add
|
@param b The box to add
|
||||||
*/
|
*/
|
||||||
void Add( Box const & b )
|
void Add( Box const & b )
|
||||||
{
|
{
|
||||||
|
|
@ -174,7 +174,7 @@ public:
|
||||||
};
|
};
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
/** Coputes intersection of Boxes: the minimal box containing both operands.
|
/** Computes intersection of Boxes: the minimal box containing both operands.
|
||||||
@param b The other operand
|
@param b The other operand
|
||||||
*/
|
*/
|
||||||
void Intersect( const Box & b )
|
void Intersect( const Box & b )
|
||||||
|
|
@ -190,7 +190,7 @@ public:
|
||||||
if(_min.X()>_max.X() || _min.Y()>_max.Y() ) SetNull();
|
if(_min.X()>_max.X() || _min.Y()>_max.Y() ) SetNull();
|
||||||
else if (N>2) if (_min.Z()>_max.Z()) SetNull();
|
else if (N>2) if (_min.Z()>_max.Z()) SetNull();
|
||||||
}
|
}
|
||||||
/** Traslalate the box.
|
/** Translalate the box.
|
||||||
@param p: the translation vector
|
@param p: the translation vector
|
||||||
*/
|
*/
|
||||||
void Translate( const PointType & p )
|
void Translate( const PointType & p )
|
||||||
|
|
@ -198,7 +198,7 @@ public:
|
||||||
_min += p;
|
_min += p;
|
||||||
_max += p;
|
_max += p;
|
||||||
}
|
}
|
||||||
/** Check wheter a point is inside box.
|
/** Check whether a point is inside box.
|
||||||
@param p The point
|
@param p The point
|
||||||
@returns True if inside, false otherwise
|
@returns True if inside, false otherwise
|
||||||
*/
|
*/
|
||||||
|
|
@ -214,7 +214,7 @@ public:
|
||||||
_min.Z() <= p.Z() && p.Z() <= _max.Z()
|
_min.Z() <= p.Z() && p.Z() <= _max.Z()
|
||||||
);
|
);
|
||||||
}
|
}
|
||||||
/** Check wheter a point is inside box, open at left and closed at right [min..max)
|
/** Check whether a point is inside box, open at left and closed at right [min..max)
|
||||||
@param p The point 3D
|
@param p The point 3D
|
||||||
@returns True if inside, false otherwise
|
@returns True if inside, false otherwise
|
||||||
*/
|
*/
|
||||||
|
|
@ -283,7 +283,7 @@ public:
|
||||||
(p[2]-_min[2])/(_max[2]-_min[2])
|
(p[2]-_min[2])/(_max[2]-_min[2])
|
||||||
);
|
);
|
||||||
}
|
}
|
||||||
/// Computes the Volume for the box.
|
/// Computes the Volume for the box.
|
||||||
inline S Volume() const
|
inline S Volume() const
|
||||||
{
|
{
|
||||||
if (N==2) return (_max.X()-_min.X())*(_max.Y()-_min.Y());
|
if (N==2) return (_max.X()-_min.X())*(_max.Y()-_min.Y());
|
||||||
|
|
@ -356,7 +356,7 @@ public:
|
||||||
//@}
|
//@}
|
||||||
|
|
||||||
//@{
|
//@{
|
||||||
/** @name Iporters (for boxes in different spaces and with different scalar types)
|
/** @name Importers (for boxes in different spaces and with different scalar types)
|
||||||
**/
|
**/
|
||||||
|
|
||||||
/// imports the box
|
/// imports the box
|
||||||
|
|
|
||||||
|
|
@ -164,8 +164,8 @@ public:
|
||||||
if(min.X()>max.X() || min.Y()>max.Y()) SetNull();
|
if(min.X()>max.X() || min.Y()>max.Y()) SetNull();
|
||||||
}
|
}
|
||||||
|
|
||||||
/** Traslate the bounding box by a vectore
|
/** Translate the bounding box by a vector
|
||||||
@param p The transolation vector
|
@param p The translation vector
|
||||||
*/
|
*/
|
||||||
void Translate( const PointType & p )
|
void Translate( const PointType & p )
|
||||||
{
|
{
|
||||||
|
|
@ -205,7 +205,7 @@ public:
|
||||||
bb.Intersect(b);
|
bb.Intersect(b);
|
||||||
return bb.IsValid();
|
return bb.IsValid();
|
||||||
}
|
}
|
||||||
/** Check if emptry.
|
/** Check if empty.
|
||||||
@return True iff empty
|
@return True iff empty
|
||||||
*/
|
*/
|
||||||
inline bool IsNull() const { return min.X()>max.X() || min.Y()>max.Y(); }
|
inline bool IsNull() const { return min.X()>max.X() || min.Y()>max.Y(); }
|
||||||
|
|
@ -215,7 +215,7 @@ public:
|
||||||
*/
|
*/
|
||||||
inline bool IsValid() const { return min.X()<max.X() && min.Y()<max.Y(); }
|
inline bool IsValid() const { return min.X()<max.X() && min.Y()<max.Y(); }
|
||||||
|
|
||||||
/** Check if emptry.
|
/** Check if empty.
|
||||||
@return True iff empty
|
@return True iff empty
|
||||||
*/
|
*/
|
||||||
inline bool IsEmpty() const { return min==max; }
|
inline bool IsEmpty() const { return min==max; }
|
||||||
|
|
|
||||||
|
|
@ -108,7 +108,7 @@ public:
|
||||||
{ if (NORM) return ScalarType((p-_ori).dot(_dir));
|
{ if (NORM) return ScalarType((p-_ori).dot(_dir));
|
||||||
else return ScalarType((p-_ori).dot(_dir)/_dir.SquaredNorm());
|
else return ScalarType((p-_ori).dot(_dir)/_dir.SquaredNorm());
|
||||||
}
|
}
|
||||||
/// returns wheter this type is normalized or not
|
/// returns whether this type is normalized or not
|
||||||
static bool IsNormalized() {return NORM;};
|
static bool IsNormalized() {return NORM;};
|
||||||
/// calculates the point of parameter t on the line.
|
/// calculates the point of parameter t on the line.
|
||||||
inline PointType P( const ScalarType t ) const
|
inline PointType P( const ScalarType t ) const
|
||||||
|
|
|
||||||
|
|
@ -124,7 +124,7 @@ public:
|
||||||
{ if (NORM) return ScalarType((p-_ori).dot(_dir));
|
{ if (NORM) return ScalarType((p-_ori).dot(_dir));
|
||||||
else return ScalarType((p-_ori).dot(_dir)/_dir.SquaredNorm());
|
else return ScalarType((p-_ori).dot(_dir)/_dir.SquaredNorm());
|
||||||
}
|
}
|
||||||
/// returns wheter this type is normalized or not
|
/// returns whether this type is normalized or not
|
||||||
static bool IsNormalized() {return NORM;};
|
static bool IsNormalized() {return NORM;};
|
||||||
/// calculates the point of parameter t on the line.
|
/// calculates the point of parameter t on the line.
|
||||||
inline PointType P( const ScalarType t ) const
|
inline PointType P( const ScalarType t ) const
|
||||||
|
|
|
||||||
|
|
@ -305,7 +305,7 @@ public:
|
||||||
std::vector<int>& leftHorizon() { return mLeftHorizon; }
|
std::vector<int>& leftHorizon() { return mLeftHorizon; }
|
||||||
vcg::Point2i& size() { return mSize; }
|
vcg::Point2i& size() { return mSize; }
|
||||||
|
|
||||||
//returns the score relative to the left horizon of that poly in that particular position, taking into account the choosen algo
|
//returns the score relative to the left horizon of that poly in that particular position, taking into account the chosen algo
|
||||||
int getCostX(RasterizedOutline2& poly, Point2i pos, int rast_i) {
|
int getCostX(RasterizedOutline2& poly, Point2i pos, int rast_i) {
|
||||||
switch (params.costFunction) {
|
switch (params.costFunction) {
|
||||||
case CostFuncEnum::MinWastedSpace: return emptyCellBetweenPolyAndLeftHorizon(poly, pos, rast_i);
|
case CostFuncEnum::MinWastedSpace: return emptyCellBetweenPolyAndLeftHorizon(poly, pos, rast_i);
|
||||||
|
|
@ -315,7 +315,7 @@ public:
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
//returns the score relative to the bottom horizon of that poly in that particular position, taking into account the choosen algo
|
//returns the score relative to the bottom horizon of that poly in that particular position, taking into account the chosen algo
|
||||||
int getCostY(RasterizedOutline2& poly, Point2i pos, int rast_i) {
|
int getCostY(RasterizedOutline2& poly, Point2i pos, int rast_i) {
|
||||||
switch (params.costFunction) {
|
switch (params.costFunction) {
|
||||||
case CostFuncEnum::MinWastedSpace: return emptyCellBetweenPolyAndBottomHorizon(poly, pos, rast_i);
|
case CostFuncEnum::MinWastedSpace: return emptyCellBetweenPolyAndBottomHorizon(poly, pos, rast_i);
|
||||||
|
|
|
||||||
|
|
@ -109,7 +109,7 @@ public:
|
||||||
{ if (NORM) return ScalarType((p-_ori)*_dir);
|
{ if (NORM) return ScalarType((p-_ori)*_dir);
|
||||||
else return ScalarType((p-_ori)*_dir/_dir.SquaredNorm());
|
else return ScalarType((p-_ori)*_dir/_dir.SquaredNorm());
|
||||||
}
|
}
|
||||||
/// returns wheter this type is normalized or not
|
/// returns whether this type is normalized or not
|
||||||
static bool IsNormalized() {return NORM;};
|
static bool IsNormalized() {return NORM;};
|
||||||
/// calculates the point of parameter t on the ray.
|
/// calculates the point of parameter t on the ray.
|
||||||
inline PointType P( const ScalarType t ) const
|
inline PointType P( const ScalarType t ) const
|
||||||
|
|
|
||||||
|
|
@ -115,7 +115,7 @@ public:
|
||||||
{ if (NORM) return ScalarType((p-_ori).dot(_dir));
|
{ if (NORM) return ScalarType((p-_ori).dot(_dir));
|
||||||
else return ScalarType((p-_ori).dot(_dir)/_dir.SquaredNorm());
|
else return ScalarType((p-_ori).dot(_dir)/_dir.SquaredNorm());
|
||||||
}
|
}
|
||||||
/// returns wheter this type is normalized or not
|
/// returns whether this type is normalized or not
|
||||||
static bool IsNormalized() {return NORM;};
|
static bool IsNormalized() {return NORM;};
|
||||||
/// calculates the point of parameter t on the ray.
|
/// calculates the point of parameter t on the ray.
|
||||||
inline PointType P( const ScalarType t ) const
|
inline PointType P( const ScalarType t ) const
|
||||||
|
|
|
||||||
|
|
@ -134,7 +134,7 @@ void ActiveCoordinateFrame::Render(QGLWidget* glw)
|
||||||
glVertex(position+arc_point);
|
glVertex(position+arc_point);
|
||||||
}
|
}
|
||||||
glEnd();
|
glEnd();
|
||||||
} else if(moving && drawmoves){ // draw a traslation
|
} else if(moving && drawmoves){ // draw a translation
|
||||||
Point3f ntra=manipulator->track.tra;
|
Point3f ntra=manipulator->track.tra;
|
||||||
ntra.Normalize();
|
ntra.Normalize();
|
||||||
if(current_mode==movx){
|
if(current_mode==movx){
|
||||||
|
|
|
||||||
|
|
@ -99,8 +99,8 @@ public:
|
||||||
|
|
||||||
@param primary the primary direction of alignment.
|
@param primary the primary direction of alignment.
|
||||||
@param secondary the secondary direction of alignment.
|
@param secondary the secondary direction of alignment.
|
||||||
@param axis_1 the name of the axis to align to the primary direction, must be a char choosen from 'X', 'Y' and 'Z'
|
@param axis_1 the name of the axis to align to the primary direction, must be a char chosen from 'X', 'Y' and 'Z'
|
||||||
@param axis_2 the name of the axis to align to the secondary direction, must be different from axis_1 and must be a char choosen from 'X', 'Y', 'Z' and ' '; if the char is ' ' the axis is choosen automatically.
|
@param axis_2 the name of the axis to align to the secondary direction, must be different from axis_1 and must be a char chosen from 'X', 'Y', 'Z' and ' '; if the char is ' ' the axis is chosen automatically.
|
||||||
*/
|
*/
|
||||||
virtual void AlignWith(const Point3f primary, const Point3f secondary, const char axis_1, const char axis_2);
|
virtual void AlignWith(const Point3f primary, const Point3f secondary, const char axis_1, const char axis_2);
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -212,8 +212,8 @@ public:
|
||||||
|
|
||||||
@param primary the primary direction of alignment.
|
@param primary the primary direction of alignment.
|
||||||
@param secondary the secondary direction of alignment.
|
@param secondary the secondary direction of alignment.
|
||||||
@param axis_1 the name of the axis to align to the primary direction, must be a char choosen from 'X', 'Y' and 'Z'
|
@param axis_1 the name of the axis to align to the primary direction, must be a char chosen from 'X', 'Y' and 'Z'
|
||||||
@param axis_2 the name of the axis to align to the secondary direction, must be different from axis_1 and must be a char choosen from 'X', 'Y', 'Z' and ' '; if the char is ' ' the axis is choosen automatically.
|
@param axis_2 the name of the axis to align to the secondary direction, must be different from axis_1 and must be a char chosen from 'X', 'Y', 'Z' and ' '; if the char is ' ' the axis is chosen automatically.
|
||||||
*/
|
*/
|
||||||
virtual void AlignWith(const Point3f primary, const Point3f secondary, const char axis_1, const char axis_2);
|
virtual void AlignWith(const Point3f primary, const Point3f secondary, const char axis_1, const char axis_2);
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -160,7 +160,7 @@ mesh->Render();
|
||||||
</pre>
|
</pre>
|
||||||
|
|
||||||
Note on the typical use:
|
Note on the typical use:
|
||||||
- Perspective and glulookat are choosed to frame the origin centered 1-radius trackball.
|
- Perspective and glulookat are chosen to frame the origin centered 1-radius trackball.
|
||||||
- The final scale and translate are just to fit a generic mesh to the 1sized origin centered where the trackball stays box.
|
- The final scale and translate are just to fit a generic mesh to the 1sized origin centered where the trackball stays box.
|
||||||
- The trackball works also on Orthographic projections \b but that are not centered around origin (just move it back along the Z)
|
- The trackball works also on Orthographic projections \b but that are not centered around origin (just move it back along the Z)
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
|
|
@ -74,7 +74,7 @@ public:
|
||||||
}
|
}
|
||||||
/// Store the error codes enconutered when parsing a ply
|
/// Store the error codes enconutered when parsing a ply
|
||||||
int status;
|
int status;
|
||||||
/// It returns a bit mask describing the field preesnt in the ply file
|
/// It returns a bit mask describing the field present in the ply file
|
||||||
int mask;
|
int mask;
|
||||||
|
|
||||||
/// a Simple callback that can be used for long ply parsing.
|
/// a Simple callback that can be used for long ply parsing.
|
||||||
|
|
|
||||||
|
|
@ -67,7 +67,7 @@ public:
|
||||||
flipfaces = false;
|
flipfaces = false;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// a bit mask describing the field preesnt in the ply file
|
/// a bit mask describing the field present in the ply file
|
||||||
int mask;
|
int mask;
|
||||||
|
|
||||||
/// index of mesh to be imported
|
/// index of mesh to be imported
|
||||||
|
|
|
||||||
|
|
@ -128,7 +128,7 @@ public:
|
||||||
}
|
}
|
||||||
/// Store the error codes enconutered when parsing a ply
|
/// Store the error codes enconutered when parsing a ply
|
||||||
int status;
|
int status;
|
||||||
/// It returns a bit mask describing the field preesnt in the ply file
|
/// It returns a bit mask describing the field present in the ply file
|
||||||
int mask;
|
int mask;
|
||||||
|
|
||||||
/// a Simple callback that can be used for long ply parsing.
|
/// a Simple callback that can be used for long ply parsing.
|
||||||
|
|
|
||||||
|
|
@ -35,7 +35,7 @@ virtual void CreateSparse(std::vector<IndexType> Entries)
|
||||||
virtual ScalarType &A(int row,int col)
|
virtual ScalarType &A(int row,int col)
|
||||||
{return (_Ax[0]);}
|
{return (_Ax[0]);}
|
||||||
|
|
||||||
///return true if the rapresention of sparse matriz is symmetric
|
///return true if the represention of sparse matriz is symmetric
|
||||||
virtual bool IsSymmetric()
|
virtual bool IsSymmetric()
|
||||||
{return false;}
|
{return false;}
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue