43#ifndef LASS_GUARDIAN_OF_INCLUSION_PRIM_RAY_3D_SIMPLE_POLYGON_3D_H
44#define LASS_GUARDIAN_OF_INCLUSION_PRIM_RAY_3D_SIMPLE_POLYGON_3D_H
68template<
typename T,
class EP1,
class NP1,
class NP2,
class PP2>
73 typedef Point2D<T> TPoint;
74 typedef typename TPoint::TValue TValue;
const TPoint point(TParam a_t) const
Return point on ray by it's parameter.
bool contains(const TPoint &iP) const
return true if a point iP is inside the polygon, on condition iP is on the plane
const TPlane & plane() const
return support plane of polygon.
Result intersect(const SimplePolygon3D< T, EP1, NP1 > &polygon, const Ray3D< T, NP2, PP2 > &triangle, T &t, const T &tMin)
Find the intersection of a ray and a simple polygon by their parameter t on the ray.
set of geometrical primitives
Result
meta information on the result you have from an operation like an intersection ...
@ rNone
operation has no answer, output arguments are meaningless
@ rOne
there's exactly one answer, 1 output argument contains the answer
Library for Assembled Shared Sources.