measures3d.h File Reference
Include dependency graph for measures3d.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Data Structures | |
| struct | DISTPTS3D |
| Structure used in distance-calculations. More... | |
| struct | VECTOR3D |
| struct | PLANE3D |
Macros | |
| #define | DOT(u, v) ((u).x * (v).x + (u).y * (v).y + (u).z * (v).z) |
| #define | VECTORLENGTH(v) sqrt(((v).x * (v).x) + ((v).y * (v).y) + ((v).z * (v).z)) |
Functions | |
| LWGEOM * | lw_dist3d_distancepoint (const LWGEOM *lw1, const LWGEOM *lw2, int srid, int mode) |
| Function initializing 3dclosestpoint calculations. More... | |
| LWGEOM * | lw_dist3d_distanceline (const LWGEOM *lw1, const LWGEOM *lw2, int srid, int mode) |
| Function initializing 3dshortestline and 3dlongestline calculations. More... | |
| int | lw_dist3d_distribute_bruteforce (const LWGEOM *lwg1, const LWGEOM *lwg2, DISTPTS3D *dl) |
| This function distributes the brute-force for 3D so far the only type, tasks depending on type. More... | |
| int | lw_dist3d_recursive (const LWGEOM *lwg1, const LWGEOM *lwg2, DISTPTS3D *dl) |
| This is a recursive function delivering every possible combination of subgeometries. More... | |
| int | lw_dist3d_distribute_fast (const LWGEOM *lwg1, const LWGEOM *lwg2, DISTPTS3D *dl) |
| int | lw_dist3d_pt_ptarray (POINT3DZ *p, POINTARRAY *pa, DISTPTS3D *dl) |
| search all the segments of pointarray to see which one is closest to p Returns distance between point and pointarray More... | |
| int | lw_dist3d_point_point (LWPOINT *point1, LWPOINT *point2, DISTPTS3D *dl) |
| point to point calculation More... | |
| int | lw_dist3d_point_line (LWPOINT *point, LWLINE *line, DISTPTS3D *dl) |
| point to line calculation More... | |
| int | lw_dist3d_line_line (LWLINE *line1, LWLINE *line2, DISTPTS3D *dl) |
| line to line calculation More... | |
| int | lw_dist3d_point_poly (LWPOINT *point, LWPOLY *poly, DISTPTS3D *dl) |
| Computes point to polygon distance For mindistance that means: 1)find the plane of the polygon 2)projecting the point to the plane of the polygon 3)finding if that projected point is inside the polygon, if so the distance is measured to that projected point 4) if not in polygon above, check the distance against the boundary of the polygon for max distance it is always point against boundary. More... | |
| int | lw_dist3d_line_poly (LWLINE *line, LWPOLY *poly, DISTPTS3D *dl) |
| line to polygon calculation More... | |
| int | lw_dist3d_poly_poly (LWPOLY *poly1, LWPOLY *poly2, DISTPTS3D *dl) |
| polygon to polygon calculation More... | |
| int | lw_dist3d_ptarray_ptarray (POINTARRAY *l1, POINTARRAY *l2, DISTPTS3D *dl) |
| Finds all combinations of segments between two pointarrays. More... | |
| int | lw_dist3d_seg_seg (POINT3DZ *A, POINT3DZ *B, POINT3DZ *C, POINT3DZ *D, DISTPTS3D *dl) |
| Finds the two closest points on two linesegments. More... | |
| int | lw_dist3d_pt_pt (POINT3DZ *p1, POINT3DZ *p2, DISTPTS3D *dl) |
| Compares incoming points and stores the points closest to each other or most far away from each other depending on dl->mode (max or min) More... | |
| int | lw_dist3d_pt_seg (POINT3DZ *p, POINT3DZ *A, POINT3DZ *B, DISTPTS3D *dl) |
| If searching for min distance, this one finds the closest point on segment A-B from p. More... | |
| int | lw_dist3d_pt_poly (POINT3DZ *p, LWPOLY *poly, PLANE3D *plane, POINT3DZ *projp, DISTPTS3D *dl) |
| Checking if the point projected on the plane of the polygon actually is inside that polygon. More... | |
| int | lw_dist3d_ptarray_poly (POINTARRAY *pa, LWPOLY *poly, PLANE3D *plane, DISTPTS3D *dl) |
| Computes pointarray to polygon distance. More... | |
| double | project_point_on_plane (POINT3DZ *p, PLANE3D *pl, POINT3DZ *p0) |
| Finds a point on a plane from where the original point is perpendicular to the plane. More... | |
| int | define_plane (POINTARRAY *pa, PLANE3D *pl) |
| int | pt_in_ring_3d (const POINT3DZ *p, const POINTARRAY *ring, PLANE3D *plane) |
| pt_in_ring_3d(): crossing number test for a point in a polygon input: p = a point, pa = vertex points of a ring V[n+1] with V[n]=V[0] plane=the plane that the vertex points are lying on returns: 0 = outside, 1 = inside More... | |
