|
| LineSegment () |
| Uninitialised.
|
|
| LineSegment (const T &P0, const T &P1) |
|
template<class S > |
bool | operator== (const S &other) const |
| Equality.
|
|
template<class S > |
bool | operator!= (const S &other) const |
|
template<class S > |
const LineSegment & | operator*= (const S &m) |
|
template<class S > |
LineSegment | operator* (const S &m) const |
|
T | operator() (BaseType t) const |
|
T | direction () const |
| p1 - p0
|
|
T | normalizedDirection () const |
| (p1 - p0).normalized()
|
|
BaseType | length () const |
| Distance between p0 and p1.
|
|
BaseType | length2 () const |
| Distance squared between p0 and p1.
|
|
T | closestPointTo (const T &point) const |
| Returns the point on this LineSeqment which is closest to the specified point.
|
|
T | closestPointTo (const T &point, BaseType &t) const |
| As above but also fills in t with the parameter value at the point.
|
|
T | closestPoints (const LineSegment &line, T &otherPoint) const |
|
BaseType | distanceTo (const T &point) const |
|
BaseType | distance2To (const T &point) const |
| Returns the shortest squared distance to the point.
|
|
BaseType | distanceTo (const LineSegment &line) const |
|
BaseType | distance2To (const LineSegment &line) const |
| Returns the shortest squared distance to the line.
|
|
template<class S > |
bool | intersect (const Imath::Plane3< S > &plane, T &intersection) const |
|
template<class S > |
bool | intersectT (const Imath::Plane3< S > &plane, BaseType &t) const |
|
template<class T>
class IECore::LineSegment< T >
The LineSegment class represents the portion of a line bounded by two endpoints - this is in contrast to the Imath::Line class which represents a line with infinite extent.