first release version
This commit is contained in:
parent
56086c51ae
commit
a2ee98e3e4
|
|
@ -0,0 +1,203 @@
|
||||||
|
/****************************************************************************
|
||||||
|
* VCGLib o o *
|
||||||
|
* Visual and Computer Graphics Library o o *
|
||||||
|
* _ O _ *
|
||||||
|
* Copyright(C) 2004 \/)\/ *
|
||||||
|
* Visual Computing Lab /\/| *
|
||||||
|
* ISTI - Italian National Research Council | *
|
||||||
|
* \ *
|
||||||
|
* All rights reserved. *
|
||||||
|
* *
|
||||||
|
* This program is free software; you can redistribute it and/or modify *
|
||||||
|
* it under the terms of the GNU General Public License as published by *
|
||||||
|
* the Free Software Foundation; either version 2 of the License, or *
|
||||||
|
* (at your option) any later version. *
|
||||||
|
* *
|
||||||
|
* This program 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 General Public License (http://www.gnu.org/licenses/gpl.txt) *
|
||||||
|
* for more details. *
|
||||||
|
* *
|
||||||
|
****************************************************************************/
|
||||||
|
/****************************************************************************
|
||||||
|
History
|
||||||
|
|
||||||
|
|
||||||
|
****************************************************************************/
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#ifndef __VCGLIB_LINE2
|
||||||
|
#define __VCGLIB_LINE2
|
||||||
|
|
||||||
|
#include <vcg/space/point2.h>
|
||||||
|
|
||||||
|
namespace vcg {
|
||||||
|
|
||||||
|
/** \addtogroup space */
|
||||||
|
/*@{*/
|
||||||
|
/**
|
||||||
|
Templated class for 2D lines.
|
||||||
|
This is the class for infinite lines in 3D space. A Line is stored just as two Point2:
|
||||||
|
an origin and a direction (not necessarily normalized).
|
||||||
|
@param LineScalarType (template parameter) Specifies the type of scalar used to represent coords.
|
||||||
|
@param NORM: if on, the direction is always Normalized
|
||||||
|
*/
|
||||||
|
template <class LineScalarType, bool NORM=false>
|
||||||
|
class Line2
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
|
||||||
|
/// The scalar type
|
||||||
|
typedef LineScalarType ScalarType;
|
||||||
|
|
||||||
|
/// The point type
|
||||||
|
typedef Point2<LineScalarType> PointType;
|
||||||
|
|
||||||
|
/// The line type
|
||||||
|
typedef Line2<LineScalarType,NORM> LineType;
|
||||||
|
|
||||||
|
private:
|
||||||
|
|
||||||
|
/// Origin
|
||||||
|
PointType _ori;
|
||||||
|
|
||||||
|
/// Direction (not necessarily normalized, unless so specified by NORM)
|
||||||
|
PointType _dir;
|
||||||
|
|
||||||
|
public:
|
||||||
|
|
||||||
|
//@{
|
||||||
|
/** @name Members to access the origin or direction
|
||||||
|
Direction() cannot be assigned directly.
|
||||||
|
Use SetDirection() or Set() instead.
|
||||||
|
**/
|
||||||
|
///
|
||||||
|
inline const PointType &Origin() const { return _ori; }
|
||||||
|
inline PointType &Origin() { return _ori; }
|
||||||
|
inline const PointType &Direction() const { return _dir; }
|
||||||
|
/// sets the origin
|
||||||
|
inline void SetOrigin( const PointType & ori )
|
||||||
|
{ _ori=ori; }
|
||||||
|
/// sets the direction
|
||||||
|
inline void SetDirection( const PointType & dir)
|
||||||
|
{ _dir=dir; if (NORM) _dir.Normalize(); }
|
||||||
|
/// sets origin and direction.
|
||||||
|
inline void Set( const PointType & ori, const PointType & dir )
|
||||||
|
{ SetOrigin(ori); SetDirection(dir); }
|
||||||
|
//@}
|
||||||
|
|
||||||
|
//@{
|
||||||
|
/** @name Constructors
|
||||||
|
**/
|
||||||
|
/// The empty constructor
|
||||||
|
Line2() {};
|
||||||
|
/// The (origin, direction) constructor
|
||||||
|
Line2(const PointType &ori, const PointType &dir) {SetOrigin(ori); SetDirection(dir);};
|
||||||
|
//@}
|
||||||
|
|
||||||
|
/// Operator to compare two lines
|
||||||
|
inline bool operator == ( LineType const & p ) const
|
||||||
|
{ return _ori==p._ori && _dir==p._dir; }
|
||||||
|
/// Operator to dispare two lines
|
||||||
|
inline bool operator != ( LineType const & p ) const
|
||||||
|
{ return _ori!=p._ori || _dir!=p._dir; }
|
||||||
|
/// Projects a point on the line
|
||||||
|
inline ScalarType Projection( const PointType &p ) const
|
||||||
|
{ if (NORM) return ScalarType((p-_ori)*_dir);
|
||||||
|
else return ScalarType((p-_ori)*_dir/_dir.SquaredNorm());
|
||||||
|
}
|
||||||
|
/// returns wheter this type is normalized or not
|
||||||
|
static bool IsNormalized() {return NORM;};
|
||||||
|
/// calculates the point of parameter t on the line.
|
||||||
|
inline PointType P( const ScalarType t ) const
|
||||||
|
{ return _ori + _dir * t; }
|
||||||
|
/// normalizes direction field (returns a Normalized Line)
|
||||||
|
inline Line2<ScalarType,true> &Normalize()
|
||||||
|
{ if (!NORM) _dir.Normalize(); return *((Line2<ScalarType,true>*)this);}
|
||||||
|
/// normalizes direction field (returns a Normalized Line) - static version
|
||||||
|
static Line2<ScalarType,true> &Normalize(LineType &p)
|
||||||
|
{ p.Normalize(); return *((Line2<ScalarType,true>*)(&p));}
|
||||||
|
/// importer for different line types (with any scalar type or normalization beaviour)
|
||||||
|
template <class Q, bool K>
|
||||||
|
inline void Import( const Line2<Q,K> & b )
|
||||||
|
{ _ori.Import( b.Origin() ); _dir.Import( b.Direction() );
|
||||||
|
if ((NORM) && (!K)) _dir.Normalize();
|
||||||
|
//printf("(=)%c->%c ",(!NORM)?'N':'n', NORM?'N':'n');
|
||||||
|
}
|
||||||
|
/// constructs a new line importing it from an existing one
|
||||||
|
template <class Q, bool K>
|
||||||
|
static LineType Construct( const Line2<Q,K> & b )
|
||||||
|
{ LineType res; res.Import(b); return res;
|
||||||
|
}
|
||||||
|
PointType ClosestPoint(const PointType & p) const{
|
||||||
|
return P(Projection(p));
|
||||||
|
}
|
||||||
|
/// flips the line
|
||||||
|
inline void Flip(){
|
||||||
|
_dir=-_dir;
|
||||||
|
};
|
||||||
|
|
||||||
|
//@{
|
||||||
|
/** @name Linearity for 3d lines
|
||||||
|
(operators +, -, *, /) so a line can be set as a linear combination
|
||||||
|
of several lines. Note that the result of any operation returns
|
||||||
|
a non-normalized line; however, the command r0 = r1*a + r2*b is licit
|
||||||
|
even if r0,r1,r2 are normalized lines, as the normalization will
|
||||||
|
take place within the final assignement operation.
|
||||||
|
**/
|
||||||
|
inline Line2<ScalarType,false> operator + ( LineType const & p) const
|
||||||
|
{return Line2<ScalarType,false> ( _ori+p.Origin(), _dir+p.Direction() );}
|
||||||
|
inline Line2<ScalarType,false> operator - ( LineType const & p) const
|
||||||
|
{return Line2<ScalarType,false> ( _ori-p.Origin(), _dir-p.Direction() );}
|
||||||
|
inline Line2<ScalarType,false> operator * ( const ScalarType s ) const
|
||||||
|
{return Line2<ScalarType,false> ( _ori*s, _dir*s );}
|
||||||
|
inline Line2<ScalarType,false> operator / ( const ScalarType s ) const
|
||||||
|
{ScalarType s0=((ScalarType)1.0)/s; return LineType( _ori*s0, _dir*s0 );}
|
||||||
|
//@}
|
||||||
|
|
||||||
|
|
||||||
|
//@{
|
||||||
|
/** @name Automatic normalized to non-normalized
|
||||||
|
"Line3dN r0 = r1" is equivalent to
|
||||||
|
"Line3dN r0 = r1.Normalize()" if r1 is a Line3d
|
||||||
|
**/
|
||||||
|
/// copy constructor that takes opposite beaviour
|
||||||
|
Line2 (const Line2<ScalarType,!NORM > &r)
|
||||||
|
{ Import(r); };
|
||||||
|
/// assignment
|
||||||
|
inline LineType & operator = ( Line2<ScalarType,!NORM> const &r)
|
||||||
|
{ Import(r); return *this; };
|
||||||
|
//@}
|
||||||
|
|
||||||
|
}; // end class definition
|
||||||
|
|
||||||
|
typedef Line2<short> Line2s;
|
||||||
|
typedef Line2<int> Line2i;
|
||||||
|
typedef Line2<float> Line2f;
|
||||||
|
typedef Line2<double> Line2d;
|
||||||
|
|
||||||
|
typedef Line2<short ,true> Line2sN;
|
||||||
|
typedef Line2<int ,true> Line2iN;
|
||||||
|
typedef Line2<float ,true> Line2fN;
|
||||||
|
typedef Line2<double,true> Line2dN;
|
||||||
|
|
||||||
|
/// returns closest point
|
||||||
|
template <class ScalarType, bool NORM>
|
||||||
|
Point2<ScalarType> ClosestPoint( Line2<ScalarType,NORM> l, const Point2<ScalarType> & p)
|
||||||
|
{
|
||||||
|
return l.P(l.Projection(p));
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class ScalarType, bool NORM>
|
||||||
|
ScalarType Distance(const Line2<ScalarType, NORM> &l,
|
||||||
|
const Point2<ScalarType> &p) {
|
||||||
|
Point2<ScalarType> o = l.ClosestPoint(p);
|
||||||
|
return (o - p).Norm();
|
||||||
|
}
|
||||||
|
|
||||||
|
/*@}*/
|
||||||
|
|
||||||
|
} // end namespace
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,171 @@
|
||||||
|
/****************************************************************************
|
||||||
|
* VCGLib o o *
|
||||||
|
* Visual and Computer Graphics Library o o *
|
||||||
|
* _ O _ *
|
||||||
|
* Copyright(C) 2004 \/)\/ *
|
||||||
|
* Visual Computing Lab /\/| *
|
||||||
|
* ISTI - Italian National Research Council | *
|
||||||
|
* \ *
|
||||||
|
* All rights reserved. *
|
||||||
|
* *
|
||||||
|
* This program is free software; you can redistribute it and/or modify *
|
||||||
|
* it under the terms of the GNU General Public License as published by *
|
||||||
|
* the Free Software Foundation; either version 2 of the License, or *
|
||||||
|
* (at your option) any later version. *
|
||||||
|
* *
|
||||||
|
* This program 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 General Public License (http://www.gnu.org/licenses/gpl.txt) *
|
||||||
|
* for more details. *
|
||||||
|
* *
|
||||||
|
****************************************************************************/
|
||||||
|
/****************************************************************************
|
||||||
|
History
|
||||||
|
|
||||||
|
|
||||||
|
****************************************************************************/
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#ifndef __VCGLIB_SEGMENT2
|
||||||
|
#define __VCGLIB_SEGMENT2
|
||||||
|
|
||||||
|
#include <vcg/space/point2.h>
|
||||||
|
#include <vcg/space/line2.h>
|
||||||
|
#include <vcg/space/box2.h>
|
||||||
|
|
||||||
|
namespace vcg {
|
||||||
|
|
||||||
|
/** \addtogroup space */
|
||||||
|
/*@{*/
|
||||||
|
/**
|
||||||
|
Templated class for 3D segment.
|
||||||
|
This is the class for a segment in 3D space. A Segment is stored just as its two extrema (Point3).
|
||||||
|
@param SegmentScalarType (template parameter) Specifies the type of scalar used to represent coords.
|
||||||
|
*/
|
||||||
|
template <class SegmentScalarType >
|
||||||
|
class Segment2
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
|
||||||
|
/// The scalar type
|
||||||
|
typedef SegmentScalarType ScalarType;
|
||||||
|
|
||||||
|
/// The point type
|
||||||
|
typedef Point2<SegmentScalarType> PointType;
|
||||||
|
|
||||||
|
/// The point type
|
||||||
|
typedef Segment2<SegmentScalarType> SegmentType;
|
||||||
|
|
||||||
|
private:
|
||||||
|
|
||||||
|
/// _extrema
|
||||||
|
PointType _p0,_p1;
|
||||||
|
|
||||||
|
public:
|
||||||
|
|
||||||
|
/// Members to access either extrema
|
||||||
|
inline const PointType &P0() const { return _p0; }
|
||||||
|
inline const PointType &P1() const { return _p1; }
|
||||||
|
inline PointType &P0() { return _p0; }
|
||||||
|
inline PointType &P1() { return _p1; }
|
||||||
|
/// The empty constructor
|
||||||
|
Segment2() {};
|
||||||
|
/// The (a,b) constructor
|
||||||
|
Segment2(const PointType &a, const PointType &b) { _p0=a; _p1=b; };
|
||||||
|
/// Operator to compare segments
|
||||||
|
inline bool operator == ( SegmentType const & p ) const
|
||||||
|
{ return _p0==p._p0 && _p1==p._p1; }
|
||||||
|
/// Operator to dispare segments
|
||||||
|
inline bool operator != ( SegmentType const & p ) const
|
||||||
|
{ return _p0!=p._p0 || _p1!=p._p1; }
|
||||||
|
/// initializes the segment with its extrema
|
||||||
|
void Set( const PointType &a, const PointType &b)
|
||||||
|
{ _p0=a; _p1=b;}
|
||||||
|
/// calculates the point of parameter t on the segment.
|
||||||
|
/// if t is in [0..1] returned point is inside the segment
|
||||||
|
inline PointType P( const ScalarType t ) const
|
||||||
|
{ return _p0 + (_p1 - _p0) * t; }
|
||||||
|
/// return the middle point
|
||||||
|
inline PointType MidPoint( ) const
|
||||||
|
{ return ( _p0 + _p1) / ScalarType(2.0) ; }
|
||||||
|
/// return the bounding box
|
||||||
|
inline Box2<ScalarType> BBox( ) const
|
||||||
|
{
|
||||||
|
Box2<ScalarType> t;
|
||||||
|
t.Add(_p0);
|
||||||
|
t.Add(_p1);
|
||||||
|
return t;
|
||||||
|
}
|
||||||
|
/// returns segment length
|
||||||
|
ScalarType Length()
|
||||||
|
{ return (_p0 - _p1).Norm(); }
|
||||||
|
/// return segment squared lenght
|
||||||
|
ScalarType SquaredLength()
|
||||||
|
{ return (_p0 - _p1).SquaredNorm(); }
|
||||||
|
/// flips: a-b becomes b-a
|
||||||
|
void Flip()
|
||||||
|
{ PointType t=_p0; _p0=_p1; _p1=t; }
|
||||||
|
/// importer for different line types
|
||||||
|
template <class Q>
|
||||||
|
inline void Import( const Segment2<Q> & b )
|
||||||
|
{ _p0.Import( b.P0() ); _p1.Import( b.P1() );
|
||||||
|
}
|
||||||
|
/// copy constructor (builds a new segment importing an existing one)
|
||||||
|
template <class Q>
|
||||||
|
static SegmentType Construct( const Segment2<Q> & b )
|
||||||
|
{ return SegmentType(PointType::Construct(b.P0()), PointType::Construct(b.P1()));}
|
||||||
|
|
||||||
|
//@{
|
||||||
|
/** @name Linearity for 3d segments (operators +, -, *, /) **/
|
||||||
|
inline SegmentType operator + ( SegmentType const & p) const
|
||||||
|
{return SegmentType( _p0+p.P0(), _p1+p.P1() );}
|
||||||
|
inline SegmentType operator - ( SegmentType const & p) const
|
||||||
|
{return SegmentType( _p0-p.P0(), _p1-p.P1() );}
|
||||||
|
inline SegmentType operator * ( const ScalarType s ) const
|
||||||
|
{return SegmentType( _p0*s, _p1*s );}
|
||||||
|
inline SegmentType operator / ( const ScalarType s ) const
|
||||||
|
{ScalarType s0=((ScalarType)1.0)/s; return SegmentType( _p0*s0, _p1*s0 );}
|
||||||
|
//@}
|
||||||
|
|
||||||
|
}; // end class definition
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
typedef Segment2<short> Segment2s;
|
||||||
|
typedef Segment2<int> Segment2i;
|
||||||
|
typedef Segment2<float> Segment2f;
|
||||||
|
typedef Segment2<double> Segment2d;
|
||||||
|
|
||||||
|
template <class ScalarType>
|
||||||
|
Point2<ScalarType> ClosestPoint( Segment2<ScalarType> s, const Point2<ScalarType> & p)
|
||||||
|
{
|
||||||
|
vcg::Line2<ScalarType> l;
|
||||||
|
l.Set(s.P0(),s.P1()-s.P0());
|
||||||
|
l.Normalize();
|
||||||
|
Point2<ScalarType> clos=vcg::ClosestPoint<ScalarType,true>(l,p) ;//attention to call
|
||||||
|
vcg::Box2<ScalarType> b;
|
||||||
|
b.Add(s.P0());
|
||||||
|
b.Add(s.P1());
|
||||||
|
if (b.IsIn(clos))
|
||||||
|
return clos;
|
||||||
|
else
|
||||||
|
{
|
||||||
|
ScalarType d0=(s.P0()-p).Norm();
|
||||||
|
ScalarType d1=(s.P1()-p).Norm();
|
||||||
|
if (d0<d1)
|
||||||
|
return (s.P0());
|
||||||
|
else
|
||||||
|
return (s.P1());
|
||||||
|
}
|
||||||
|
/*ScalarType t = s.Projection(p);
|
||||||
|
if (s<0) return s.P0();
|
||||||
|
if (s>1) return s.P0();
|
||||||
|
return s.P(t);*/
|
||||||
|
}
|
||||||
|
|
||||||
|
/*@}*/
|
||||||
|
|
||||||
|
} // end namespace
|
||||||
|
#endif
|
||||||
Loading…
Reference in New Issue