You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
/** Returns a pointer to the point with number i*/
24
-
virtual Point3D *getPoint( unsigned int i ) const;
24
+
virtual QgsPoint *getPoint( unsigned int i ) const;
25
25
/** Returns the number of the point opposite to the triangle points p1, p2 (which have to be on a halfedge)*/
26
26
int getOppositePoint( int p1, int p2 );
27
27
/** 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'*/
28
-
bool getTriangle( double x, double y, Point3D *p1, int *n1 /Out/, Point3D *p2 /Out/, int *n2 /Out/, Point3D *p3 /Out/, int *n3 /Out/ );
28
+
bool getTriangle( double x, double y, QgsPoint *p1, int *n1 /Out/, QgsPoint *p2 /Out/, int *n2 /Out/, QgsPoint *p3 /Out/, int *n3 /Out/ );
29
29
/** 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*/
/** 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*/
32
32
QList<int> *getSurroundingTriangles( int pointno );
33
33
/** Returns the largest x-coordinate value of the bounding box*/
@@ -80,7 +80,7 @@ class DualEdgeTriangulation: Triangulation
80
80
/** Returns the number of an edge which points to the point with number 'point' or -1 if there is an error*/
81
81
int baseEdgeOfPoint( int point );
82
82
/** 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*/
83
-
int baseEdgeOfTriangle( Point3D *point );
83
+
int baseEdgeOfTriangle( QgsPoint *point );
84
84
/** Checks, if 'edge' has to be swapped because of the empty circle criterion. If so, doSwap(...) is called.*/
85
85
bool checkSwap( unsigned int edge, unsigned int recursiveDeep );
86
86
/** Swaps 'edge' and test recursively for other swaps (delaunay criterion)*/
@@ -100,5 +100,5 @@ class DualEdgeTriangulation: Triangulation
100
100
/** Returns true, if a half edge is on the convex hull and false otherwise*/
101
101
bool edgeOnConvexHull( int edge );
102
102
/** 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*/
103
-
void evaluateInfluenceRegion( Point3D *point, int edge, QSet<int> &set );
103
+
void evaluateInfluenceRegion( QgsPoint *point, int edge, QSet<int> &set );
Copy file name to clipboardExpand all lines: python/analysis/interpolation/NormVecDecorator.sip
+4-4Lines changed: 4 additions & 4 deletions
Original file line number
Diff line number
Diff line change
@@ -11,13 +11,13 @@ class NormVecDecorator : TriDecorator
11
11
NormVecDecorator( Triangulation *tin );
12
12
virtual ~NormVecDecorator();
13
13
/** Adds a point to the triangulation*/
14
-
int addPoint( Point3D *p );
14
+
int addPoint( QgsPoint *p );
15
15
/** Calculates the normal at a point on the surface and assigns it to 'result'. Returns true in case of success and false in case of failure*/
16
16
bool calcNormal( double x, double y, Vector3D *result );
17
17
/** Calculates the normal of a triangle-point for the point with coordinates x and y. This is needed, if a point is on a break line and there is no unique normal stored in 'mNormVec'. Returns false, it something went wrong and true otherwise*/
18
18
bool calcNormalForPoint( double x, double y, int point, Vector3D *result );
19
19
/** Calculates x-, y and z-value of the point on the surface and assigns it to 'result'. Returns true in case of success and flase in case of failure*/
20
-
bool calcPoint( double x, double y, Point3D *result );
20
+
bool calcPoint( double x, double y, QgsPoint *result );
21
21
/** Eliminates the horizontal triangles by swapping or by insertion of new points. If alreadyestimated is true, a re-estimation of the normals will be done*/
22
22
virtual void eliminateHorizontalTriangles();
23
23
/** Estimates the first derivative a point. Return true in case of succes and false otherwise*/
@@ -27,11 +27,11 @@ class NormVecDecorator : TriDecorator
27
27
/** Returns a pointer to the normal vector for the point with the number n*/
28
28
Vector3D *getNormal( int n ) const;
29
29
/** Finds out, in which triangle a point with coordinates x and y is and assigns the triangle points to p1, p2, p3 and the estimated normals to v1, v2, v3. The vectors are normally taken from 'mNormVec', except if p1, p2 or p3 is a point on a breakline. In this case, the normal is calculated on-the-fly. Returns false, if something went wrong and true otherwise*/
/** This function behaves similar to the one above. Additionally, the numbers of the points are returned (ptn1, ptn2, ptn3) as well as the PointStates of the triangle points (state1, state2, state3)
0 commit comments