QGIS API Documentation  2.99.0-Master (6a61179)
Public Member Functions | Protected Member Functions | Protected Attributes | Static Protected Attributes | List of all members
DualEdgeTriangulation Class Reference

DualEdgeTriangulation is an implementation of a triangulation class based on the dual edge data structure. More...

#include <DualEdgeTriangulation.h>

Inheritance diagram for DualEdgeTriangulation:
Inheritance graph
[legend]

Public Member Functions

 DualEdgeTriangulation ()
 
 DualEdgeTriangulation (int nop, Triangulation *decorator)
 
virtual ~DualEdgeTriangulation ()
 
void addLine (Line3D *line, bool breakline) override
 Adds a line (e.g. a break-, structure- or an isoline) to the triangulation. The class takes ownership of the line object and its points. More...
 
int addPoint (Point3D *p) override
 Adds a point to the triangulation and returns the number of this point in case of success or -100 in case of failure. More...
 
virtual bool calcNormal (double x, double y, Vector3D *result) override
 Calculates the normal at a point on the surface. More...
 
virtual bool calcPoint (double x, double y, Point3D *result) override
 Calculates x-, y and z-value of the point on the surface. More...
 
void eliminateHorizontalTriangles () override
 Eliminates the horizontal triangles by swapping or by insertion of new points. More...
 
virtual int getNumberOfPoints () const override
 Returns the number of points. More...
 
int getOppositePoint (int p1, int p2) override
 Returns the number of the point opposite to the triangle points p1, p2 (which have to be on a halfedge) More...
 
virtual Point3DgetPoint (unsigned int i) const override
 Draws the points, edges and the forced lines. More...
 
virtual QList< int > * getPointsAroundEdge (double x, double y) override
 Returns a value list with the numbers of the four points, which would be affected by an edge swap. This function is e.g. needed by NormVecDecorator to know the points, for which the normals have to be recalculated. The returned ValueList has to be deleted by the code which calls the method. More...
 
QList< int > * getSurroundingTriangles (int pointno) override
 Returns a pointer to a value list with the information of the triangles surrounding (counterclockwise) a point. Four integer values describe a triangle, the first three are the number of the half edges of the triangle and the fourth is -10, if the third (and most counterclockwise) edge is a breakline, and -20 otherwise. The value list has to be deleted by the code which called the method. More...
 
virtual bool getTriangle (double x, double y, Point3D *p1, int *n1, Point3D *p2, int *n2, Point3D *p3, int *n3) override
 Finds out, in which triangle the point with coordinates x and y is and assigns the numbers of the vertices to 'n1', 'n2' and 'n3' and the vertices to 'p1', 'p2' and 'p3'. More...
 
virtual bool getTriangle (double x, double y, Point3D *p1, Point3D *p2, Point3D *p3) override
 Finds out, in which triangle the point with coordinates x and y is and assigns addresses to the points at the vertices to 'p1', 'p2' and 'p3. More...
 
virtual double getXMax () const override
 Returns the largest x-coordinate value of the bounding box. More...
 
virtual double getXMin () const override
 Returns the smallest x-coordinate value of the bounding box. More...
 
virtual double getYMax () const override
 Returns the largest y-coordinate value of the bounding box. More...
 
virtual double getYMin () const override
 Returns the smallest x-coordinate value of the bounding box. More...
 
virtual void performConsistencyTest () override
 Performs a consistency check, remove this later. More...
 
bool pointInside (double x, double y) override
 Returns true, if the point with coordinates x and y is inside the convex hull and false otherwise. More...
 
virtual void ruppertRefinement () override
 Adds points to make the triangles better shaped (algorithm of ruppert) More...
 
virtual bool saveAsShapefile (const QString &fileName) const override
 Saves the triangulation as a (line) shapefile. More...
 
virtual void setBreakEdgeColor (int r, int g, int b) override
 Sets the color of the breaklines. More...
 
void setDecorator (Triangulation *d)
 
virtual void setEdgeColor (int r, int g, int b) override
 Sets the color of the normal edges. More...
 
virtual void setForcedCrossBehaviour (Triangulation::forcedCrossBehaviour b) override
 Sets the behaviour of the triangulation in case of crossing forced lines. More...
 
virtual void setForcedEdgeColor (int r, int g, int b) override
 Sets the color of the forced edges. More...
 
void setTriangleInterpolator (TriangleInterpolator *interpolator) override
 Sets an interpolator object. More...
 
virtual bool swapEdge (double x, double y) override
 Reads the dual edge structure of a taff file. More...
 
- Public Member Functions inherited from Triangulation
virtual ~Triangulation ()
 

Protected Member Functions

int baseEdgeOfPoint (int point)
 Returns the number of an edge which points to the point with number 'point' or -1 if there is an error. More...
 
int baseEdgeOfTriangle (Point3D *point)
 Returns the number of a HalfEdge from a triangle in which 'point' is in. If the number -10 is returned, this means, that 'point' is outside the convex hull. If -5 is returned, then numerical problems with the leftOfTest occurred (and the value of the possible edge is stored in the variable 'mUnstableEdge'. -20 means, that the inserted point is exactly on an edge (the number is stored in the variable 'mEdgeWithPoint'). -25 means, that the point is already in the triangulation (the number of the point is stored in the member 'mTwiceInsPoint'. If -100 is returned, this means that something else went wrong. More...
 
bool checkSwap (unsigned int edge, unsigned int recursiveDeep)
 Checks, if 'edge' has to be swapped because of the empty circle criterion. If so, doSwap(...) is called. More...
 
void doOnlySwap (unsigned int edge)
 Swaps 'edge' and does no recursiv testing. More...
 
void doSwap (unsigned int edge, unsigned int recursiveDeep)
 Swaps 'edge' and test recursively for other swaps (delaunay criterion) More...
 
bool edgeOnConvexHull (int edge)
 Returns true, if a half edge is on the convex hull and false otherwise. More...
 
void evaluateInfluenceRegion (Point3D *point, int edge, QSet< int > &set)
 Function needed for the ruppert algorithm. Tests, if point is in the circle through both endpoints of edge and the endpoint of edge->dual->next->point. If so, the function calls itself recursively for edge->next and edge->next->next. Stops, if it finds a forced edge or a convex hull edge. More...
 
bool halfEdgeBBoxTest (int edge, double xlowleft, double ylowleft, double xupright, double yupright) const
 Tests, if the bounding box of the halfedge with index i intersects the specified bounding box. The main purpose for this method is the drawing of the triangulation. More...
 
unsigned int insertEdge (int dual, int next, int point, bool mbreak, bool forced)
 Inserts an edge and makes sure, everything is ok with the storage of the edge. The number of the HalfEdge is returned. More...
 
int insertForcedSegment (int p1, int p2, bool breakline)
 Inserts a forced segment between the points with the numbers p1 and p2 into the triangulation and returns the number of a HalfEdge belonging to this forced edge or -100 in case of failure. More...
 
int splitHalfEdge (int edge, float position)
 Inserts a new point on the halfedge with number 'edge'. The position can have a value from 0 to 1 (e.g. 0.5 would be in the middle). The return value is the number of the new inserted point. tin is the triangulation, which should be used to calculate the elevation of the inserted point. More...
 
double swapMinAngle (int edge) const
 Calculates the minimum angle, which would be present, if the specified halfedge would be swapped. More...
 
bool swapPossible (unsigned int edge)
 Returns true, if it is possible to swap an edge, otherwise false(concave quad or edge on (or outside) the convex hull) More...
 
void triangulatePolygon (QList< int > *poly, QList< int > *free, int mainedge)
 Divides a polygon in a triangle and two polygons and calls itself recursively for these two polygons. 'poly' is a pointer to a list with the numbers of the edges of the polygon, 'free' is a pointer to a list of free halfedges, and 'mainedge' is the number of the edge, towards which the new triangle is inserted. Mainedge has to be the same as poly->begin(), otherwise the recursion does not work. More...
 

Protected Attributes

QColor mBreakEdgeColor
 Color to paint the breaklines. More...
 
TriangulationmDecorator
 Pointer to the decorator using this triangulation. It it is used directly, mDecorator equals this. More...
 
QColor mEdgeColor
 Color to paint the normal edges. More...
 
unsigned int mEdgeInside
 Number of an edge which does not point to the virtual point. It continuously updated for a fast search. More...
 
unsigned int mEdgeOutside
 Number of an edge on the outside of the convex hull. It is updated in method 'baseEdgeOfTriangle' to enable insertion of points outside the convex hull. More...
 
unsigned int mEdgeWithPoint
 If an inserted point is exactly on an existing edge, 'baseEdgeOfTriangle' returns -20 and sets the variable 'mEdgeWithPoint'. More...
 
Triangulation::forcedCrossBehaviour mForcedCrossBehaviour
 Member to store the behaviour in case of crossing forced segments. More...
 
QColor mForcedEdgeColor
 Color to paint the forced edges. More...
 
QVector< HalfEdge * > mHalfEdge
 Stores pointers to the HalfEdges. More...
 
QVector< Point3D * > mPointVector
 Stores pointers to all points in the triangulations (including the points contained in the lines) More...
 
TriangleInterpolatormTriangleInterpolator
 Association to an interpolator object. More...
 
int mTwiceInsPoint
 If a point has been inserted twice, its number is stored in this member. More...
 
unsigned int mUnstableEdge
 If an instability occurs in 'baseEdgeOfTriangle', mUnstableEdge is set to the value of the current edge. More...
 
double xMax
 X-coordinate of the upper right corner of the bounding box. More...
 
double xMin
 X-coordinate of the lower left corner of the bounding box. More...
 
double yMax
 Y-coordinate of the upper right corner of the bounding box. More...
 
double yMin
 Y-coordinate of the lower left corner of the bounding box. More...
 

Static Protected Attributes

static const unsigned int mDefaultStorageForHalfEdges = 300006
 Default value for the number of storable HalfEdges at the beginning. More...
 
static const unsigned int mDefaultStorageForPoints = 100000
 Default value for the number of storable points at the beginning. More...
 
static const int nBaseOfRuns = 300000
 Threshold for the leftOfTest to handle numerical instabilities. More...
 

Additional Inherited Members

- Public Types inherited from Triangulation
enum  forcedCrossBehaviour { SnappingType_VERTICE, DELETE_FIRST, INSERT_VERTICE }
 Enumeration describing the behaviour, if two forced lines cross. More...
 

Detailed Description

DualEdgeTriangulation is an implementation of a triangulation class based on the dual edge data structure.

Definition at line 37 of file DualEdgeTriangulation.h.

Constructor & Destructor Documentation

§ DualEdgeTriangulation() [1/2]

DualEdgeTriangulation::DualEdgeTriangulation ( )
inline

Definition at line 179 of file DualEdgeTriangulation.h.

§ DualEdgeTriangulation() [2/2]

DualEdgeTriangulation::DualEdgeTriangulation ( int  nop,
Triangulation decorator 
)
inline

Definition at line 200 of file DualEdgeTriangulation.h.

§ ~DualEdgeTriangulation()

DualEdgeTriangulation::~DualEdgeTriangulation ( )
virtual

Definition at line 28 of file DualEdgeTriangulation.cc.

Member Function Documentation

§ addLine()

void DualEdgeTriangulation::addLine ( Line3D line,
bool  breakline 
)
overridevirtual

Adds a line (e.g. a break-, structure- or an isoline) to the triangulation. The class takes ownership of the line object and its points.

Implements Triangulation.

Definition at line 69 of file DualEdgeTriangulation.cc.

§ addPoint()

int DualEdgeTriangulation::addPoint ( Point3D p)
overridevirtual

Adds a point to the triangulation and returns the number of this point in case of success or -100 in case of failure.

Implements Triangulation.

Definition at line 112 of file DualEdgeTriangulation.cc.

§ baseEdgeOfPoint()

int DualEdgeTriangulation::baseEdgeOfPoint ( int  point)
protected

Returns the number of an edge which points to the point with number 'point' or -1 if there is an error.

Definition at line 407 of file DualEdgeTriangulation.cc.

§ baseEdgeOfTriangle()

int DualEdgeTriangulation::baseEdgeOfTriangle ( Point3D point)
protected

Returns the number of a HalfEdge from a triangle in which 'point' is in. If the number -10 is returned, this means, that 'point' is outside the convex hull. If -5 is returned, then numerical problems with the leftOfTest occurred (and the value of the possible edge is stored in the variable 'mUnstableEdge'. -20 means, that the inserted point is exactly on an edge (the number is stored in the variable 'mEdgeWithPoint'). -25 means, that the point is already in the triangulation (the number of the point is stored in the member 'mTwiceInsPoint'. If -100 is returned, this means that something else went wrong.

Definition at line 479 of file DualEdgeTriangulation.cc.

§ calcNormal()

bool DualEdgeTriangulation::calcNormal ( double  x,
double  y,
Vector3D result 
)
overridevirtual

Calculates the normal at a point on the surface.

Implements Triangulation.

Definition at line 656 of file DualEdgeTriangulation.cc.

§ calcPoint()

bool DualEdgeTriangulation::calcPoint ( double  x,
double  y,
Point3D result 
)
overridevirtual

Calculates x-, y and z-value of the point on the surface.

Implements Triangulation.

Definition at line 671 of file DualEdgeTriangulation.cc.

§ checkSwap()

bool DualEdgeTriangulation::checkSwap ( unsigned int  edge,
unsigned int  recursiveDeep 
)
protected

Checks, if 'edge' has to be swapped because of the empty circle criterion. If so, doSwap(...) is called.

Definition at line 686 of file DualEdgeTriangulation.cc.

§ doOnlySwap()

void DualEdgeTriangulation::doOnlySwap ( unsigned int  edge)
protected

Swaps 'edge' and does no recursiv testing.

Definition at line 703 of file DualEdgeTriangulation.cc.

§ doSwap()

void DualEdgeTriangulation::doSwap ( unsigned int  edge,
unsigned int  recursiveDeep 
)
protected

Swaps 'edge' and test recursively for other swaps (delaunay criterion)

Definition at line 721 of file DualEdgeTriangulation.cc.

§ edgeOnConvexHull()

bool DualEdgeTriangulation::edgeOnConvexHull ( int  edge)
protected

Returns true, if a half edge is on the convex hull and false otherwise.

Definition at line 3264 of file DualEdgeTriangulation.cc.

§ eliminateHorizontalTriangles()

void DualEdgeTriangulation::eliminateHorizontalTriangles ( )
overridevirtual

Eliminates the horizontal triangles by swapping or by insertion of new points.

Implements Triangulation.

Definition at line 1596 of file DualEdgeTriangulation.cc.

§ evaluateInfluenceRegion()

void DualEdgeTriangulation::evaluateInfluenceRegion ( Point3D point,
int  edge,
QSet< int > &  set 
)
protected

Function needed for the ruppert algorithm. Tests, if point is in the circle through both endpoints of edge and the endpoint of edge->dual->next->point. If so, the function calls itself recursively for edge->next and edge->next->next. Stops, if it finds a forced edge or a convex hull edge.

Definition at line 3269 of file DualEdgeTriangulation.cc.

§ getNumberOfPoints()

int DualEdgeTriangulation::getNumberOfPoints ( ) const
inlineoverridevirtual

Returns the number of points.

Implements Triangulation.

Definition at line 221 of file DualEdgeTriangulation.h.

§ getOppositePoint()

int DualEdgeTriangulation::getOppositePoint ( int  p1,
int  p2 
)
overridevirtual

Returns the number of the point opposite to the triangle points p1, p2 (which have to be on a halfedge)

Implements Triangulation.

Definition at line 895 of file DualEdgeTriangulation.cc.

§ getPoint()

Point3D * DualEdgeTriangulation::getPoint ( unsigned int  i) const
inlineoverridevirtual

Draws the points, edges and the forced lines.

Returns a pointer to the point with number i

Implements Triangulation.

Definition at line 226 of file DualEdgeTriangulation.h.

§ getPointsAroundEdge()

QList< int > * DualEdgeTriangulation::getPointsAroundEdge ( double  x,
double  y 
)
overridevirtual

Returns a value list with the numbers of the four points, which would be affected by an edge swap. This function is e.g. needed by NormVecDecorator to know the points, for which the normals have to be recalculated. The returned ValueList has to be deleted by the code which calls the method.

Implements Triangulation.

Definition at line 3025 of file DualEdgeTriangulation.cc.

§ getSurroundingTriangles()

QList< int > * DualEdgeTriangulation::getSurroundingTriangles ( int  pointno)
overridevirtual

Returns a pointer to a value list with the information of the triangles surrounding (counterclockwise) a point. Four integer values describe a triangle, the first three are the number of the half edges of the triangle and the fourth is -10, if the third (and most counterclockwise) edge is a breakline, and -20 otherwise. The value list has to be deleted by the code which called the method.

Implements Triangulation.

Definition at line 929 of file DualEdgeTriangulation.cc.

§ getTriangle() [1/2]

bool DualEdgeTriangulation::getTriangle ( double  x,
double  y,
Point3D p1,
int *  n1,
Point3D p2,
int *  n2,
Point3D p3,
int *  n3 
)
overridevirtual

Finds out, in which triangle the point with coordinates x and y is and assigns the numbers of the vertices to 'n1', 'n2' and 'n3' and the vertices to 'p1', 'p2' and 'p3'.

Note
not available in python bindings

Implements Triangulation.

Definition at line 966 of file DualEdgeTriangulation.cc.

§ getTriangle() [2/2]

bool DualEdgeTriangulation::getTriangle ( double  x,
double  y,
Point3D p1,
Point3D p2,
Point3D p3 
)
overridevirtual

Finds out, in which triangle the point with coordinates x and y is and assigns addresses to the points at the vertices to 'p1', 'p2' and 'p3.

Implements Triangulation.

Definition at line 1084 of file DualEdgeTriangulation.cc.

§ getXMax()

virtual double DualEdgeTriangulation::getXMax ( ) const
inlineoverridevirtual

Returns the largest x-coordinate value of the bounding box.

Implements Triangulation.

Definition at line 68 of file DualEdgeTriangulation.h.

§ getXMin()

virtual double DualEdgeTriangulation::getXMin ( ) const
inlineoverridevirtual

Returns the smallest x-coordinate value of the bounding box.

Implements Triangulation.

Definition at line 70 of file DualEdgeTriangulation.h.

§ getYMax()

virtual double DualEdgeTriangulation::getYMax ( ) const
inlineoverridevirtual

Returns the largest y-coordinate value of the bounding box.

Implements Triangulation.

Definition at line 72 of file DualEdgeTriangulation.h.

§ getYMin()

virtual double DualEdgeTriangulation::getYMin ( ) const
inlineoverridevirtual

Returns the smallest x-coordinate value of the bounding box.

Implements Triangulation.

Definition at line 74 of file DualEdgeTriangulation.h.

§ halfEdgeBBoxTest()

bool DualEdgeTriangulation::halfEdgeBBoxTest ( int  edge,
double  xlowleft,
double  ylowleft,
double  xupright,
double  yupright 
) const
inlineprotected

Tests, if the bounding box of the halfedge with index i intersects the specified bounding box. The main purpose for this method is the drawing of the triangulation.

Definition at line 231 of file DualEdgeTriangulation.h.

§ insertEdge()

unsigned int DualEdgeTriangulation::insertEdge ( int  dual,
int  next,
int  point,
bool  mbreak,
bool  forced 
)
protected

Inserts an edge and makes sure, everything is ok with the storage of the edge. The number of the HalfEdge is returned.

Definition at line 1193 of file DualEdgeTriangulation.cc.

§ insertForcedSegment()

int DualEdgeTriangulation::insertForcedSegment ( int  p1,
int  p2,
bool  breakline 
)
protected

Inserts a forced segment between the points with the numbers p1 and p2 into the triangulation and returns the number of a HalfEdge belonging to this forced edge or -100 in case of failure.

Definition at line 1201 of file DualEdgeTriangulation.cc.

§ performConsistencyTest()

void DualEdgeTriangulation::performConsistencyTest ( )
overridevirtual

Performs a consistency check, remove this later.

Implements Triangulation.

Definition at line 49 of file DualEdgeTriangulation.cc.

§ pointInside()

bool DualEdgeTriangulation::pointInside ( double  x,
double  y 
)
overridevirtual

Returns true, if the point with coordinates x and y is inside the convex hull and false otherwise.

Implements Triangulation.

Definition at line 2598 of file DualEdgeTriangulation.cc.

§ ruppertRefinement()

void DualEdgeTriangulation::ruppertRefinement ( )
overridevirtual

Adds points to make the triangles better shaped (algorithm of ruppert)

Implements Triangulation.

Definition at line 1685 of file DualEdgeTriangulation.cc.

§ saveAsShapefile()

bool DualEdgeTriangulation::saveAsShapefile ( const QString &  fileName) const
overridevirtual

Saves the triangulation as a (line) shapefile.

Returns
true in case of success

Implements Triangulation.

Definition at line 3088 of file DualEdgeTriangulation.cc.

§ setBreakEdgeColor()

void DualEdgeTriangulation::setBreakEdgeColor ( int  r,
int  g,
int  b 
)
overridevirtual

Sets the color of the breaklines.

Implements Triangulation.

Definition at line 1586 of file DualEdgeTriangulation.cc.

§ setDecorator()

void DualEdgeTriangulation::setDecorator ( Triangulation d)
inline

Definition at line 43 of file DualEdgeTriangulation.h.

§ setEdgeColor()

void DualEdgeTriangulation::setEdgeColor ( int  r,
int  g,
int  b 
)
overridevirtual

Sets the color of the normal edges.

Implements Triangulation.

Definition at line 1576 of file DualEdgeTriangulation.cc.

§ setForcedCrossBehaviour()

void DualEdgeTriangulation::setForcedCrossBehaviour ( Triangulation::forcedCrossBehaviour  b)
overridevirtual

Sets the behaviour of the triangulation in case of crossing forced lines.

Implements Triangulation.

Definition at line 1571 of file DualEdgeTriangulation.cc.

§ setForcedEdgeColor()

void DualEdgeTriangulation::setForcedEdgeColor ( int  r,
int  g,
int  b 
)
overridevirtual

Sets the color of the forced edges.

Implements Triangulation.

Definition at line 1581 of file DualEdgeTriangulation.cc.

§ setTriangleInterpolator()

void DualEdgeTriangulation::setTriangleInterpolator ( TriangleInterpolator interpolator)
overridevirtual

Sets an interpolator object.

Implements Triangulation.

Definition at line 1591 of file DualEdgeTriangulation.cc.

§ splitHalfEdge()

int DualEdgeTriangulation::splitHalfEdge ( int  edge,
float  position 
)
protected

Inserts a new point on the halfedge with number 'edge'. The position can have a value from 0 to 1 (e.g. 0.5 would be in the middle). The return value is the number of the new inserted point. tin is the triangulation, which should be used to calculate the elevation of the inserted point.

Definition at line 3209 of file DualEdgeTriangulation.cc.

§ swapEdge()

bool DualEdgeTriangulation::swapEdge ( double  x,
double  y 
)
overridevirtual

Reads the dual edge structure of a taff file.

Saves the dual edge structure to a taff file Swaps the edge which is closest to the point with x and y coordinates (if this is possible)

Implements Triangulation.

Definition at line 2964 of file DualEdgeTriangulation.cc.

§ swapMinAngle()

double DualEdgeTriangulation::swapMinAngle ( int  edge) const
protected

Calculates the minimum angle, which would be present, if the specified halfedge would be swapped.

Definition at line 3169 of file DualEdgeTriangulation.cc.

§ swapPossible()

bool DualEdgeTriangulation::swapPossible ( unsigned int  edge)
protected

Returns true, if it is possible to swap an edge, otherwise false(concave quad or edge on (or outside) the convex hull)

Definition at line 2424 of file DualEdgeTriangulation.cc.

§ triangulatePolygon()

void DualEdgeTriangulation::triangulatePolygon ( QList< int > *  poly,
QList< int > *  free,
int  mainedge 
)
protected

Divides a polygon in a triangle and two polygons and calls itself recursively for these two polygons. 'poly' is a pointer to a list with the numbers of the edges of the polygon, 'free' is a pointer to a list of free halfedges, and 'mainedge' is the number of the edge, towards which the new triangle is inserted. Mainedge has to be the same as poly->begin(), otherwise the recursion does not work.

Definition at line 2461 of file DualEdgeTriangulation.cc.

Member Data Documentation

§ mBreakEdgeColor

QColor DualEdgeTriangulation::mBreakEdgeColor
protected

Color to paint the breaklines.

Definition at line 132 of file DualEdgeTriangulation.h.

§ mDecorator

Triangulation* DualEdgeTriangulation::mDecorator
protected

Pointer to the decorator using this triangulation. It it is used directly, mDecorator equals this.

Definition at line 134 of file DualEdgeTriangulation.h.

§ mDefaultStorageForHalfEdges

const unsigned int DualEdgeTriangulation::mDefaultStorageForHalfEdges = 300006
staticprotected

Default value for the number of storable HalfEdges at the beginning.

Definition at line 120 of file DualEdgeTriangulation.h.

§ mDefaultStorageForPoints

const unsigned int DualEdgeTriangulation::mDefaultStorageForPoints = 100000
staticprotected

Default value for the number of storable points at the beginning.

Definition at line 116 of file DualEdgeTriangulation.h.

§ mEdgeColor

QColor DualEdgeTriangulation::mEdgeColor
protected

Color to paint the normal edges.

Definition at line 128 of file DualEdgeTriangulation.h.

§ mEdgeInside

unsigned int DualEdgeTriangulation::mEdgeInside
protected

Number of an edge which does not point to the virtual point. It continuously updated for a fast search.

Definition at line 154 of file DualEdgeTriangulation.h.

§ mEdgeOutside

unsigned int DualEdgeTriangulation::mEdgeOutside
protected

Number of an edge on the outside of the convex hull. It is updated in method 'baseEdgeOfTriangle' to enable insertion of points outside the convex hull.

Definition at line 156 of file DualEdgeTriangulation.h.

§ mEdgeWithPoint

unsigned int DualEdgeTriangulation::mEdgeWithPoint
protected

If an inserted point is exactly on an existing edge, 'baseEdgeOfTriangle' returns -20 and sets the variable 'mEdgeWithPoint'.

Definition at line 158 of file DualEdgeTriangulation.h.

§ mForcedCrossBehaviour

Triangulation::forcedCrossBehaviour DualEdgeTriangulation::mForcedCrossBehaviour
protected

Member to store the behaviour in case of crossing forced segments.

Definition at line 126 of file DualEdgeTriangulation.h.

§ mForcedEdgeColor

QColor DualEdgeTriangulation::mForcedEdgeColor
protected

Color to paint the forced edges.

Definition at line 130 of file DualEdgeTriangulation.h.

§ mHalfEdge

QVector<HalfEdge*> DualEdgeTriangulation::mHalfEdge
protected

Stores pointers to the HalfEdges.

Definition at line 122 of file DualEdgeTriangulation.h.

§ mPointVector

QVector<Point3D*> DualEdgeTriangulation::mPointVector
protected

Stores pointers to all points in the triangulations (including the points contained in the lines)

Definition at line 118 of file DualEdgeTriangulation.h.

§ mTriangleInterpolator

TriangleInterpolator* DualEdgeTriangulation::mTriangleInterpolator
protected

Association to an interpolator object.

Definition at line 124 of file DualEdgeTriangulation.h.

§ mTwiceInsPoint

int DualEdgeTriangulation::mTwiceInsPoint
protected

If a point has been inserted twice, its number is stored in this member.

Definition at line 162 of file DualEdgeTriangulation.h.

§ mUnstableEdge

unsigned int DualEdgeTriangulation::mUnstableEdge
protected

If an instability occurs in 'baseEdgeOfTriangle', mUnstableEdge is set to the value of the current edge.

Definition at line 160 of file DualEdgeTriangulation.h.

§ nBaseOfRuns

const int DualEdgeTriangulation::nBaseOfRuns = 300000
staticprotected

Threshold for the leftOfTest to handle numerical instabilities.

Security to prevent endless loops in 'baseEdgeOfTriangle'. It there are more iteration then this number, the point will not be inserted

Definition at line 142 of file DualEdgeTriangulation.h.

§ xMax

double DualEdgeTriangulation::xMax
protected

X-coordinate of the upper right corner of the bounding box.

Definition at line 108 of file DualEdgeTriangulation.h.

§ xMin

double DualEdgeTriangulation::xMin
protected

X-coordinate of the lower left corner of the bounding box.

Definition at line 110 of file DualEdgeTriangulation.h.

§ yMax

double DualEdgeTriangulation::yMax
protected

Y-coordinate of the upper right corner of the bounding box.

Definition at line 112 of file DualEdgeTriangulation.h.

§ yMin

double DualEdgeTriangulation::yMin
protected

Y-coordinate of the lower left corner of the bounding box.

Definition at line 114 of file DualEdgeTriangulation.h.


The documentation for this class was generated from the following files: