hgeTriangle.h

//
// Opal SDK 1.0 
// Copyright(C) 2009, Paul Blower
//

#ifndef HGETRIANGLE__
#define HGETRIANGLE__

#include "hgeLine.h"

#define hgeAbs(v) (v < 0 ? -v : v)

// Triangle Class

class hgeTriangle
{
public:

        hgeTriple * Triple;
        hgeVector vert[3];

        hgeVector GetSize()
        {
                float mnx, mxx = 0;
                float mny, mxy = 0;
                mnx = vert[0].x;
                mxx = vert[0].x;
                mny = vert[0].y;
                mxy = vert[0].y;

                for ( int i = 1; i < 3; i++ )
                {
                        if ( vert[i].x < mnx ) mnx = vert[i].x;
                        if ( vert[i].x > mxx ) mxx = vert[i].x;
                        if ( vert[i].y < mny ) mny = vert[i].y;
                        if ( vert[i].y > mxy ) mxy = vert[i].y;
                }
                return hgeVector(mxx - mnx, mxy - mny);
        }

        bool Contains(hgeVector point)
        {
                hgeVector Size = GetSize();
                        if ( Intercepts(point, point + hgeVector(-hgeAbs(Size.x), 0.1f)).collides
                                && Intercepts(point, point + hgeVector(0.1f, -hgeAbs(Size.y))).collides
                                && Intercepts(point, point + hgeVector(hgeAbs(Size.x), 0.1f)).collides
                                && Intercepts(point, point + hgeVector(0.1f, hgeAbs(Size.y))).collides
                                ) return true;
                return false;
        }

        hgeIntersect Intercepts(hgeVector point1, hgeVector point2)
    {
        return Intercepts( hgeLine(point1, point2) );
    }

    hgeIntersect Intercepts(hgeLine line)
        {
                hgeIntersect dat = line.Intersects(hgeLine(vert[0], vert[1])); 
                if ( !dat.collides)
                {
                        dat = line.Intersects(hgeLine(vert[1], vert[2])); 
                        if ( !dat.collides)
                        {
                                dat = line.Intersects(hgeLine(vert[2], vert[0]));
                        }
                }
                return dat;
        }
        
        hgeTriangle(hgeVector verticies[3])
        {
                Triple = new hgeTriple();

                Triple->v[0].z = 0.5;
                Triple->v[1].z = 0.5;
                Triple->v[2].z = 0.5;

                Triple->v[0].col = 0xFFFFFFFF;
                Triple->v[1].col = 0xFFFFFFFF;
                Triple->v[2].col = 0xFFFFFFFF;

                Triple->blend = BLEND_DEFAULT;
                for ( int i = 0; i < 3; i++ )
                {
                        vert[i] = verticies[i];
                }

        }

        hgeTriangle(hgeVector v1, hgeVector v2, hgeVector v3)
        {
                Triple = new hgeTriple();
                Triple->v[0].z = 0.5;
                Triple->v[1].z = 0.5;
                Triple->v[2].z = 0.5;

                Triple->v[0].col = 0xFFFFFFFF;
                Triple->v[1].col = 0xFFFFFFFF;
                Triple->v[2].col = 0xFFFFFFFF;

                Triple->blend = BLEND_DEFAULT;

                vert[0] = v1;
                vert[1] = v2;
                vert[2] = v3;

        }

        ~hgeTriangle()
        {
                if ( Triple )
            delete Triple;
        }
};

#endif

---