QGIS API Documentation  2.6.0-Brighton
DualEdgeTriangulation.h
Go to the documentation of this file.
1 /***************************************************************************
2  DualEdgeTriangulation.h - description
3  -------------------
4  copyright : (C) 2004 by Marco Hugentobler
5  email : [email protected]
6  ***************************************************************************/
7
8 /***************************************************************************
9  * *
10  * This program is free software; you can redistribute it and/or modify *
12  * the Free Software Foundation; either version 2 of the License, or *
13  * (at your option) any later version. *
14  * *
15  ***************************************************************************/
16
17 #ifndef DUALEDGETRIANGULATION_H
18 #define DUALEDGETRIANGULATION_H
19
20 #include "Triangulation.h"
21 #include "HalfEdge.h"
22 #include <QVector>
23 #include <QList>
24 #include <QSet>
25 #include "MathUtils.h"
26 #include "TriangleInterpolator.h"
27 #include <QColor>
28 #include <QFile>
29 #include <QTextStream>
30 #include <QMessageBox>
31 #include <cfloat>
32 #include <QBuffer>
33 #include <QStringList>
34 #include <QProgressDialog>
35 #include <QCursor>
36
38 class ANALYSIS_EXPORT DualEdgeTriangulation: public Triangulation
39 {
40  public:
42  DualEdgeTriangulation( int nop, Triangulation* decorator );
43  virtual ~DualEdgeTriangulation();
44  void setDecorator( Triangulation* d ) {mDecorator = d;}
46  void addLine( Line3D* line, bool breakline );
48  int addPoint( Point3D* p );
50  virtual void performConsistencyTest();
52  virtual bool calcNormal( double x, double y, Vector3D* result );
54  virtual bool calcPoint( double x, double y, Point3D* result );
56  //virtual void draw(QPainter* p, double xlowleft, double ylowleft, double xupright, double yupright, double width, double height) const;
58  virtual Point3D* getPoint( unsigned int i ) const;
60  int getOppositePoint( int p1, int p2 );
62
63  virtual bool getTriangle( double x, double y, Point3D* p1, int* n1, Point3D* p2, int* n2, Point3D* p3, int* n3 );
65  virtual bool getTriangle( double x, double y, Point3D* p1, Point3D* p2, Point3D* p3 );
67  QList<int>* getSurroundingTriangles( int pointno );
69  virtual double getXMax() const;
71  virtual double getXMin() const;
73  virtual double getYMax() const;
75  virtual double getYMin() const;
77  virtual int getNumberOfPoints() const;
79  void removeLine( int i );
81  void removePoint( int i );
85  virtual void setEdgeColor( int r, int g, int b );
87  virtual void setForcedEdgeColor( int r, int g, int b );
89  virtual void setBreakEdgeColor( int r, int g, int b );
91  void setTriangleInterpolator( TriangleInterpolator* interpolator );
95  virtual void ruppertRefinement();
97  bool pointInside( double x, double y );
101  //bool saveToTAFF(QString fileName) const;
103  virtual bool swapEdge( double x, double y );
105  virtual QList<int>* getPointsAroundEdge( double x, double y );
108  virtual bool saveAsShapefile( const QString& fileName ) const;
109
110  protected:
112  double xMax;
114  double xMin;
116  double yMax;
118  double yMin;
120  const static unsigned int mDefaultStorageForPoints = 100000;
122  QVector<Point3D*> mPointVector;
124  const static unsigned int mDefaultStorageForHalfEdges = 300006;
126  QVector<HalfEdge*> mHalfEdge;
132  QColor mEdgeColor;
140  unsigned int insertEdge( int dual, int next, int point, bool mbreak, bool forced );
142  int insertForcedSegment( int p1, int p2, bool breakline );
144  //const static double leftOfTresh=0.00001;
146  const static int nBaseOfRuns = 300000;
148  int baseEdgeOfPoint( int point );
150  int baseEdgeOfTriangle( Point3D* point );
152  bool checkSwap( unsigned int edge, unsigned int recursiveDeep );
154  void doSwap( unsigned int edge, unsigned int recursiveDeep );
156  void doOnlySwap( unsigned int edge );
158  unsigned int mEdgeInside;
160  unsigned int mEdgeOutside;
162  unsigned int mEdgeWithPoint;
164  unsigned int mUnstableEdge;
168  bool swapPossible( unsigned int edge );
170  void triangulatePolygon( QList<int>* poly, QList<int>* free, int mainedge );
172  bool halfEdgeBBoxTest( int edge, double xlowleft, double ylowleft, double xupright, double yupright ) const;
174  double swapMinAngle( int edge ) const;
176  int splitHalfEdge( int edge, float position );
178  bool edgeOnConvexHull( int edge );
180  void evaluateInfluenceRegion( Point3D* point, int edge, QSet<int> &set );
181 };
182
183 inline DualEdgeTriangulation::DualEdgeTriangulation() : xMax( 0 ), xMin( 0 ), yMax( 0 ), yMin( 0 ), mTriangleInterpolator( 0 ), mForcedCrossBehaviour( Triangulation::DELETE_FIRST ), mEdgeColor( 0, 255, 0 ), mForcedEdgeColor( 0, 0, 255 ), mBreakEdgeColor( 100, 100, 0 ), mDecorator( this )
184 {
187 }
188
189 inline DualEdgeTriangulation::DualEdgeTriangulation( int nop, Triangulation* decorator ): xMax( 0 ), xMin( 0 ), yMax( 0 ), yMin( 0 ), mTriangleInterpolator( 0 ), mForcedCrossBehaviour( Triangulation::DELETE_FIRST ), mEdgeColor( 0, 255, 0 ), mForcedEdgeColor( 0, 0, 255 ), mBreakEdgeColor( 100, 100, 0 ), mDecorator( decorator )
190 {
191  mPointVector.reserve( nop );
192  mHalfEdge.reserve( nop );
193  if ( !mDecorator )
194  {
195  mDecorator = this;
196  }
197 }
198
199 inline double DualEdgeTriangulation::getXMax() const
200 {
201  return xMax;
202 }
203
204 inline double DualEdgeTriangulation::getXMin() const
205 {
206  return xMin;
207 }
208
209 inline double DualEdgeTriangulation::getYMax() const
210 {
211  return yMax;
212 }
213
214 inline double DualEdgeTriangulation::getYMin() const
215 {
216  return yMin;
217 }
218
220 {
221  return (( int )( mPointVector.count() ) );
222 }
223
224 inline Point3D* DualEdgeTriangulation::getPoint( unsigned int i ) const
225 {
226  return mPointVector.at( i );
227 }
228
229 inline bool DualEdgeTriangulation::halfEdgeBBoxTest( int edge, double xlowleft, double ylowleft, double xupright, double yupright ) const
230 {
231  return (( getPoint( mHalfEdge[edge]->getPoint() )->getX() >= xlowleft && getPoint( mHalfEdge[edge]->getPoint() )->getX() <= xupright && getPoint( mHalfEdge[edge]->getPoint() )->getY() >= ylowleft && getPoint( mHalfEdge[edge]->getPoint() )->getY() <= yupright ) || ( getPoint( mHalfEdge[mHalfEdge[edge]->getDual()]->getPoint() )->getX() >= xlowleft && getPoint( mHalfEdge[mHalfEdge[edge]->getDual()]->getPoint() )->getX() <= xupright && getPoint( mHalfEdge[mHalfEdge[edge]->getDual()]->getPoint() )->getY() >= ylowleft && getPoint( mHalfEdge[mHalfEdge[edge]->getDual()]->getPoint() )->getY() <= yupright ) );
232 }
233
234 #endif
235
236
237