## DualEdgeTriangulation.h.diff

View differences:

141 141
```    unsigned int insertEdge( int dual, int next, int point, bool mbreak, bool forced );
```
142 142
```    /**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*/
```
143 143
```    int insertForcedSegment( int p1, int p2, bool breakline );
```
144 144
```    /**Threshold for the leftOfTest to handle numerical instabilities*/
```
145 145
```    //const static double leftOfTresh=0.00001;
```
146
```    const static double leftOfTresh;
```
146 147
```    /**Security to prevent endless loops in 'baseEdgeOfTriangle'. It there are more iteration then this number, the point will not be inserted*/
```
147 148
```    const static int nBaseOfRuns = 300000;
```
148 149
```    /**Returns the number of an edge which points to the point with number 'point' or -1 if there is an error*/
```
149 150
```    int baseEdgeOfPoint( int point );
```
150 151
```    /**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 occured (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*/
```
151 152