glc_geomtools.h

Go to the documentation of this file.
00001 /****************************************************************************
00002 
00003  This file is part of the GLC-lib library.
00004  Copyright (C) 2005-2008 Laurent Ribon (laumaya@users.sourceforge.net)
00005  Version 2.0.0 Beta 1, packaged on April 2010.
00006 
00007  http://glc-lib.sourceforge.net
00008 
00009  GLC-lib is free software; you can redistribute it and/or modify
00010  it under the terms of the GNU General Public License as published by
00011  the Free Software Foundation; either version 2 of the License, or
00012  (at your option) any later version.
00013 
00014  GLC-lib is distributed in the hope that it will be useful,
00015  but WITHOUT ANY WARRANTY; without even the implied warranty of
00016  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
00017  GNU General Public License for more details.
00018 
00019  You should have received a copy of the GNU General Public License
00020  along with GLC-lib; if not, write to the Free Software
00021  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
00022 
00023 *****************************************************************************/
00024 
00026 
00027 #ifndef GLC_GEOMTOOLS_H_
00028 #define GLC_GEOMTOOLS_H_
00029 
00030 #include <QVector>
00031 #include <QList>
00032 #include "glc_vector3d.h"
00033 #include "glc_line3d.h"
00034 #include "glc_plane.h"
00035 
00036 #include "../geometry/glc_mesh.h"
00037 
00038 #include "../glc_config.h"
00039 
00040 namespace glc
00041 {
00042 
00044 
00046 
00047 
00048         bool polygon2DIsConvex(const QList<GLC_Point2d>& vertices);
00049 
00051         bool polygonIsConvex(QList<GLuint>* pIndexList, const QList<float>& bulkList);
00052 
00054 
00058         GLC_LIB_EXPORT QVector<GLC_Point2d> findIntersection(const GLC_Point2d&, const GLC_Point2d&, const GLC_Point2d&, const GLC_Point2d&);
00059 
00061         GLC_LIB_EXPORT bool isIntersected(const GLC_Point2d&, const GLC_Point2d&, const GLC_Point2d&, const GLC_Point2d&);
00062 
00064         GLC_LIB_EXPORT bool isIntersectedRaySegment(const GLC_Point2d&, const GLC_Vector2d&, const GLC_Point2d&, const GLC_Point2d&);
00065 
00067 
00071         GLC_LIB_EXPORT QVector<double> findIntersection(const double&, const double&, const double&, const double&);
00072 
00074         GLC_LIB_EXPORT bool segmentInCone(const GLC_Point2d&, const GLC_Point2d&, const GLC_Point2d&, const GLC_Point2d&);
00075 
00077         GLC_LIB_EXPORT bool isDiagonal(const QList<GLC_Point2d>&, const int, const int);
00078 
00080         GLC_LIB_EXPORT void triangulate(QList<GLC_Point2d>&, QList<int>&, QList<int>&);
00081 
00083         GLC_LIB_EXPORT bool isCounterclockwiseOrdered(const QList<GLC_Point2d>&);
00084 
00086 
00087         GLC_LIB_EXPORT void triangulatePolygon(QList<GLuint>*, const QList<float>&);
00088 
00090 
00092         GLC_LIB_EXPORT bool lineIntersectPlane(const GLC_Line3d& line, const GLC_Plane& plane, GLC_Point3d* pPoint);
00093 
00095         GLC_LIB_EXPORT GLC_Point3d project(const GLC_Point3d& point, const GLC_Line3d& line);
00096 
00097 
00099 
00100 };
00101 
00102 #endif /*GLC_GEOMTOOLS_H_*/

SourceForge.net Logo

©2005 Laurent Ribon