1 files changed, 64 insertions, 0 deletions
diff --git a/third-party/Opcode/Ice/IceIndexedTriangle.h b/third-party/Opcode/Ice/IceIndexedTriangle.h
new file mode 100644
index 0000000..ef279c2
--- /dev/null
+++ b/third-party/Opcode/Ice/IceIndexedTriangle.h
@@ -0,0 +1,64 @@
+///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+/**
+ *	Contains a handy indexed triangle class.
+ *	\file		IceIndexedTriangle.h
+ *	\author		Pierre Terdiman
+ *	\date		January, 17, 2000
+ */
+///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+// Include Guard
+#ifndef __ICEINDEXEDTRIANGLE_H__
+#define __ICEINDEXEDTRIANGLE_H__
+
+	// An indexed triangle class.
+	class ICEMATHS_API IndexedTriangle
+	{
+		public:
+		//! Constructor
+		inline_					IndexedTriangle()									{}
+		//! Constructor
+		inline_					IndexedTriangle(udword r0, udword r1, udword r2)	{ mVRef[0]=r0; mVRef[1]=r1; mVRef[2]=r2; }
+		//! Copy constructor
+		inline_					IndexedTriangle(const IndexedTriangle& triangle)
+								{
+									mVRef[0] = triangle.mVRef[0];
+									mVRef[1] = triangle.mVRef[1];
+									mVRef[2] = triangle.mVRef[2];
+								}
+		//! Destructor
+		inline_					~IndexedTriangle()									{}
+		//! Vertex-references
+				udword			mVRef[3];
+
+		// Methods
+				void			Flip();
+				float			Area(const IcePoint* verts)											const;
+				float			Perimeter(const IcePoint* verts)										const;
+				float			Compacity(const IcePoint* verts)										const;
+				void			Normal(const IcePoint* verts, IcePoint& normal)							const;
+				void			DenormalizedNormal(const IcePoint* verts, IcePoint& normal)				const;
+				void			Center(const IcePoint* verts, IcePoint& center)							const;
+				void			CenteredNormal(const IcePoint* verts, IcePoint& normal)					const;
+				void			RandomPoint(const IcePoint* verts, IcePoint& random)						const;
+				bool			IsVisible(const IcePoint* verts, const IcePoint& source)					const;
+				bool			BackfaceCulling(const IcePoint* verts, const IcePoint& source)			const;
+				float			ComputeOcclusionPotential(const IcePoint* verts, const IcePoint& view)	const;
+				bool			ReplaceVertex(udword oldref, udword newref);
+				bool			IsDegenerate()														const;
+				bool			HasVertex(udword ref)												const;
+				bool			HasVertex(udword ref, udword* index)								const;
+				ubyte			FindEdge(udword vref0, udword vref1)								const;
+				udword			OppositeVertex(udword vref0, udword vref1)							const;
+		inline_	udword			OppositeVertex(ubyte edgenb)										const	{ return mVRef[2-edgenb];	}
+				void			GetVRefs(ubyte edgenb, udword& vref0, udword& vref1, udword& vref2)	const;
+				float			MinEdgeLength(const IcePoint* verts)									const;
+				float			MaxEdgeLength(const IcePoint* verts)									const;
+				void			ComputePoint(const IcePoint* verts, float u, float v, IcePoint& pt, udword* nearvtx=null)	const;
+				float			Angle(const IndexedTriangle& tri, const IcePoint* verts)				const;
+		inline_	IcePlane			PlaneEquation(const IcePoint* verts)									const	{ return IcePlane(verts[mVRef[0]], verts[mVRef[1]], verts[mVRef[2]]);	}
+				bool			Equal(const IndexedTriangle& tri)									const;
+	};
+
+#endif // __ICEINDEXEDTRIANGLE_H__