// =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-==-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= // // // Project: Talina Gaming System (TgS) (∂) // File: TgS Collision - Plane-Point.inl // Author: Andrew Aye (EMail: andrew.aye@gmail.com, Web: http://www.andrewaye.com) // Version: 3.11 // // ------------------------------------------------------------------------------------------------------------------------------ // // // Copyright: © 2002-2008, Andrew Aye. All Rights Reserved. // // This software is free for non-commercial use. Redistribution and use in source and binary forms, with or without modification, // are permitted provided that the following conditions are met: // Redistributions of source code must retain this copyright notice, this list of conditions and the following disclaimers. // Redistributions in binary form must reproduce this copyright notice, this list of conditions and the following // disclaimers in the documentation and other materials provided with the distribution. // // Neither the names of the copyright owner nor the names of its contributors may be used to endorse or promote products derived // from this software without specific prior written permission. // // The intellectual property rights of the algorithms used reside with Andrew Aye. You may not use this software, in whole or // in part, in support of any commercial product without the express written consent of the author. // // There is no warranty or other guarantee of fitness of this software for any purpose. It is provided solely "as is". // // =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-==-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= // #if !defined(_TGS_COLLISION_PLANE_POINT_INL_) #define _TGS_COLLISION_PLANE_POINT_INL_ #pragma once // ============================================================================================================================== // // F_Dist[Sq], F_Closest[Sq] - Return the minimal distance [squared] between the primitives or negative type max if intersecting. // tgPN0 Plane (Input) // tvS0 Point (Input) // tvPN0 The point of closest proximity on the plane. (Output) // ============================================================================================================================== // namespace TGS { // START TGS /////////////////////////////////////////////////////////////////////////////////////////////////////// namespace COL { // START COL /////////////////////////////////////////////////////////////////////////////////////////////////////// // ============================================================================================================================== // template <typename TYPE, int DIM> TgFORCEINLINE TYPE F_ClosestSq( PC_(VECTOR,DIM) ptvPN0, CR_(PLANE,DIM) tgPN0, M_(VECTOR,DIM) tvS0 ) { const TYPE tyDist = MATH::F_DOT( tgPN0.Query_Normal(), tvS0 ) + tgPN0.Query_Constant(); *ptvPN0 = MATH::F_SUB( tvS0, MATH::F_MUL( tyDist, tgPN0.Query_Normal() ) ); return (P::FSEL( tyDist, tyDist*tyDist, -LIMITS<TYPE>::MAX )); }; template <typename TYPE, int DIM> TgFORCEINLINE TYPE F_Closest( PC_(VECTOR,DIM) ptvPN0, CR_(PLANE,DIM) tgPN0, M_(VECTOR,DIM) tvS0 ) { const TYPE tyDist = MATH::F_DOT( tgPN0.Query_Normal(), tvS0 ) + tgPN0.Query_Constant(); *ptvPN0 = MATH::F_SUB( tvS0, MATH::F_MUL( tyDist, tgPN0.Query_Normal() ) ); return (P::FSEL( tyDist, tyDist, -LIMITS<TYPE>::MAX )); }; template <typename TYPE, int DIM> TgFORCEINLINE TYPE SignClosest( PC_(VECTOR,DIM) ptvPN0, CR_(PLANE,DIM) tgPN0, M_(VECTOR,DIM) tvS0 ) { const TYPE tyDist = MATH::F_DOT( tgPN0.Query_Normal(), tvS0 ) + tgPN0.Query_Constant(); *ptvPN0 = MATH::F_SUB( tvS0, MATH::F_MUL( tyDist, tgPN0.Query_Normal() ) ); return (tyDist); }; // - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - // template <typename TYPE, int DIM> TgFORCEINLINE TgBOOL F_Contact_Test( CR_(PLANE,DIM) tgPN0, M_(VECTOR,DIM) tvS0 ) { return (0 == (tgPN0.Query_Normal() * tvS0 + tgPN0.Query_Constant())); }; // - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - // template <typename TYPE> TgFORCEINLINE TYPE F_ClosestSq( PC_(VECTOR,4) ptvPN0, const TTgPLANE<TYPE,4> &tgPN0, CR_(VECTOR,4) tvS0 ) { const TYPE tyDist = F_Sign_Dist( tgPN0, tvS0 ); *ptvPN0 = MATH::F_SUB( tvS0, MATH::F_MUL( tyDist, tgPN0.Query_Normal() ) ); return (P::FSEL( tyDist, tyDist*tyDist, -LIMITS<TYPE>::MAX )); }; template <typename TYPE> TgFORCEINLINE TYPE F_Closest( PC_(VECTOR,4) ptvPN0, const TTgPLANE<TYPE,4> &tgPN0, CR_(VECTOR,4) tvS0 ) { const TYPE tyDist = F_Sign_Dist( tgPN0, tvS0 ); *ptvPN0 = MATH::F_SUB( tvS0, MATH::F_MUL( tyDist, tgPN0.Query_Normal() ) ); return (P::FSEL( tyDist, tyDist, -LIMITS<TYPE>::MAX )); }; template <typename TYPE> TgFORCEINLINE TYPE SignClosest( PC_(VECTOR,4) ptvPN0, const TTgPLANE<TYPE,4> &tgPN0, CR_(VECTOR,4) tvS0 ) { const TYPE tyDist = F_Sign_Dist( tgPN0, tvS0 ); *ptvPN0 = MATH::F_SUB( tvS0, MATH::F_MUL( tyDist, tgPN0.Query_Normal() ) ); return (tyDist); }; // ============================================================================================================================== // }; // END COL ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// }; // END TGS ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #endif // END ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////