mirror of
https://git.osgeo.org/gitea/postgis/postgis
synced 2024-10-25 01:22:47 +00:00
75 lines
2.9 KiB
C
75 lines
2.9 KiB
C
|
|
/**********************************************************************
|
|
* $Id: measures.h 4715 2009-11-01 17:58:42Z nicklas $
|
|
*
|
|
* PostGIS - Spatial Types for PostgreSQL
|
|
* http://postgis.refractions.net
|
|
* Copyright 2001-2006 Refractions Research Inc.
|
|
* Copyright 2007-2008 Mark Cave-Ayland
|
|
* Copyright 2008 Paul Ramsey <pramsey@cleverelephant.ca>
|
|
*
|
|
* This is free software; you can redistribute and/or modify it under
|
|
* the terms of the GNU General Public Licence. See the COPYING file.
|
|
*
|
|
**********************************************************************/
|
|
|
|
#include "liblwgeom.h"
|
|
|
|
|
|
/**
|
|
|
|
Structure used in distance-calculations
|
|
*/
|
|
typedef struct
|
|
{
|
|
double distance; /*the distance between p1 and p2*/
|
|
POINT2D p1;
|
|
POINT2D p2;
|
|
int mode; /*the direction of looking, if thedir = -1 then we look for maxdistance and if it is 1 then we look for mindistance*/
|
|
int twisted; /*To preserve the order of incoming points to match the first and secon point in shortest and longest line*/
|
|
double tolerance; /*the tolerance for dwithin and dfullywithin*/
|
|
} DISTPTS;
|
|
|
|
typedef struct
|
|
{
|
|
double themeasure; /*a value calculated to compare distances*/
|
|
int pnr; /*pointnumber. the ordernumber of the point*/
|
|
} LISTSTRUCT;
|
|
|
|
|
|
/*
|
|
Preprocessing functions
|
|
*/
|
|
int lw_dist2d_comp(uchar *lw1, uchar *lw2, DISTPTS *dl);
|
|
int lw_dist2d_distribute_bruteforce(LWGEOM *lwg1, LWGEOM *lwg2, DISTPTS *dl);
|
|
int lw_dist2d_recursive(const LWCOLLECTION * lwg1,const LWCOLLECTION * lwg2, DISTPTS *dl);
|
|
int lw_dist2d_check_overlap(LWGEOM *lwg1,LWGEOM *lwg2);
|
|
int lw_dist2d_distribute_fast(LWGEOM *lwg1, LWGEOM *lwg2, DISTPTS *dl);
|
|
/*
|
|
Brute force functions
|
|
*/
|
|
|
|
int lw_dist2d_seg_seg(POINT2D *A, POINT2D *B, POINT2D *C, POINT2D *D, DISTPTS *dl);
|
|
int lw_dist2d_pt_ptarray(POINT2D *p, POINTARRAY *pa, DISTPTS *dl);
|
|
int lw_dist2d_ptarray_ptarray(POINTARRAY *l1, POINTARRAY *l2, DISTPTS *dl);
|
|
int lw_dist2d_ptarray_poly(POINTARRAY *pa, LWPOLY *poly, DISTPTS *dl);
|
|
int lw_dist2d_point_point(LWPOINT *point1, LWPOINT *point2, DISTPTS *dl);
|
|
int lw_dist2d_point_line(LWPOINT *point, LWLINE *line, DISTPTS *dl);
|
|
int lw_dist2d_line_line(LWLINE *line1, LWLINE *line2, DISTPTS *dl);
|
|
int lw_dist2d_point_poly(LWPOINT *point, LWPOLY *poly, DISTPTS *dl);
|
|
int lw_dist2d_poly_poly(LWPOLY *poly1, LWPOLY *poly2, DISTPTS *dl);
|
|
int lw_dist2d_line_poly(LWLINE *line, LWPOLY *poly, DISTPTS *dl);
|
|
/*
|
|
New faster distance calculations
|
|
*/
|
|
|
|
int lw_dist2d_pre_seg_seg(POINTARRAY *l1, POINTARRAY *l2,LISTSTRUCT *list1, LISTSTRUCT *list2,double k, DISTPTS *dl);
|
|
int lw_dist2d_selected_seg_seg(POINT2D *A, POINT2D *B, POINT2D *C, POINT2D *D, DISTPTS *dl);
|
|
int struct_cmp_by_measure(const void *a, const void *b);
|
|
int lw_dist2d_fast_ptarray_ptarray(POINTARRAY *l1,POINTARRAY *l2, DISTPTS *dl, BOX2DFLOAT4 *box1, BOX2DFLOAT4 *box2);
|
|
/*
|
|
Functions in common for Brute force and new calculation
|
|
*/
|
|
int lw_dist2d_pt_pt(POINT2D *p1, POINT2D *p2, DISTPTS *dl);
|
|
int lw_dist2d_pt_seg(POINT2D *p, POINT2D *A, POINT2D *B, DISTPTS *dl);
|