[an error occurred while processing this directive] 
// =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-==-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= //
//
//  Project:   Talina Gaming System (TgS) (∂)
//  File:      TgS Collision - Box-Sphere.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_BOX_SPHERE_INL_)
#define _TGS_COLLISION_BOX_SPHERE_INL_
#pragma once

// ============================================================================================================================== //

// F_Dist[Sq], F_Closest[Sq] - Return the minimal distance [squared] between the primitives or negative type max if intersecting.

// tgBX0        Box (Input)
// tgSP0        Sphere (Input)
// tgPacket     Container of points resulting from a contact generator.  Generation parameters provided as well. (Input/Ouput)

// tvBX0        The point of closest proximity on the box. (Output)
// tvSP0        The point of closest proximity on the sphere. (Output)
// tyBX0        Parametric parameter #1 to generate point of contact based on the box. (Output)
// tyBX1        Parametric parameter #2 to generate point of contact based on the box. (Output)
// tyBX2        Parametric parameter #3 to generate point of contact based on the box. (Output)
// tgPacket     Container of points resulting from a contact generator.  Generation parameters provided as well. (Input/Ouput)

// ============================================================================================================================== //




namespace TGS { // START TGS ///////////////////////////////////////////////////////////////////////////////////////////////////////
namespace COL { // START COL ///////////////////////////////////////////////////////////////////////////////////////////////////////

// ============================================================================================================================== //

template <typename TYPE, int DIM> TgFORCEINLINE
TYPE F_DistSq( CR_(BOX,DIM) tgBX0, CR_(SPHERE,DIM) tgSP0 )
{
    const TYPE                          tyDist = F_Dist( tgBX0, tgSP0 );

    return (P::FSEL( tyDist, tyDist*tyDist, -LIMITS<TYPE>::MAX ));
};


template <typename TYPE, int DIM> TgFORCEINLINE
TYPE F_Dist( CR_(BOX,DIM) tgBX0, CR_(SPHERE,DIM) tgSP0 )
{
    const TYPE                          tyDistSq = F_DistSq( tgBX0, tgSP0.Query_Origin() );

    return (P::FSEL( tyDistSq - tgSP0.Query_RadiusSq(), P::SQRT( tyDistSq ) - tgSP0.Query_Radius(), -LIMITS<TYPE>::MAX ));
};


// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - //

template <typename TYPE, int DIM> TgFORCEINLINE
TYPE F_ClosestSq( PC_(VECTOR,DIM) ptvBX0, PC_(VECTOR,DIM) ptvSP0, CR_(BOX,DIM) tgBX0, CR_(SPHERE,DIM) tgSP0 )
{
    const TYPE                          tyDist = F_Closest( ptvBX0, ptvSP0, tgBX0, tgSP0 );

    return (P::FSEL( tyDist, tyDist*tyDist, -LIMITS<TYPE>::MAX ));
};


template <typename TYPE, int DIM> TgFORCEINLINE
TYPE F_Closest( PC_(VECTOR,DIM) ptvBX0, PC_(VECTOR,DIM) ptvSP0, CR_(BOX,DIM) tgBX0, CR_(SPHERE,DIM) tgSP0 )
{
    const TYPE                          tyTestSq = F_ClosestSq( ptvBX0, tgBX0, tgSP0.Query_Origin() );
    const TYPE                          tyDist = P::FSEL( tyTestSq - tgSP0.Query_RadiusSq(), P::SQRT( tyTestSq ), TYPE(-1.0) );
    C_(VECTOR,DIM)                      tvK0 = MATH::F_SUB( *ptvBX0, tgSP0.Query_Origin() );

    *ptvSP0 = MATH::F_ADD( tgSP0.Query_Origin(), MATH::F_MUL( tgSP0.Query_Radius() / tyDist, tvK0 ) );

    return (P::FSEL( tyDist, tyDist - tgSP0.Query_Radius(), -LIMITS<TYPE>::MAX ));
};


template <typename TYPE, int DIM> TgFORCEINLINE
TYPE F_ClosestSq( TYPE *ptyBX0, TYPE *ptyBX1, TYPE *ptyBX2, PC_(VECTOR,DIM) ptvSP0, CR_(BOX,DIM) tgBX0, CR_(SPHERE,DIM) tgSP0 )
{
    const TYPE                          tyDist = F_Closest( ptyBX0,ptyBX1,ptyBX2, ptvSP0, tgBX0, tgSP0 );

    return (P::FSEL( tyDist, tyDist*tyDist, -LIMITS<TYPE>::MAX ));
};


template <typename TYPE, int DIM> TgFORCEINLINE
TYPE F_Closest( TYPE *ptyBX0, TYPE *ptyBX1, TYPE *ptyBX2, PC_(VECTOR,DIM) ptvSP0, CR_(BOX,DIM) tgBX0, CR_(SPHERE,DIM) tgSP0 )
{
    const TYPE                          tyTestSq = F_ClosestSq( ptyBX0,ptyBX1,ptyBX2, tgBX0, tgSP0.Query_Origin() );
    const TYPE                          tyDist = P::FSEL( tyTestSq - tgSP0.Query_RadiusSq(), P::SQRT( tyTestSq ), TYPE(-1.0) );
    C_(VECTOR,DIM)                      tvK0 = MATH::F_SUB( tgBX0.Calc_Point( *ptyBX0, *ptyBX1, *ptyBX2 ), tgSP0.Query_Origin() );

    *ptvSP0 = MATH::F_ADD( tgSP0.Query_Origin(), MATH::F_MUL( tgSP0.Query_Radius() / tyDist, tvK0 ) );

    return (P::FSEL( tyDist, tyDist - tgSP0.Query_Radius(), -LIMITS<TYPE>::MAX ));
};


// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - //

template <typename TYPE, int DIM>
TgRESULT F_Contact_Penetrate( PC_(CONTACT_PACKET,DIM) ptgPacket, CR_(BOX,DIM) tgBX0, CR_(SPHERE,DIM) tgSP0 )
{
    const TgINT                         niContact = ptgPacket->m_niContact;

    C_TgRESULT tgResult = F_Contact_Penetrate( ptgPacket, tgSP0, tgBX0 );

    if (TgFAILED( tgResult ))
    {
        return (tgResult);
    };

    P_(CONTACT,DIM)                     ptgContact;

    for (TgINT iIdx = niContact; iIdx < ptgPacket->m_niContact; ++iIdx)
    {
        ptgContact = (P_(CONTACT,DIM))((PC_TgUINT08)ptgPacket->m_ptgContact + iIdx*ptgPacket->m_iStride);

        ptgContact->m_tvPos = MATH::F_ADD( ptgContact->m_tvPos, MATH::F_MUL( ptgContact->m_tvNormal, ptgContact->m_tyDepth ) );
        ptgContact->m_tvNormal = MATH::F_NEG( ptgContact->m_tvNormal );
    };

    return (tgResult);
};


// ============================================================================================================================== //

}; // END COL //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
}; // END TGS //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#endif //  END  ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
[an error occurred while processing this directive]