// =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-==-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= // // // Project: Talina Gaming System (TgS) (∂) // File: TgS Collision - Rectangle-Triangle.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_RECTANGLE_STRI_INL_) #define _TGS_COLLISION_RECTANGLE_STRI_INL_ #pragma once // ============================================================================================================================== // // F_Dist[Sq], F_Closest[Sq] - Return the minimal distance [squared] between the primitives or negative type max if intersecting. // tgRT0 Rectangle (Input) // tgST0 Space Triangle (Input) // tvRT0 The point of closest proximity on the rectangle. (Output) // tvST0 The point of closest proximity on the triangle. (Output) // tyRT0 Parametric parameter #1 to generate point of contact based on the rectangle. (Output) // tyRT1 Parametric parameter #2 to generate point of contact based on the rectangle. (Output) // tyST0 Barycentric value for edge 0-1 describing point of closest proximity. (Output) // tyST1 Barycentric value for edge 0-2 describing point of closest proximity. (Output) // tgCL Container of points resulting from the clip operation. (Output) // ============================================================================================================================== // namespace TGS { // START TGS /////////////////////////////////////////////////////////////////////////////////////////////////////// namespace COL { // START COL /////////////////////////////////////////////////////////////////////////////////////////////////////// // ============================================================================================================================== // template <typename TYPE, int DIM> TgFORCEINLINE TYPE F_DistSq( CR_(RECTANGLE,DIM) tgRT0, CR_(STRI,DIM) tgST0 ) { TYPE tyT0,tyT1, tyT2,tyT3; return (F_ClosestSq( &tyT0,&tyT1, &tyT2,&tyT3, tgRT0, tgST0 )); }; template <typename TYPE, int DIM> TgFORCEINLINE TYPE F_Dist( CR_(RECTANGLE,DIM) tgRT0, CR_(STRI,DIM) tgST0 ) { TYPE tyT0,tyT1, tyT2,tyT3; const TYPE tyDistSq = F_ClosestSq( &tyT0,&tyT1, &tyT2,&tyT3, tgRT0, tgST0 ); return (P::FSEL( tyDistSq, P::SQRT( tyDistSq ), -LIMITS<TYPE>::MAX )); }; // - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - // template <typename TYPE, int DIM> TgFORCEINLINE TYPE F_ClosestSq( PC_(VECTOR,DIM) ptvRT0, PC_(VECTOR,DIM) ptvST0, CR_(RECTANGLE,DIM) tgRT0, CR_(STRI,DIM) tgST0 ) { TYPE tyRT00, tyRT01, tyST00, tyST01; const TYPE tyDistSq = F_ClosestSq( &tyRT00,&tyRT01, &tyST00,&tyST01, tgRT0, tgST0 ); C_(VECTOR,DIM) tvK0 = MATH::F_MUL( tyRT00, tgRT0.Query_Edge0() ); C_(VECTOR,DIM) tvK1 = MATH::F_MUL( tyRT01, tgRT0.Query_Edge1() ); C_(VECTOR,DIM) tvK2 = MATH::F_MUL( tyST00, tgST0.Query_Edge0() ); C_(VECTOR,DIM) tvK3 = MATH::F_MUL( tyST01, tgST0.Query_Edge2() ); *ptvRT0 = MATH::F_ADD( MATH::F_ADD( tgRT0.Query_Origin(), tvK0 ), tvK1 ); *ptvST0 = MATH::F_SUB( MATH::F_ADD( tgST0.Query_Origin(), tvK2 ), tvK3 ); return (P::FSEL( tyDistSq, tyDistSq, -LIMITS<TYPE>::MAX )); }; template <typename TYPE, int DIM> TgFORCEINLINE TYPE F_Closest( PC_(VECTOR,DIM) ptvRT0, PC_(VECTOR,DIM) ptvST0, CR_(RECTANGLE,DIM) tgRT0, CR_(STRI,DIM) tgST0 ) { TYPE tyRT00, tyRT01, tyST00, tyST01; const TYPE tyDistSq = F_ClosestSq( &tyRT00,&tyRT01, &tyST00,&tyST01, tgRT0, tgST0 ); C_(VECTOR,DIM) tvK0 = MATH::F_MUL( tyRT00, tgRT0.Query_Edge0() ); C_(VECTOR,DIM) tvK1 = MATH::F_MUL( tyRT01, tgRT0.Query_Edge1() ); C_(VECTOR,DIM) tvK2 = MATH::F_MUL( tyST00, tgST0.Query_Edge0() ); C_(VECTOR,DIM) tvK3 = MATH::F_MUL( tyST01, tgST0.Query_Edge2() ); *ptvRT0 = MATH::F_ADD( MATH::F_ADD( tgRT0.Query_Origin(), tvK0 ), tvK1 ); *ptvST0 = MATH::F_SUB( MATH::F_ADD( tgST0.Query_Origin(), tvK2 ), tvK3 ); return (P::FSEL( tyDistSq, P::SQRT( tyDistSq ), -LIMITS<TYPE>::MAX )); }; template <typename TYPE, int DIM> TgFORCEINLINE TYPE F_Closest( TYPE *ptyRT0, TYPE *ptyRT1, TYPE *ptyST0, TYPE *ptyST1, CR_(RECTANGLE,DIM) tgRT0, CR_(STRI,DIM) tgST0 ) { const TYPE tyDistSq = F_ClosestSq( ptyRT0,ptyRT1, ptyST0,ptyST1, tgRT0, tgST0 ); return (P::FSEL( tyDistSq, P::SQRT( tyDistSq ), -LIMITS<TYPE>::MAX )); }; // - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - // template <typename TYPE, int DIM> TgFORCEINLINE TgRESULT F_Clip( PC_(CLIP_LIST,DIM) ptgCL, CR_(STRI,DIM) tgST0, CR_(RECTANGLE,DIM) tgRT0 ) { if (ptgCL->m_niMax < 8) { TgASSERT(TgFALSE); return (TgE_FAIL); }; ptgCL->m_ptvPoint[0] = tgRT0.Query_Point0(); ptgCL->m_ptvPoint[1] = tgRT0.Query_Point1(); ptgCL->m_ptvPoint[2] = tgRT0.Query_Point2(); ptgCL->m_ptvPoint[3] = tgRT0.Query_Point3(); ptgCL->m_niPoint = 4; return (F_Clip( ptgCL, tgST0 )); }; // ============================================================================================================================== // }; // END COL ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// }; // END TGS ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #endif // END ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////