Enter your search terms GNU-Darwin Web Submit search form

crysball.h /* Copyright (C) 2000 by Norman Krämer This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef __CS_CRYSBALL_H__ #define __CS_CRYSBALL_H__ #include "csutil/cstreend.h" #include "csgeom/vector3.h" #include "csgeom/math3d.h" #include "csgeom/transfrm.h" #include "ivaria/polymesh.h" class csCrystalBall { class csCrystalBallVec : public csVector3 { protected: int idx; // holds the index of the polygon public: csCrystalBallVec (int polyidx) { idx = polyidx; } inline int GetIndex () { return idx; } }; class csTriNode : public csTreeNode { public: enum { INSIDE = 0, OUTSIDE = 1 }; int from, len; // contains <len> points in vPoints starting at <from> int divider; // index to point that divides this triangle csTriNode (csTriNode *theParent=NULL, int from=-1, int len=0) : csTreeNode (theParent) {this->from = from; this->len = len;} // find a triangle for <normal> and return the index where its been inserted into vP int Add (const csCrystalBallVec *normal, int tri1, int tri2, int tri3, csVector *vP, csVector *vTP); // adjust (from,len) pairs after a new point was inserted void Adjust (int nPos); // classify a point to lie inside or outside the spherical triangle int Classify (const csVector3 &n, int i1, int i2, int i3, const csVector *vTP) const; // are all 3 normals on the side <useSign> // 0 ... yes // 1 ... partly // 2 ... all on other side int SignMatches (const csVector3 *n1, const csVector3 *n2, const csVector3 *td, int useSign); // is the normal tn on the <useSign> side ? bool SignMatches (const csVector3 *tn, int useSign); // rotate the unitsphere by matrix <m>. Add all polygon indices to <indexVector> // which normlals point to the <useSign> side void Transform (const csMatrix3 &m, csVector &indexVector, int useSign, long cookie, const csVector *vP, const csVector *vTP, const csVector3 &v1, const csVector3 &v2, const csVector3 &v3); }; protected: // here we store the normals (pointers to csCrystalBallVec) csVector vPoints; // we divide a triangle into 3 sub triangles by inserting a divider point. // and <vTrianglePoints> is the place where we store those points (pointers to csVector3) csVector vTrianglePoints; // our crystal ball is initially made of 8 spherical triangles (in the octants of a 3d cartesian coo system) csTriNode tri[8]; public: csCrystalBall (); ~csCrystalBall (); // add all polygons in <polyset> to the crystal ball void Build (iPolygonMesh *polyset); // add a single polygon to the crystal ball void InsertPolygon (iPolygonMesh *polyset, int idx); // rotate the unitsphere by <t>. Add all polygon indices to <indexVector> // which normlals point to the <useSign> side void Transform (const csTransform &t, csVector &indexVector, int useSign, long cookie); }; #endif // __CS_CRYSBALL_H__ Generated for Crystal Space by doxygen 1.2.5 written by Dimitri van Heesch, ©1997-2000