PostGIS  2.5.7dev-r@@SVN_REVISION@@
liblwgeom_internal.h
Go to the documentation of this file.
1 /**********************************************************************
2  *
3  * PostGIS - Spatial Types for PostgreSQL
4  * http://postgis.net
5  *
6  * PostGIS is free software: you can redistribute it and/or modify
7  * it under the terms of the GNU General Public License as published by
8  * the Free Software Foundation, either version 2 of the License, or
9  * (at your option) any later version.
10  *
11  * PostGIS is distributed in the hope that it will be useful,
12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14  * GNU General Public License for more details.
15  *
16  * You should have received a copy of the GNU General Public License
17  * along with PostGIS. If not, see <http://www.gnu.org/licenses/>.
18  *
19  **********************************************************************
20  *
21  * Copyright (C) 2011-2012 Sandro Santilli <strk@kbt.io>
22  * Copyright (C) 2011 Paul Ramsey <pramsey@cleverelephant.ca>
23  * Copyright (C) 2007-2008 Mark Cave-Ayland
24  * Copyright (C) 2001-2006 Refractions Research Inc.
25  *
26  **********************************************************************/
27 
28 
29 #ifndef _LIBLWGEOM_INTERNAL_H
30 #define _LIBLWGEOM_INTERNAL_H 1
31 
32 #include "../postgis_config.h"
33 
34 #include "lwgeom_log.h"
35 
36 #include <assert.h>
37 #include <stdarg.h>
38 #include <stdint.h>
39 #include <stdio.h>
40 #include <string.h>
41 
42 #if HAVE_IEEEFP_H
43 #include <ieeefp.h>
44 #endif
45 
46 #include <float.h>
47 
48 #include "liblwgeom.h"
49 
53 #define FP_TOLERANCE 1e-12
54 #define FP_IS_ZERO(A) (fabs(A) <= FP_TOLERANCE)
55 #define FP_MAX(A, B) (((A) > (B)) ? (A) : (B))
56 #define FP_MIN(A, B) (((A) < (B)) ? (A) : (B))
57 #define FP_ABS(a) ((a) < (0) ? -(a) : (a))
58 #define FP_EQUALS(A, B) (fabs((A)-(B)) <= FP_TOLERANCE)
59 #define FP_NEQUALS(A, B) (fabs((A)-(B)) > FP_TOLERANCE)
60 #define FP_LT(A, B) (((A) + FP_TOLERANCE) < (B))
61 #define FP_LTEQ(A, B) (((A) - FP_TOLERANCE) <= (B))
62 #define FP_GT(A, B) (((A) - FP_TOLERANCE) > (B))
63 #define FP_GTEQ(A, B) (((A) + FP_TOLERANCE) >= (B))
64 #define FP_CONTAINS_TOP(A, X, B) (FP_LT(A, X) && FP_LTEQ(X, B))
65 #define FP_CONTAINS_BOTTOM(A, X, B) (FP_LTEQ(A, X) && FP_LT(X, B))
66 #define FP_CONTAINS_INCL(A, X, B) (FP_LTEQ(A, X) && FP_LTEQ(X, B))
67 #define FP_CONTAINS_EXCL(A, X, B) (FP_LT(A, X) && FP_LT(X, B))
68 #define FP_CONTAINS(A, X, B) FP_CONTAINS_EXCL(A, X, B)
69 
70 
71 /*
72 * this will change to NaN when I figure out how to
73 * get NaN in a platform-independent way
74 */
75 #define NO_VALUE 0.0
76 #define NO_Z_VALUE NO_VALUE
77 #define NO_M_VALUE NO_VALUE
78 
79 
83 #define WKT_NO_TYPE 0x08 /* Internal use only */
84 #define WKT_NO_PARENS 0x10 /* Internal use only */
85 #define WKT_IS_CHILD 0x20 /* Internal use only */
86 
91 #define WKB_DOUBLE_SIZE 8 /* Internal use only */
92 #define WKB_INT_SIZE 4 /* Internal use only */
93 #define WKB_BYTE_SIZE 1 /* Internal use only */
94 
98 #define WKB_POINT_TYPE 1
99 #define WKB_LINESTRING_TYPE 2
100 #define WKB_POLYGON_TYPE 3
101 #define WKB_MULTIPOINT_TYPE 4
102 #define WKB_MULTILINESTRING_TYPE 5
103 #define WKB_MULTIPOLYGON_TYPE 6
104 #define WKB_GEOMETRYCOLLECTION_TYPE 7
105 #define WKB_CIRCULARSTRING_TYPE 8
106 #define WKB_COMPOUNDCURVE_TYPE 9
107 #define WKB_CURVEPOLYGON_TYPE 10
108 #define WKB_MULTICURVE_TYPE 11
109 #define WKB_MULTISURFACE_TYPE 12
110 #define WKB_CURVE_TYPE 13 /* from ISO draft, not sure is real */
111 #define WKB_SURFACE_TYPE 14 /* from ISO draft, not sure is real */
112 #define WKB_POLYHEDRALSURFACE_TYPE 15
113 #define WKB_TIN_TYPE 16
114 #define WKB_TRIANGLE_TYPE 17
115 
121 #define SIZE_GET(varsize) (((varsize) >> 2) & 0x3FFFFFFF)
122 #define SIZE_SET(varsize, size) (((varsize) & 0x00000003)|(((size) & 0x3FFFFFFF) << 2 ))
123 
130 #define SIGNUM(n) (((n) > 0) - ((n) < 0))
131 
135 #define EPSILON_SQLMM 1e-8
136 
137 /*
138  * Export functions
139  */
140 #define OUT_MAX_DOUBLE 1E15
141 #define OUT_SHOW_DIGS_DOUBLE 20
142 #define OUT_MAX_DOUBLE_PRECISION 15
143 #define OUT_MAX_DIGS_DOUBLE (OUT_SHOW_DIGS_DOUBLE + 2) /* +2 mean add dot and sign */
144 #define OUT_DOUBLE_BUFFER_SIZE \
145  OUT_MAX_DIGS_DOUBLE + OUT_MAX_DOUBLE_PRECISION + 1
146 
150 #define LW_INSIDE 1
151 #define LW_BOUNDARY 0
152 #define LW_OUTSIDE -1
153 
154 /*
155 * Internal prototypes
156 */
157 
158 /* Machine endianness */
159 #define XDR 0 /* big endian */
160 #define NDR 1 /* little endian */
161 extern char getMachineEndian(void);
162 
163 
164 /*
165 * Force dims
166 */
167 LWGEOM* lwgeom_force_dims(const LWGEOM *lwgeom, int hasz, int hasm);
168 LWPOINT* lwpoint_force_dims(const LWPOINT *lwpoint, int hasz, int hasm);
169 LWLINE* lwline_force_dims(const LWLINE *lwline, int hasz, int hasm);
170 LWPOLY* lwpoly_force_dims(const LWPOLY *lwpoly, int hasz, int hasm);
171 LWCOLLECTION* lwcollection_force_dims(const LWCOLLECTION *lwcol, int hasz, int hasm);
172 POINTARRAY* ptarray_force_dims(const POINTARRAY *pa, int hasz, int hasm);
173 
179 void ptarray_swap_ordinates(POINTARRAY *pa, LWORD o1, LWORD o2);
180 
181 /*
182 * Is Empty?
183 */
184 int lwpoly_is_empty(const LWPOLY *poly);
185 int lwcollection_is_empty(const LWCOLLECTION *col);
186 int lwcircstring_is_empty(const LWCIRCSTRING *circ);
187 int lwtriangle_is_empty(const LWTRIANGLE *triangle);
188 int lwline_is_empty(const LWLINE *line);
189 int lwpoint_is_empty(const LWPOINT *point);
190 
191 /*
192 * Number of vertices?
193 */
197 
198 /*
199 * DP simplification
200 */
201 
205 void ptarray_simplify_in_place(POINTARRAY *pa, double epsilon, uint32_t minpts);
206 
207 /*
208 * The possible ways a pair of segments can interact. Returned by lw_segment_intersects
209 */
211  SEG_ERROR = -1,
217  SEG_TOUCH_RIGHT = 5
218 };
219 
220 /*
221 * Do the segments intersect? How?
222 */
223 int lw_segment_intersects(const POINT2D *p1, const POINT2D *p2, const POINT2D *q1, const POINT2D *q2);
224 
225 /*
226 * Get/Set an enumeratoed ordinate. (x,y,z,m)
227 */
228 double lwpoint_get_ordinate(const POINT4D *p, char ordinate);
229 void lwpoint_set_ordinate(POINT4D *p, char ordinate, double value);
230 
231 /*
232 * Generate an interpolated coordinate p given an interpolation value and ordinate to apply it to
233 */
234 int point_interpolate(const POINT4D *p1, const POINT4D *p2, POINT4D *p, int hasz, int hasm, char ordinate, double interpolation_value);
235 
236 
240 LWCOLLECTION *lwline_clip_to_ordinate_range(const LWLINE *line, char ordinate, double from, double to);
241 
245 LWCOLLECTION *lwmline_clip_to_ordinate_range(const LWMLINE *mline, char ordinate, double from, double to);
246 
250 LWCOLLECTION *lwmpoint_clip_to_ordinate_range(const LWMPOINT *mpoint, char ordinate, double from, double to);
251 
255 LWCOLLECTION *lwpoint_clip_to_ordinate_range(const LWPOINT *mpoint, char ordinate, double from, double to);
256 
257 /*
258 * Geohash
259 */
260 int lwgeom_geohash_precision(GBOX bbox, GBOX *bounds);
261 char *geohash_point(double longitude, double latitude, int precision);
262 void decode_geohash_bbox(char *geohash, double *lat, double *lon, int precision);
263 
264 /*
265 * Point comparisons
266 */
267 int p4d_same(const POINT4D *p1, const POINT4D *p2);
268 int p3d_same(const POINT3D *p1, const POINT3D *p2);
269 int p2d_same(const POINT2D *p1, const POINT2D *p2);
270 
271 /*
272 * Area calculations
273 */
274 double lwpoly_area(const LWPOLY *poly);
275 double lwcurvepoly_area(const LWCURVEPOLY *curvepoly);
276 double lwtriangle_area(const LWTRIANGLE *triangle);
277 
282 int gserialized_read_gbox_p(const GSERIALIZED *g, GBOX *gbox);
283 
284 /*
285 * Length calculations
286 */
287 double lwcompound_length(const LWCOMPOUND *comp);
288 double lwcompound_length_2d(const LWCOMPOUND *comp);
289 double lwline_length(const LWLINE *line);
290 double lwline_length_2d(const LWLINE *line);
291 double lwcircstring_length(const LWCIRCSTRING *circ);
292 double lwcircstring_length_2d(const LWCIRCSTRING *circ);
293 double lwpoly_perimeter(const LWPOLY *poly);
294 double lwpoly_perimeter_2d(const LWPOLY *poly);
295 double lwcurvepoly_perimeter(const LWCURVEPOLY *poly);
296 double lwcurvepoly_perimeter_2d(const LWCURVEPOLY *poly);
297 double lwtriangle_perimeter(const LWTRIANGLE *triangle);
298 double lwtriangle_perimeter_2d(const LWTRIANGLE *triangle);
299 
300 /*
301 * Segmentization
302 */
303 LWLINE *lwcompound_stroke(const LWCOMPOUND *icompound, uint32_t perQuad);
304 LWPOLY *lwcurvepoly_stroke(const LWCURVEPOLY *curvepoly, uint32_t perQuad);
305 
306 /*
307 * Affine
308 */
309 void ptarray_affine(POINTARRAY *pa, const AFFINE *affine);
310 void affine_invert(AFFINE *affine);
311 
312 /*
313 * Scale
314 */
315 void ptarray_scale(POINTARRAY *pa, const POINT4D *factor);
316 
317 /*
318 * PointArray
319 */
320 int ptarray_has_z(const POINTARRAY *pa);
321 int ptarray_has_m(const POINTARRAY *pa);
322 double ptarray_signed_area(const POINTARRAY *pa);
323 
324 /*
325 * Length
326 */
327 double ptarray_length(const POINTARRAY *pts);
328 double ptarray_arc_length_2d(const POINTARRAY *pts);
329 
330 /*
331 * Clone support
332 */
333 LWPOINT *lwpoint_clone(const LWPOINT *lwgeom);
334 LWLINE *lwline_clone(const LWLINE *lwgeom);
335 LWPOLY *lwpoly_clone(const LWPOLY *lwgeom);
336 LWTRIANGLE *lwtriangle_clone(const LWTRIANGLE *lwgeom);
339 POINTARRAY *ptarray_clone(const POINTARRAY *ptarray);
340 LWLINE *lwline_clone_deep(const LWLINE *lwgeom);
341 LWPOLY *lwpoly_clone_deep(const LWPOLY *lwgeom);
343 GBOX *gbox_clone(const GBOX *gbox);
344 
345 /*
346 * Clockwise
347 */
348 void lwpoly_force_clockwise(LWPOLY *poly);
349 void lwtriangle_force_clockwise(LWTRIANGLE *triangle);
350 int lwpoly_is_clockwise(LWPOLY *poly);
351 int lwtriangle_is_clockwise(LWTRIANGLE *triangle);
352 int ptarray_isccw(const POINTARRAY *pa);
353 
354 /*
355 * Same
356 */
357 char ptarray_same(const POINTARRAY *pa1, const POINTARRAY *pa2);
358 char lwpoint_same(const LWPOINT *p1, const LWPOINT *p2);
359 char lwline_same(const LWLINE *p1, const LWLINE *p2);
360 char lwpoly_same(const LWPOLY *p1, const LWPOLY *p2);
361 char lwtriangle_same(const LWTRIANGLE *p1, const LWTRIANGLE *p2);
362 char lwcollection_same(const LWCOLLECTION *p1, const LWCOLLECTION *p2);
363 char lwcircstring_same(const LWCIRCSTRING *p1, const LWCIRCSTRING *p2);
364 
365 /*
366 * Transform
367 */
368 int point4d_transform(POINT4D *pt, projPJ srcpj, projPJ dstpj);
369 
370 /*
371 * Shift
372 */
374 
375 /*
376 * Support for in place modification of point arrays, fast
377 * function to move coordinate values around
378 */
379 void ptarray_copy_point(POINTARRAY *pa, uint32_t from, uint32_t to);
380 
381 /*
382 * Reverse
383 */
385 
386 /*
387 * Startpoint
388 */
389 int lwpoly_startpoint(const LWPOLY* lwpoly, POINT4D* pt);
390 int ptarray_startpoint(const POINTARRAY* pa, POINT4D* pt);
391 int lwcollection_startpoint(const LWCOLLECTION* col, POINT4D* pt);
392 
393 /*
394  * Write into *ret the coordinates of the closest point on
395  * segment A-B to the reference input point R
396  */
397 void closest_point_on_segment(const POINT4D *R, const POINT4D *A, const POINT4D *B, POINT4D *ret);
398 
399 /*
400 * Repeated points
401 */
402 POINTARRAY *ptarray_remove_repeated_points(const POINTARRAY *in, double tolerance);
403 LWGEOM* lwline_remove_repeated_points(const LWLINE *in, double tolerance);
404 void ptarray_remove_repeated_points_in_place(POINTARRAY *pa, double tolerance, uint32_t min_points);
405 
406 /*
407 * Closure test
408 */
409 int lwline_is_closed(const LWLINE *line);
410 int lwpoly_is_closed(const LWPOLY *poly);
411 int lwcircstring_is_closed(const LWCIRCSTRING *curve);
412 int lwcompound_is_closed(const LWCOMPOUND *curve);
413 int lwpsurface_is_closed(const LWPSURFACE *psurface);
414 int lwtin_is_closed(const LWTIN *tin);
415 
423 typedef struct gridspec_t
424 {
425  double ipx;
426  double ipy;
427  double ipz;
428  double ipm;
429  double xsize;
430  double ysize;
431  double zsize;
432  double msize;
433 }
435 
436 LWGEOM* lwgeom_grid(const LWGEOM *lwgeom, const gridspec *grid);
437 void lwgeom_grid_in_place(LWGEOM *lwgeom, const gridspec *grid);
438 void ptarray_grid_in_place(POINTARRAY *pa, const gridspec *grid);
439 
440 /*
441 * What side of the line formed by p1 and p2 does q fall?
442 * Returns -1 for left and 1 for right and 0 for co-linearity
443 */
444 int lw_segment_side(const POINT2D *p1, const POINT2D *p2, const POINT2D *q);
445 int lw_arc_side(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3, const POINT2D *Q);
446 int lw_arc_calculate_gbox_cartesian_2d(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3, GBOX *gbox);
447 double lw_arc_center(const POINT2D *p1, const POINT2D *p2, const POINT2D *p3, POINT2D *result);
448 int lw_pt_in_seg(const POINT2D *P, const POINT2D *A1, const POINT2D *A2);
449 int lw_pt_in_arc(const POINT2D *P, const POINT2D *A1, const POINT2D *A2, const POINT2D *A3);
450 int lw_arc_is_pt(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3);
451 double lw_seg_length(const POINT2D *A1, const POINT2D *A2);
452 double lw_arc_length(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3);
453 int pt_in_ring_2d(const POINT2D *p, const POINTARRAY *ring);
454 int ptarray_contains_point(const POINTARRAY *pa, const POINT2D *pt);
455 int ptarrayarc_contains_point(const POINTARRAY *pa, const POINT2D *pt);
456 int ptarray_contains_point_partial(const POINTARRAY *pa, const POINT2D *pt, int check_closed, int *winding_number);
457 int ptarrayarc_contains_point_partial(const POINTARRAY *pa, const POINT2D *pt, int check_closed, int *winding_number);
458 int lwcompound_contains_point(const LWCOMPOUND *comp, const POINT2D *pt);
459 int lwgeom_contains_point(const LWGEOM *geom, const POINT2D *pt);
460 
471 int lwline_split_by_point_to(const LWLINE* ln, const LWPOINT* pt, LWMLINE* to);
472 
474 void lwcollection_reserve(LWCOLLECTION *col, uint32_t ngeoms);
475 
477 int lwcollection_allows_subtype(int collectiontype, int subtype);
478 
480 double gbox_angular_height(const GBOX* gbox);
481 double gbox_angular_width(const GBOX* gbox);
482 int gbox_centroid(const GBOX* gbox, POINT2D* out);
483 
484 /* Utilities */
485 int lwprint_double(double d, int maxdd, char* buf, size_t bufsize);
486 extern uint8_t MULTITYPE[NUMTYPES];
487 
489 extern int _lwgeom_interrupt_requested;
490 #define LW_ON_INTERRUPT(x) { \
491  if ( _lwgeom_interrupt_callback ) { \
492  (*_lwgeom_interrupt_callback)(); \
493  } \
494  if ( _lwgeom_interrupt_requested ) { \
495  _lwgeom_interrupt_requested = 0; \
496  lwnotice("liblwgeom code interrupted"); \
497  x; \
498  } \
499 }
500 
501 int ptarray_npoints_in_rect(const POINTARRAY *pa, const GBOX *gbox);
502 int gbox_contains_point2d(const GBOX *g, const POINT2D *p);
503 int lwpoly_contains_point(const LWPOLY *poly, const POINT2D *pt);
504 POINT4D* lwmpoint_extract_points_4d(const LWMPOINT* g, uint32_t* npoints, int* input_empty);
505 
506 #endif /* _LIBLWGEOM_INTERNAL_H */
static uint8_t precision
Definition: cu_in_twkb.c:25
void() lwinterrupt_callback()
Install a callback to be called periodically during algorithm execution.
Definition: liblwgeom.h:267
#define NUMTYPES
Definition: liblwgeom.h:101
enum LWORD_T LWORD
Ordinate names.
This library is the generic geometry handling section of PostGIS.
int ptarray_contains_point_partial(const POINTARRAY *pa, const POINT2D *pt, int check_closed, int *winding_number)
Definition: ptarray.c:740
double lwline_length_2d(const LWLINE *line)
Definition: lwline.c:534
void ptarray_longitude_shift(POINTARRAY *pa)
Longitude shift for a pointarray.
Definition: ptarray.c:1416
void lwpoint_set_ordinate(POINT4D *p, char ordinate, double value)
Given a point, ordinate number and value, set that ordinate on the point.
LWLINE * lwline_clone_deep(const LWLINE *lwgeom)
Definition: lwline.c:118
int lwgeom_geohash_precision(GBOX bbox, GBOX *bounds)
Definition: lwalgorithm.c:760
double lwcircstring_length_2d(const LWCIRCSTRING *circ)
Definition: lwcircstring.c:281
LWPOINT * lwpoint_clone(const LWPOINT *lwgeom)
Definition: lwpoint.c:239
LWCOLLECTION * lwmpoint_clip_to_ordinate_range(const LWMPOINT *mpoint, char ordinate, double from, double to)
Clip a multi-point based on the from/to range of one of its ordinates.
lwinterrupt_callback * _lwgeom_interrupt_callback
Definition: lwgeom_api.c:736
LWGEOM * lwline_remove_repeated_points(const LWLINE *in, double tolerance)
Definition: lwline.c:448
int lwcircstring_is_closed(const LWCIRCSTRING *curve)
Definition: lwcircstring.c:261
void ptarray_reverse_in_place(POINTARRAY *pa)
Definition: ptarray.c:341
LWLINE * lwline_clone(const LWLINE *lwgeom)
Definition: lwline.c:102
char lwcollection_same(const LWCOLLECTION *p1, const LWCOLLECTION *p2)
check for same geometry composition
Definition: lwcollection.c:278
int p4d_same(const POINT4D *p1, const POINT4D *p2)
Definition: lwalgorithm.c:31
int ptarrayarc_contains_point(const POINTARRAY *pa, const POINT2D *pt)
For POINTARRAYs representing CIRCULARSTRINGS.
Definition: ptarray.c:833
double lwtriangle_area(const LWTRIANGLE *triangle)
Find the area of the outer ring.
Definition: lwtriangle.c:185
int p3d_same(const POINT3D *p1, const POINT3D *p2)
Definition: lwalgorithm.c:40
double lwpoint_get_ordinate(const POINT4D *p, char ordinate)
Given a POINT4D and an ordinate number, return the value of the ordinate.
double lw_arc_length(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3)
Returns the length of a circular arc segment.
Definition: lwalgorithm.c:118
double lwcompound_length_2d(const LWCOMPOUND *comp)
Definition: lwcompound.c:74
uint32_t lwpoly_count_vertices(LWPOLY *poly)
Definition: lwpoly.c:425
int lwline_is_empty(const LWLINE *line)
Definition: lwline.c:511
int lwcompound_contains_point(const LWCOMPOUND *comp, const POINT2D *pt)
Definition: lwcompound.c:145
double ptarray_length(const POINTARRAY *pts)
Find the 3d/2d length of the given POINTARRAY (depending on its dimensionality)
Definition: ptarray.c:1717
LWCOLLECTION * lwline_clip_to_ordinate_range(const LWLINE *line, char ordinate, double from, double to)
Clip a line based on the from/to range of one of its ordinates.
double ptarray_signed_area(const POINTARRAY *pa)
Returns the area in cartesian units.
Definition: ptarray.c:997
char getMachineEndian(void)
Definition: lwutil.c:327
int lwline_is_closed(const LWLINE *line)
Definition: lwline.c:454
char lwtriangle_same(const LWTRIANGLE *p1, const LWTRIANGLE *p2)
Definition: lwtriangle.c:126
int lwpoly_startpoint(const LWPOLY *lwpoly, POINT4D *pt)
Definition: lwpoly.c:531
POINTARRAY * ptarray_clone(const POINTARRAY *ptarray)
Clone a POINTARRAY object.
Definition: ptarray.c:659
int lwcollection_startpoint(const LWCOLLECTION *col, POINT4D *pt)
Definition: lwcollection.c:571
void ptarray_simplify_in_place(POINTARRAY *pa, double epsilon, uint32_t minpts)
Definition: ptarray.c:1576
int _lwgeom_interrupt_requested
Definition: lwgeom_api.c:726
int ptarray_startpoint(const POINTARRAY *pa, POINT4D *pt)
Definition: ptarray.c:2001
int lwcompound_is_closed(const LWCOMPOUND *curve)
Definition: lwcompound.c:35
int gbox_contains_point2d(const GBOX *g, const POINT2D *p)
Definition: g_box.c:357
double lwtriangle_perimeter_2d(const LWTRIANGLE *triangle)
Definition: lwtriangle.c:217
int lwpoly_is_clockwise(LWPOLY *poly)
Definition: lwpoly.c:288
void ptarray_grid_in_place(POINTARRAY *pa, const gridspec *grid)
Definition: ptarray.c:2016
double gbox_angular_height(const GBOX *gbox)
GBOX utility functions to figure out coverage/location on the globe.
Definition: lwgeodetic.c:188
double lwpoly_area(const LWPOLY *poly)
Find the area of the outer ring - sum (area of inner rings).
Definition: lwpoly.c:441
CG_SEGMENT_INTERSECTION_TYPE
@ SEG_NO_INTERSECTION
@ SEG_ERROR
@ SEG_COLINEAR
@ SEG_TOUCH_LEFT
@ SEG_CROSS_RIGHT
@ SEG_CROSS_LEFT
@ SEG_TOUCH_RIGHT
int lwline_split_by_point_to(const LWLINE *ln, const LWPOINT *pt, LWMLINE *to)
Split a line by a point and push components to the provided multiline.
int lw_segment_intersects(const POINT2D *p1, const POINT2D *p2, const POINT2D *q1, const POINT2D *q2)
returns the kind of CG_SEGMENT_INTERSECTION_TYPE behavior of lineseg 1 (constructed from p1 and p2) a...
Definition: lwalgorithm.c:372
int lwtriangle_is_clockwise(LWTRIANGLE *triangle)
Definition: lwtriangle.c:113
char ptarray_same(const POINTARRAY *pa1, const POINTARRAY *pa2)
Definition: ptarray.c:478
double gbox_angular_width(const GBOX *gbox)
Returns the angular width (longitudinal span) of the box in radians.
Definition: lwgeodetic.c:215
char lwline_same(const LWLINE *p1, const LWLINE *p2)
Definition: lwline.c:150
void ptarray_remove_repeated_points_in_place(POINTARRAY *pa, double tolerance, uint32_t min_points)
Definition: ptarray.c:1453
double lwtriangle_perimeter(const LWTRIANGLE *triangle)
Definition: lwtriangle.c:208
POINT4D * lwmpoint_extract_points_4d(const LWMPOINT *g, uint32_t *npoints, int *input_empty)
double lw_arc_center(const POINT2D *p1, const POINT2D *p2, const POINT2D *p3, POINT2D *result)
Determines the center of the circle defined by the three given points.
Definition: lwalgorithm.c:228
int lwpoint_is_empty(const LWPOINT *point)
Definition: lwpoint.c:291
int pt_in_ring_2d(const POINT2D *p, const POINTARRAY *ring)
Definition: lwalgorithm.c:281
double lwcompound_length(const LWCOMPOUND *comp)
Definition: lwcompound.c:69
LWCOLLECTION * lwcollection_clone_deep(const LWCOLLECTION *lwgeom)
Deep clone LWCOLLECTION object.
Definition: lwcollection.c:149
int lw_arc_side(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3, const POINT2D *Q)
Definition: lwalgorithm.c:178
double lw_seg_length(const POINT2D *A1, const POINT2D *A2)
Returns the length of a linear segment.
Definition: lwalgorithm.c:74
void lwtriangle_force_clockwise(LWTRIANGLE *triangle)
Definition: lwtriangle.c:106
LWPOINT * lwpoint_force_dims(const LWPOINT *lwpoint, int hasz, int hasm)
Definition: lwpoint.c:271
void affine_invert(AFFINE *affine)
double ptarray_arc_length_2d(const POINTARRAY *pts)
Find the 2d length of the given POINTARRAY, using circular arc interpolation between each coordinate ...
Definition: ptarray.c:1662
POINTARRAY * ptarray_remove_repeated_points(const POINTARRAY *in, double tolerance)
Definition: ptarray.c:1446
LWCOLLECTION * lwpoint_clip_to_ordinate_range(const LWPOINT *mpoint, char ordinate, double from, double to)
Clip a point based on the from/to range of one of its ordinates.
void ptarray_scale(POINTARRAY *pa, const POINT4D *factor)
WARNING, make sure you send in only 16-member double arrays or obviously things will go pear-shaped f...
Definition: ptarray.c:1983
void ptarray_affine(POINTARRAY *pa, const AFFINE *affine)
Affine transform a pointarray.
Definition: ptarray.c:1796
int lwpsurface_is_closed(const LWPSURFACE *psurface)
Definition: lwpsurface.c:99
int lwtriangle_is_empty(const LWTRIANGLE *triangle)
Definition: lwtriangle.c:174
int ptarray_contains_point(const POINTARRAY *pa, const POINT2D *pt)
Return 1 if the point is inside the POINTARRAY, -1 if it is outside, and 0 if it is on the boundary.
Definition: ptarray.c:734
LWPOLY * lwpoly_force_dims(const LWPOLY *lwpoly, int hasz, int hasm)
Definition: lwpoly.c:394
int ptarrayarc_contains_point_partial(const POINTARRAY *pa, const POINT2D *pt, int check_closed, int *winding_number)
Definition: ptarray.c:839
double lwcurvepoly_perimeter(const LWCURVEPOLY *poly)
Definition: lwcurvepoly.c:148
LWCOLLECTION * lwcollection_force_dims(const LWCOLLECTION *lwcol, int hasz, int hasm)
Definition: lwcollection.c:485
int lw_pt_in_seg(const POINT2D *P, const POINT2D *A1, const POINT2D *A2)
Returns true if P is between A1/A2.
Definition: lwalgorithm.c:95
int lwpoly_is_empty(const LWPOLY *poly)
Definition: lwpoly.c:418
char lwpoly_same(const LWPOLY *p1, const LWPOLY *p2)
Definition: lwpoly.c:339
int lwgeom_contains_point(const LWGEOM *geom, const POINT2D *pt)
Definition: lwcompound.c:129
int ptarray_isccw(const POINTARRAY *pa)
Definition: ptarray.c:1028
int ptarray_has_z(const POINTARRAY *pa)
Definition: ptarray.c:36
double lwline_length(const LWLINE *line)
Definition: lwline.c:527
uint8_t MULTITYPE[NUMTYPES]
Look-up for the correct MULTI* type promotion for singleton types.
Definition: lwgeom.c:345
LWLINE * lwcompound_stroke(const LWCOMPOUND *icompound, uint32_t perQuad)
Definition: lwstroke.c:523
void lwcollection_reserve(LWCOLLECTION *col, uint32_t ngeoms)
Ensure the collection can hold at least up to ngeoms geometries.
Definition: lwcollection.c:174
void lwpoly_force_clockwise(LWPOLY *poly)
Definition: lwpoly.c:268
void ptarray_swap_ordinates(POINTARRAY *pa, LWORD o1, LWORD o2)
Swap ordinate values o1 and o2 on a given POINTARRAY.
Definition: ptarray.c:387
int gserialized_read_gbox_p(const GSERIALIZED *g, GBOX *gbox)
Pull a GBOX from the header of a GSERIALIZED, if one is available.
Definition: g_serialized.c:414
LWPOLY * lwcurvepoly_stroke(const LWCURVEPOLY *curvepoly, uint32_t perQuad)
Definition: lwstroke.c:585
double lwpoly_perimeter_2d(const LWPOLY *poly)
Compute the sum of polygon rings length (forcing 2d computation).
Definition: lwpoly.c:492
int lwprint_double(double d, int maxdd, char *buf, size_t bufsize)
Definition: lwprint.c:490
int ptarray_npoints_in_rect(const POINTARRAY *pa, const GBOX *gbox)
Definition: ptarray.c:2084
int lw_segment_side(const POINT2D *p1, const POINT2D *p2, const POINT2D *q)
lw_segment_side()
Definition: lwalgorithm.c:64
int lwtin_is_closed(const LWTIN *tin)
Definition: lwtin.c:93
int gbox_centroid(const GBOX *gbox, POINT2D *out)
Computes the average(ish) center of the box and returns success.
Definition: lwgeodetic.c:267
int lwpoly_contains_point(const LWPOLY *poly, const POINT2D *pt)
Definition: lwpoly.c:539
void closest_point_on_segment(const POINT4D *R, const POINT4D *A, const POINT4D *B, POINT4D *ret)
Definition: ptarray.c:1257
GBOX * gbox_clone(const GBOX *gbox)
Definition: g_box.c:52
char lwcircstring_same(const LWCIRCSTRING *p1, const LWCIRCSTRING *p2)
Definition: lwcircstring.c:131
LWPOLY * lwpoly_clone_deep(const LWPOLY *lwgeom)
Definition: lwpoly.c:228
double lwcircstring_length(const LWCIRCSTRING *circ)
Definition: lwcircstring.c:276
uint32_t lwcollection_count_vertices(LWCOLLECTION *col)
Definition: lwcollection.c:521
int point_interpolate(const POINT4D *p1, const POINT4D *p2, POINT4D *p, int hasz, int hasm, char ordinate, double interpolation_value)
Given two points, a dimensionality, an ordinate, and an interpolation value generate a new point that...
int lw_arc_is_pt(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3)
Returns true if arc A is actually a point (all vertices are the same) .
Definition: lwalgorithm.c:105
double lwcurvepoly_area(const LWCURVEPOLY *curvepoly)
This should be rewritten to make use of the curve itself.
Definition: lwcurvepoly.c:134
LWCOLLECTION * lwcollection_clone(const LWCOLLECTION *lwgeom)
Clone LWCOLLECTION object.
Definition: lwcollection.c:123
void decode_geohash_bbox(char *geohash, double *lat, double *lon, int precision)
Definition: lwalgorithm.c:714
int lwpoly_is_closed(const LWPOLY *poly)
Definition: lwpoly.c:506
LWLINE * lwline_force_dims(const LWLINE *lwline, int hasz, int hasm)
Definition: lwline.c:492
struct gridspec_t gridspec
Snap to grid.
int lwcollection_allows_subtype(int collectiontype, int subtype)
Check if subtype is allowed in collectiontype.
Definition: lwcollection.c:534
LWGEOM * lwgeom_force_dims(const LWGEOM *lwgeom, int hasz, int hasm)
Definition: lwgeom.c:808
LWPOLY * lwpoly_clone(const LWPOLY *lwgeom)
Definition: lwpoly.c:213
LWGEOM * lwgeom_grid(const LWGEOM *lwgeom, const gridspec *grid)
Definition: lwgeom.c:2253
void ptarray_copy_point(POINTARRAY *pa, uint32_t from, uint32_t to)
Definition: lwgeom_api.c:460
POINTARRAY * ptarray_force_dims(const POINTARRAY *pa, int hasz, int hasm)
Definition: ptarray.c:1037
int lw_pt_in_arc(const POINT2D *P, const POINT2D *A1, const POINT2D *A2, const POINT2D *A3)
Returns true if P is on the same side of the plane partition defined by A1/A3 as A2 is.
Definition: lwalgorithm.c:85
int ptarray_has_m(const POINTARRAY *pa)
Definition: ptarray.c:43
int lwcircstring_is_empty(const LWCIRCSTRING *circ)
Definition: lwcircstring.c:269
int lwcollection_is_empty(const LWCOLLECTION *col)
Definition: lwcollection.c:508
uint32_t lwline_count_vertices(LWLINE *line)
Definition: lwline.c:519
double lwcurvepoly_perimeter_2d(const LWCURVEPOLY *poly)
Definition: lwcurvepoly.c:160
double lwpoly_perimeter(const LWPOLY *poly)
Compute the sum of polygon rings length.
Definition: lwpoly.c:474
int lw_arc_calculate_gbox_cartesian_2d(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3, GBOX *gbox)
Definition: g_box.c:459
LWTRIANGLE * lwtriangle_clone(const LWTRIANGLE *lwgeom)
Definition: lwtriangle.c:99
char lwpoint_same(const LWPOINT *p1, const LWPOINT *p2)
Definition: lwpoint.c:264
LWCIRCSTRING * lwcircstring_clone(const LWCIRCSTRING *curve)
Definition: lwcircstring.c:124
void lwgeom_grid_in_place(LWGEOM *lwgeom, const gridspec *grid)
Definition: lwgeom.c:2152
LWCOLLECTION * lwmline_clip_to_ordinate_range(const LWMLINE *mline, char ordinate, double from, double to)
Clip a multi-line based on the from/to range of one of its ordinates.
char * geohash_point(double longitude, double latitude, int precision)
Definition: lwalgorithm.c:591
int point4d_transform(POINT4D *pt, projPJ srcpj, projPJ dstpj)
int p2d_same(const POINT2D *p1, const POINT2D *p2)
Definition: lwalgorithm.c:49
int value
Definition: genraster.py:61
Snap to grid.
unsigned int uint32_t
Definition: uthash.h:78
unsigned char uint8_t
Definition: uthash.h:79