// =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-==-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= //
//
//  Project:   Talina Gaming System (TgS) (∂)
//  File:      TgS Collision - Triangle-Line.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_TRIANGLE_LINE_INL_)
#define _TGS_COLLISION_TRIANGLE_LINE_INL_
#pragma once

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

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

// tgST0        Space Triangle (Input)
// tgLN0        Line (Input)
// tgPacket     Container of points resulting from a contact generator.  Generation parameters provided as well. (Input/Ouput)

// tvST0        The point of closest proximity on the triangle. (Output)
// tvLN0        The point of closest proximity on the line. (Output)
// tyST0        Parametric parameter #1 to generate point of contact based on the triangle. (Output)
// tyST1        Parametric parameter #2 to generate point of contact based on the triangle. (Output)
// tyLN0        Parametric parameter to generate point of interest #1 based on the line. (Output)
// tyLN1        Parametric parameter to generate point of interest #2 based on the line. (Output)
// tgPacket     Container of points resulting from a contact generator.  Generation parameters provided as well. (Input/Ouput)
// 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_(STRI,DIM) tgST0, CR_(LINE,DIM) tgLN0 )
{
    TYPE                                tyST0,tyST1, tyG1;

    return (TTgCSQ_STLN<TYPE,DIM,0,0>::DO( &tyST0,&tyST1, &tyG1, tgST0, tgLN0.Query_Origin(),tgLN0.Query_DirN() ));
};


template <typename TYPE, int DIM> TgFORCEINLINE
TYPE F_Dist( CR_(STRI,DIM) tgST0, CR_(LINE,DIM) tgLN0 )
{
    const TYPE                          tyDistSq = F_DistSq( tgST0, tgLN0 );

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


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

template <typename TYPE, int DIM> TgFORCEINLINE
TYPE F_ClosestSq( PC_(VECTOR,DIM) ptvST0, PC_(VECTOR,DIM) ptvLN0, CR_(STRI,DIM) tgST0, CR_(LINE,DIM) tgLN0 )
{
    return (TTgCSQ_STLN<TYPE,DIM,0,0>::DO( ptvST0, ptvLN0, tgST0, tgLN0.Query_Origin(),tgLN0.Query_DirN() ));
};


template <typename TYPE, int DIM> TgFORCEINLINE
TYPE F_Closest( PC_(VECTOR,DIM) ptvST0, PC_(VECTOR,DIM) ptvLN0, CR_(STRI,DIM) tgST0, CR_(LINE,DIM) tgLN0 )
{
    const TYPE                          tyDistSq = F_ClosestSq( ptvST0, ptvLN0, tgST0, tgLN0 );

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


template <typename TYPE, int DIM> TgFORCEINLINE
TYPE F_ClosestSq( TYPE *ptyST0, TYPE *ptyST1, TYPE *ptyLN0, CR_(STRI,DIM) tgST0, CR_(LINE,DIM) tgLN0 )
{
    return (TTgCSQ_STLN<TYPE,DIM,0,0>::DO( ptyST0,ptyST1, ptyLN0, tgST0, tgLN0.Query_Origin(),tgLN0.Query_DirN() ));
};


template <typename TYPE, int DIM> TgFORCEINLINE
TYPE F_Closest( TYPE *ptyST0, TYPE *ptyST1, TYPE *ptyLN0, CR_(STRI,DIM) tgST0, CR_(LINE,DIM) tgLN0 )
{
    const TYPE                          tyDistSq = F_ClosestSq( ptyST0,ptyST1, ptyLN0, tgST0, tgLN0 );

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


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

template <typename TYPE, int DIM> TgFORCEINLINE
TgBOOL F_Contact_Test( CR_(ETRI,DIM) tgET0, CR_(LINE,DIM) tgLN0 )
{
    TYPE                                tyST0,tyST1, tyLN0;

    return (TgSUCCEEDED(F_Contact_Intersect( &tyST0,&tyST1, &tyLN0, tgET0, tgLN0 )));
};


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

template <typename TYPE, int DIM> TgFORCEINLINE
TgRESULT F_Contact_Intersect( PC_(CONTACT_PACKET,DIM) ptgPacket, CR_(ETRI,DIM) tgET0, CR_(LINE,DIM) tgLN0 )
{
    return (TTgINT_ETLN<TYPE,DIM,0,0>::DO( ptgPacket, tgET0, tgLN0.Query_Origin(),tgLN0.Query_DirN() ));
};


template <typename TYPE, int DIM> TgFORCEINLINE
TgRESULT F_Contact_Intersect( TYPE *ptyET0, TYPE *ptyET1, TYPE *ptyLN0, CR_(ETRI,DIM) tgET0, CR_(LINE,DIM) tgLN0 )
{
    return (TTgINT_ETLN<TYPE,DIM,0,0>::DO( ptyET0,ptyET1, ptyLN0, tgET0, tgLN0.Query_Origin(),tgLN0.Query_DirN() ));
};


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

template <typename TYPE, int DIM> TgFORCEINLINE
TgRESULT F_ClipF( PC_(CLIP_LIST,DIM) ptgCL, CR_(STRI,DIM) tgST0, CR_(LINE,DIM) tgLN0 )
{
    return (TTgCLF_STLN<TYPE,DIM,0,0>::DO( ptgCL, tgST0, tgLN0.Query_Origin(),tgLN0.Query_DirN() ));
};


template <typename TYPE, int DIM> TgFORCEINLINE
TgRESULT F_ClipF( TYPE *ptyLN0, TYPE *ptyLN1, PC_TgINT piCode, CR_(STRI,DIM) tgST0, CR_(LINE,DIM) tgLN0 )
{
    return (TTgCLF_STLN<TYPE,DIM,0,0>::DO( ptyLN0,ptyLN1, piCode, tgST0, tgLN0.Query_Origin(),tgLN0.Query_DirN() ));
};


template <typename TYPE, int DIM> TgFORCEINLINE
TgRESULT F_Clip( PC_(CLIP_LIST,DIM) ptgCL, CR_(STRI,DIM) tgST0, CR_(LINE,DIM) tgLN0 )
{
    return (TTgCLP_STLN<TYPE,DIM,0,0>::DO( ptgCL, tgST0, tgLN0.Query_Origin(),tgLN0.Query_DirN() ));
};


template <typename TYPE, int DIM> TgFORCEINLINE
TgRESULT F_Clip( TYPE *ptyLN0, TYPE *ptyLN1, CR_(STRI,DIM) tgST0, CR_(LINE,DIM) tgLN0 )
{
    return (TTgCLP_STLN<TYPE,DIM,0,0>::DO( ptyLN0,ptyLN1, tgST0, tgLN0.Query_Origin(),tgLN0.Query_DirN() ));
};


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

}; // END COL //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
}; // END TGS //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#endif //  END  ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////