Files
create/src/Mod/Part/App/edgecluster.h
2011-10-10 13:44:52 +00:00

88 lines
3.1 KiB
C++

/***************************************************************************
* Copyright (c) 2007 *
* Joachim Zettler <Joachim.Zettler@gmx.de> *
* *
* This file is part of the FreeCAD CAx development system. *
* *
* 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; see the file COPYING.LIB. If not, *
* write to the Free Software Foundation, Inc., 59 Temple Place, *
* Suite 330, Boston, MA 02111-1307, USA *
* *
***************************************************************************/
#ifndef PART_EDGECLUSTER_H
#define PART_EDGECLUSTER_H
#include <gp_Pnt.hxx>
#include <TopoDS_Edge.hxx>
#include <vector>
#include <map>
namespace Part {
struct Edgesort_gp_Pnt_Less
{
bool operator()(const gp_Pnt & _Left, const gp_Pnt & _Right) const
{
Standard_Real x1,y1,z1,x2,y2,z2;
_Left.Coord(x1,y1,z1);
_Right.Coord(x2,y2,z2);
if ( fabs(x1- x2) > 0.2 )
return x1 < x2;
else if ( fabs(y1 -y2) > 0.2 )
return y1 < y2;
else if ( fabs(z1 -z2) > 0.2 )
return z1 < z2;
return false;
}
};
typedef std::vector<TopoDS_Edge> tEdgeVector;
typedef std::map<gp_Pnt,tEdgeVector,Edgesort_gp_Pnt_Less> tMapPntEdge;
typedef std::pair<gp_Pnt,tEdgeVector> tMapPntEdgePair;
typedef std::vector<std::vector<TopoDS_Edge> > tEdgeClusterVector;
class PartExport Edgecluster
{
public:
Edgecluster(const std::vector<TopoDS_Edge>& usorted_edges);
virtual ~Edgecluster(void);
tEdgeClusterVector GetClusters(void);
private:
void Perform();
void Perform(const TopoDS_Edge& edge);
bool PerformEdges(gp_Pnt& point);
bool IsValidEdge(const TopoDS_Edge& edge);
tEdgeClusterVector m_final_cluster;
tEdgeVector m_unsortededges;
tEdgeVector m_edges;
tMapPntEdge m_vertices;
bool m_done;
tEdgeVector::const_iterator m_edgeIter;
};
}
#endif // PART_EDGECLUSTER_H