Home

nevrax.com

Nevrax.org News Mailing-list Documentation CVS Bugs License

Documentation                       Search   polygon.h Go to the documentation of this file. /* Copyright, 2000 Nevrax Ltd. * * This file is part of NEVRAX NEL. * NEVRAX NEL is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2, or (at your option) * any later version. * NEVRAX NEL 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 * General Public License for more details. * You should have received a copy of the GNU General Public License * along with NEVRAX NEL; see the file COPYING. If not, write to the * Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, * MA 02111-1307, USA. */ #ifndef NL_POLYGON_H #define NL_POLYGON_H #include "nel/misc/types_nl.h" #include "nel/misc/matrix.h" #include "nel/misc/stream.h" #include "nel/misc/vector_2f.h" #include <vector> namespace NLMISC { using NLMISC::CVector; using NLMISC::CPlane; using NLMISC::CMatrix; class CTriangle; // Used by the method toConvexPolygons class CBSPNode2v; // *************************************************************************** class CPolygon { public: std::vector<CVector> Vertices; public: CPolygon() {} CPolygon(const CVector &a, const CVector &b, const CVector &c); sint getNumVertices() const {return Vertices.size();} void clip(const CPlane *planes, uint nPlanes); void clip(const std::vector<CPlane> &planes); void serial(NLMISC::IStream &f) throw(NLMISC::EStream); bool toConvexPolygons (std::list<CPolygon>& outputPolygons, const CMatrix& basis) const; bool chain (const std::vector<CPolygon> &other, const CMatrix& basis); void getBestTriplet(uint &index0, uint &index1, uint &index2); void buildBasis(CMatrix &dest); // Used by the method toConvexPolygons and chain void toConvexPolygonsLocalAndBSP (std::vector<CVector> &localVertices, CBSPNode2v &root, const CMatrix &basis) const; static bool toConvexPolygonsEdgeIntersect (const CVector2f& a0, const CVector2f& a1, const CVector2f& b0, const CVector2f& b1); static bool toConvexPolygonsLeft (const std::vector<CVector> &vertex, uint a, uint b, uint c); static bool toConvexPolygonsLeftOn (const std::vector<CVector> &vertex, uint a, uint b, uint c); static bool toConvexPolygonsInCone (const std::vector<CVector> &vertex, uint a, uint b); static bool toConvexPolygonsDiagonal (const std::vector<CVector> &vertex, const CBSPNode2v &bsp, uint a, uint b); }; class CPolygon2D { public: typedef std::vector<CVector2f> TVec2fVect; TVec2fVect Vertices; public: CPolygon2D() {} CPolygon2D(const CPolygon &src, const CMatrix &projMat = CMatrix::Identity); CPolygon2D(const CTriangle &tri, const CMatrix &projMat = CMatrix::Identity); bool isConvex(); void buildConvexHull(CPolygon2D &dest) const; void getBestTriplet(uint &index0, uint &index1, uint &index2); void serial(NLMISC::IStream &f) throw(NLMISC::EStream); typedef std::pair<sint, sint> TRaster; typedef std::vector<TRaster> TRasterVect; void computeBorders(TRasterVect &borders, sint &minimumY); bool intersect(const CPolygon2D &other) const; bool contains(const CVector2f &p) const; bool getNonNullSeg(uint &seg) const; void getLineEquation(uint index, float &a, float &b, float &c) const; private: float sumDPAgainstLine(float a, float b, float c) const; const CVector2f &getSegRef0(uint index) const { nlassert(index < Vertices.size()); return Vertices[index]; } const CVector2f &getSegRef1(uint index) const { nlassert(index < Vertices.size()); return index == Vertices.size() - 1 ? Vertices[0] : Vertices[index + 1]; } }; } // NLMISC #endif // NL_POLYGON_H /* End of polygon.h */