mirror/glm
1
0
Fork 0
mirror of https://github.com/g-truc/glm.git synced 2024-11-10 04:31:47 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #238 from SiliconKiwi/patch-1

Browse Source 
Closest point algorithm can be easily extended to support 2d points #238
This commit is contained in:
Christophe Riccio 2014-10-05 16:09:10 +02:00
commit 38399875f4
2 changed files with 28 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
glm/gtx/closest_point.hpp
View File

@ -57,6 +57,13 @@ namespace glm
detail::tvec3<T, P> const & a,
detail::tvec3<T, P> const & b);
/// 2d lines work as well
template <typename T, precision P>
GLM_FUNC_DECL detail::tvec2<T, P> closestPointOnLine(
detail::tvec2<T, P> const & point,
detail::tvec2<T, P> const & a,
detail::tvec2<T, P> const & b);
/// @}
}// namespace glm

21
glm/gtx/closest_point.inl
View File

@ -28,4 +28,25 @@ namespace glm
if(Distance >= LineLength) return b;
return a + LineDirection * Distance;
}
template <typename T, precision P>
GLM_FUNC_QUALIFIER detail::tvec2<T, P> closestPointOnLine
(
detail::tvec2<T, P> const & point,
detail::tvec2<T, P> const & a,
detail::tvec2<T, P> const & b
)
{
T LineLength = distance(a, b);
detail::tvec2<T, P> Vector = point - a;
detail::tvec2<T, P> LineDirection = (b - a) / LineLength;
// Project Vector to LineDirection to get the distance of point from a
T Distance = dot(Vector, LineDirection);
if(Distance <= T(0)) return a;
if(Distance >= LineLength) return b;
return a + LineDirection * Distance;
}
}//namespace glm