PostGIS  3.4.0dev-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-2021 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 #include <stdlib.h>
42 #include <float.h>
43 #include <math.h>
44 
45 #if HAVE_IEEEFP_H
46 #include <ieeefp.h>
47 #endif
48 
49 #include "liblwgeom.h"
50 
54 #define FP_TOLERANCE 1e-12
55 #define FP_IS_ZERO(A) (fabs(A) <= FP_TOLERANCE)
56 #define FP_MAX(A, B) (((A) > (B)) ? (A) : (B))
57 #define FP_MIN(A, B) (((A) < (B)) ? (A) : (B))
58 #define FP_ABS(a) ((a) < (0) ? -(a) : (a))
59 #define FP_EQUALS(A, B) (fabs((A)-(B)) <= FP_TOLERANCE)
60 #define FP_NEQUALS(A, B) (fabs((A)-(B)) > FP_TOLERANCE)
61 #define FP_LT(A, B) (((A) + FP_TOLERANCE) < (B))
62 #define FP_LTEQ(A, B) (((A) - FP_TOLERANCE) <= (B))
63 #define FP_GT(A, B) (((A) - FP_TOLERANCE) > (B))
64 #define FP_GTEQ(A, B) (((A) + FP_TOLERANCE) >= (B))
65 #define FP_CONTAINS_TOP(A, X, B) (FP_LT(A, X) && FP_LTEQ(X, B))
66 #define FP_CONTAINS_BOTTOM(A, X, B) (FP_LTEQ(A, X) && FP_LT(X, B))
67 #define FP_CONTAINS_INCL(A, X, B) (FP_LTEQ(A, X) && FP_LTEQ(X, B))
68 #define FP_CONTAINS_EXCL(A, X, B) (FP_LT(A, X) && FP_LT(X, B))
69 #define FP_CONTAINS(A, X, B) FP_CONTAINS_EXCL(A, X, B)
70 
71 #define STR_EQUALS(A, B) strcmp((A), (B)) == 0
72 #define STR_IEQUALS(A, B) (strcasecmp((A), (B)) == 0)
73 #define STR_ISTARTS(A, B) (strncasecmp((A), (B), strlen((B))) == 0)
74 
75 
76 /*
77 * this will change to NaN when I figure out how to
78 * get NaN in a platform-independent way
79 */
80 #define NO_VALUE 0.0
81 #define NO_Z_VALUE NO_VALUE
82 #define NO_M_VALUE NO_VALUE
83 
84 
88 #define WKT_NO_TYPE 0x08 /* Internal use only */
89 #define WKT_NO_PARENS 0x10 /* Internal use only */
90 #define WKT_IS_CHILD 0x20 /* Internal use only */
91 
96 #define WKB_DOUBLE_SIZE 8 /* Internal use only */
97 #define WKB_INT_SIZE 4 /* Internal use only */
98 #define WKB_BYTE_SIZE 1 /* Internal use only */
99 
103 #define WKB_POINT_TYPE 1
104 #define WKB_LINESTRING_TYPE 2
105 #define WKB_POLYGON_TYPE 3
106 #define WKB_MULTIPOINT_TYPE 4
107 #define WKB_MULTILINESTRING_TYPE 5
108 #define WKB_MULTIPOLYGON_TYPE 6
109 #define WKB_GEOMETRYCOLLECTION_TYPE 7
110 #define WKB_CIRCULARSTRING_TYPE 8
111 #define WKB_COMPOUNDCURVE_TYPE 9
112 #define WKB_CURVEPOLYGON_TYPE 10
113 #define WKB_MULTICURVE_TYPE 11
114 #define WKB_MULTISURFACE_TYPE 12
115 #define WKB_CURVE_TYPE 13 /* from ISO draft, not sure is real */
116 #define WKB_SURFACE_TYPE 14 /* from ISO draft, not sure is real */
117 #define WKB_POLYHEDRALSURFACE_TYPE 15
118 #define WKB_TIN_TYPE 16
119 #define WKB_TRIANGLE_TYPE 17
120 
121 
128 #define SIGNUM(n) (((n) > 0) - ((n) < 0))
129 
133 #define EPSILON_SQLMM 1e-8
134 
135 /*
136  * Export functions
137  */
138 
139 /* Any (absolute) values outside this range will be printed in scientific notation */
140 #define OUT_MIN_DOUBLE 1E-8
141 #define OUT_MAX_DOUBLE 1E15
142 #define OUT_DEFAULT_DECIMAL_DIGITS 15
143 
144 /* 17 digits are sufficient for round-tripping
145  * Then we might add up to 8 (from OUT_MIN_DOUBLE) max leading zeroes (or 2 digits for "e+") */
146 #define OUT_MAX_DIGITS 17 + 8
147 
148 /* Limit for the max amount of characters that a double can use, including dot and sign */
149 /* */
150 #define OUT_MAX_BYTES_DOUBLE (1 /* Sign */ + 2 /* 0.x */ + OUT_MAX_DIGITS)
151 #define OUT_DOUBLE_BUFFER_SIZE OUT_MAX_BYTES_DOUBLE + 1 /* +1 including NULL */
152 
156 #define LW_INSIDE 1
157 #define LW_BOUNDARY 0
158 #define LW_OUTSIDE -1
159 
160 /*
161 * Internal prototypes
162 */
163 
164 /* Machine endianness */
165 #define XDR 0 /* big endian */
166 #define NDR 1 /* little endian */
167 
168 
169 /*
170 * Force dims
171 */
172 LWGEOM* lwgeom_force_dims(const LWGEOM *lwgeom, int hasz, int hasm, double zval, double mval);
173 LWPOINT* lwpoint_force_dims(const LWPOINT *lwpoint, int hasz, int hasm, double zval, double mval);
174 LWLINE* lwline_force_dims(const LWLINE *lwline, int hasz, int hasm, double zval, double mval);
175 LWPOLY* lwpoly_force_dims(const LWPOLY *lwpoly, int hasz, int hasm, double zval, double mval);
176 LWCOLLECTION* lwcollection_force_dims(const LWCOLLECTION *lwcol, int hasz, int hasm, double zval, double mval);
177 POINTARRAY* ptarray_force_dims(const POINTARRAY *pa, int hasz, int hasm, double zval, double mval);
178 
184 void ptarray_swap_ordinates(POINTARRAY *pa, LWORD o1, LWORD o2);
185 
186 /*
187 * Is Empty?
188 */
189 int lwpoly_is_empty(const LWPOLY *poly);
192 int lwtriangle_is_empty(const LWTRIANGLE *triangle);
193 int lwline_is_empty(const LWLINE *line);
194 int lwpoint_is_empty(const LWPOINT *point);
195 
196 /*
197 * Number of vertices?
198 */
199 uint32_t lwline_count_vertices(const LWLINE *line);
200 uint32_t lwpoly_count_vertices(const LWPOLY *poly);
201 uint32_t lwcollection_count_vertices(const LWCOLLECTION *col);
202 
203 /*
204 * DP simplification
205 */
206 
210 void ptarray_simplify_in_place(POINTARRAY *pa, double tolerance, uint32_t minpts);
211 
212 /*
213 * The possible ways a pair of segments can interact. Returned by lw_segment_intersects
214 */
216  SEG_ERROR = -1,
222  SEG_TOUCH_RIGHT = 5
223 };
224 
225 /*
226 * Do the segments intersect? How?
227 */
228 int lw_segment_intersects(const POINT2D *p1, const POINT2D *p2, const POINT2D *q1, const POINT2D *q2);
229 
230 /*
231 * Get/Set an enumeratoed ordinate. (x,y,z,m)
232 */
233 double lwpoint_get_ordinate(const POINT4D *p, char ordinate);
234 void lwpoint_set_ordinate(POINT4D *p, char ordinate, double value);
235 
236 /*
237 * Generate an interpolated coordinate p given an interpolation value and ordinate to apply it to
238 */
239 int point_interpolate(const POINT4D *p1, const POINT4D *p2, POINT4D *p, int hasz, int hasm, char ordinate, double interpolation_value);
240 
241 
242 /*
243 * Geohash
244 */
245 int lwgeom_geohash_precision(GBOX bbox, GBOX *bounds);
246 lwvarlena_t *geohash_point(double longitude, double latitude, int precision);
247 void decode_geohash_bbox(char *geohash, double *lat, double *lon, int precision);
248 
249 /*
250 * Point comparisons
251 */
252 int p4d_same(const POINT4D *p1, const POINT4D *p2);
253 int p3d_same(const POINT3D *p1, const POINT3D *p2);
254 int p2d_same(const POINT2D *p1, const POINT2D *p2);
255 
256 /*
257 * Projections
258 */
259 int project_pt(const POINT2D *P, double distance, double azimuth, POINT2D *R);
260 int project_pt_pt(const POINT4D *A, const POINT4D *B, double distance, POINT4D *R);
261 
262 /*
263 * Area calculations
264 */
265 double lwpoly_area(const LWPOLY *poly);
266 double lwcurvepoly_area(const LWCURVEPOLY *curvepoly);
267 double lwtriangle_area(const LWTRIANGLE *triangle);
268 
274 
275 /*
276  * Populate a bounding box *without* allocating an LWGEOM. Useful for some performance
277  * purposes. Use only if gserialized_read_gbox_p failed
278  */
280 
286 size_t gserialized_from_lwgeom_size(const LWGEOM *geom);
287 
288 /*
289 * Length calculations
290 */
291 double lwcompound_length(const LWCOMPOUND *comp);
292 double lwcompound_length_2d(const LWCOMPOUND *comp);
293 double lwline_length(const LWLINE *line);
294 double lwline_length_2d(const LWLINE *line);
295 double lwcircstring_length(const LWCIRCSTRING *circ);
296 double lwcircstring_length_2d(const LWCIRCSTRING *circ);
297 double lwpoly_perimeter(const LWPOLY *poly);
298 double lwpoly_perimeter_2d(const LWPOLY *poly);
299 double lwcurvepoly_perimeter(const LWCURVEPOLY *poly);
300 double lwcurvepoly_perimeter_2d(const LWCURVEPOLY *poly);
301 double lwtriangle_perimeter(const LWTRIANGLE *triangle);
302 double lwtriangle_perimeter_2d(const LWTRIANGLE *triangle);
303 
304 /*
305 * Segmentization
306 */
307 LWPOLY *lwcurvepoly_stroke(const LWCURVEPOLY *curvepoly, uint32_t perQuad);
308 
309 /*
310 * Affine
311 */
312 void ptarray_affine(POINTARRAY *pa, const AFFINE *affine);
313 void affine_invert(AFFINE *affine);
314 
315 /*
316 * Scale
317 */
318 void ptarray_scale(POINTARRAY *pa, const POINT4D *factor);
319 
320 /*
321 * Scroll
322 */
323 int ptarray_scroll_in_place(POINTARRAY *pa, const POINT4D *newbase);
324 
325 /*
326 * PointArray
327 */
328 int ptarray_has_z(const POINTARRAY *pa);
329 int ptarray_has_m(const POINTARRAY *pa);
330 double ptarray_signed_area(const POINTARRAY *pa);
331 
332 /*
333 * Length
334 */
335 double ptarray_length(const POINTARRAY *pts);
336 double ptarray_arc_length_2d(const POINTARRAY *pts);
337 
338 /*
339 * Clone support
340 */
341 LWPOINT *lwpoint_clone(const LWPOINT *lwgeom);
342 LWLINE *lwline_clone(const LWLINE *lwgeom);
343 LWPOLY *lwpoly_clone(const LWPOLY *lwgeom);
344 LWTRIANGLE *lwtriangle_clone(const LWTRIANGLE *lwgeom);
347 POINTARRAY *ptarray_clone(const POINTARRAY *ptarray);
348 LWLINE *lwline_clone_deep(const LWLINE *lwgeom);
349 LWPOLY *lwpoly_clone_deep(const LWPOLY *lwgeom);
351 GBOX *gbox_clone(const GBOX *gbox);
352 
353 /*
354 * Clockwise
355 */
356 void lwpoly_force_clockwise(LWPOLY *poly);
357 void lwtriangle_force_clockwise(LWTRIANGLE *triangle);
358 int lwpoly_is_clockwise(LWPOLY *poly);
359 int lwtriangle_is_clockwise(LWTRIANGLE *triangle);
360 int ptarray_isccw(const POINTARRAY *pa);
361 
362 /*
363 * Same
364 */
365 char ptarray_same2d(const POINTARRAY *pa1, const POINTARRAY *pa2);
366 char ptarray_same(const POINTARRAY *pa1, const POINTARRAY *pa2);
367 char lwpoint_same2d(const LWPOINT *p1, const LWPOINT *p2);
368 char lwpoint_same(const LWPOINT *p1, const LWPOINT *p2);
369 char lwline_same(const LWLINE *p1, const LWLINE *p2);
370 char lwpoly_same(const LWPOLY *p1, const LWPOLY *p2);
371 char lwtriangle_same(const LWTRIANGLE *p1, const LWTRIANGLE *p2);
372 char lwcollection_same(const LWCOLLECTION *p1, const LWCOLLECTION *p2);
373 char lwcircstring_same(const LWCIRCSTRING *p1, const LWCIRCSTRING *p2);
374 
375 /*
376 * Shift
377 */
379 
380 /*
381 * Support for in place modification of point arrays, fast
382 * function to move coordinate values around
383 */
384 void ptarray_copy_point(POINTARRAY *pa, uint32_t from, uint32_t to);
385 
386 /*
387 * Reverse
388 */
390 
391 /*
392 * Startpoint
393 */
394 int lwpoly_startpoint(const LWPOLY* lwpoly, POINT4D* pt);
395 int ptarray_startpoint(const POINTARRAY* pa, POINT4D* pt);
396 int lwcollection_startpoint(const LWCOLLECTION* col, POINT4D* pt);
397 
398 /*
399  * Write into *ret the coordinates of the closest point on
400  * segment A-B to the reference input point R
401  */
402 void closest_point_on_segment(const POINT4D *R, const POINT4D *A, const POINT4D *B, POINT4D *ret);
403 
404 /*
405 * Repeated points
406 */
407 POINTARRAY *ptarray_remove_repeated_points(const POINTARRAY *in, double tolerance);
408 LWGEOM* lwline_remove_repeated_points(const LWLINE *in, double tolerance);
409 void ptarray_remove_repeated_points_in_place(POINTARRAY *pa, double tolerance, uint32_t min_points);
410 
411 /*
412 * Closure test
413 */
414 int lwline_is_closed(const LWLINE *line);
415 int lwpoly_is_closed(const LWPOLY *poly);
416 int lwcircstring_is_closed(const LWCIRCSTRING *curve);
417 int lwcompound_is_closed(const LWCOMPOUND *curve);
418 int lwpsurface_is_closed(const LWPSURFACE *psurface);
419 int lwtin_is_closed(const LWTIN *tin);
420 
424 void ptarray_grid_in_place(POINTARRAY *pa, const gridspec *grid);
425 
426 /*
427 * What side of the line formed by p1 and p2 does q fall?
428 * Returns -1 for left and 1 for right and 0 for co-linearity
429 */
430 int lw_segment_side(const POINT2D *p1, const POINT2D *p2, const POINT2D *q);
431 int lw_arc_side(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3, const POINT2D *Q);
432 int lw_arc_calculate_gbox_cartesian_2d(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3, GBOX *gbox);
433 double lw_arc_center(const POINT2D *p1, const POINT2D *p2, const POINT2D *p3, POINT2D *result);
434 int lw_pt_in_seg(const POINT2D *P, const POINT2D *A1, const POINT2D *A2);
435 int lw_pt_in_arc(const POINT2D *P, const POINT2D *A1, const POINT2D *A2, const POINT2D *A3);
436 int lw_arc_is_pt(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3);
437 double lw_seg_length(const POINT2D *A1, const POINT2D *A2);
438 double lw_arc_length(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3);
439 int pt_in_ring_2d(const POINT2D *p, const POINTARRAY *ring);
440 int ptarray_contains_point(const POINTARRAY *pa, const POINT2D *pt);
441 int ptarrayarc_contains_point(const POINTARRAY *pa, const POINT2D *pt);
442 int ptarray_contains_point_partial(const POINTARRAY *pa, const POINT2D *pt, int check_closed, int *winding_number);
443 int ptarrayarc_contains_point_partial(const POINTARRAY *pa, const POINT2D *pt, int check_closed, int *winding_number);
444 int lwcompound_contains_point(const LWCOMPOUND *comp, const POINT2D *pt);
445 int lwgeom_contains_point(const LWGEOM *geom, const POINT2D *pt);
446 
457 int lwline_split_by_point_to(const LWLINE* ln, const LWPOINT* pt, LWMLINE* to);
458 
460 void lwcollection_reserve(LWCOLLECTION *col, uint32_t ngeoms);
461 
463 int lwcollection_allows_subtype(int collectiontype, int subtype);
464 
466 double gbox_angular_height(const GBOX* gbox);
467 double gbox_angular_width(const GBOX* gbox);
468 int gbox_centroid(const GBOX* gbox, POINT2D* out);
469 
470 /* Utilities */
471 int lwprint_double(double d, int maxdd, char *buf);
472 extern uint8_t MULTITYPE[NUMTYPES];
473 
475 extern int _lwgeom_interrupt_requested;
476 #define LW_ON_INTERRUPT(x) { \
477  if ( _lwgeom_interrupt_callback ) { \
478  (*_lwgeom_interrupt_callback)(); \
479  } \
480  if ( _lwgeom_interrupt_requested ) { \
481  _lwgeom_interrupt_requested = 0; \
482  lwnotice("liblwgeom code interrupted"); \
483  x; \
484  } \
485 }
486 
487 int ptarray_npoints_in_rect(const POINTARRAY *pa, const GBOX *gbox);
488 int gbox_contains_point2d(const GBOX *g, const POINT2D *p);
489 int lwpoly_contains_point(const LWPOLY *poly, const POINT2D *pt);
490 POINT4D* lwmpoint_extract_points_4d(const LWMPOINT* g, uint32_t* npoints, int* input_empty);
491 char* lwstrdup(const char* a);
492 
493 #endif /* _LIBLWGEOM_INTERNAL_H */
static uint8_t precision
Definition: cu_in_twkb.c:25
char result[OUT_DOUBLE_BUFFER_SIZE]
Definition: cu_print.c:262
void() lwinterrupt_callback()
Install a callback to be called periodically during algorithm execution.
Definition: liblwgeom.h:291
#define NUMTYPES
Definition: liblwgeom.h:118
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:759
POINTARRAY * ptarray_force_dims(const POINTARRAY *pa, int hasz, int hasm, double zval, double mval)
Definition: ptarray.c:1056
char * lwstrdup(const char *a)
Definition: lwutil.c:248
size_t gserialized_from_lwgeom_size(const LWGEOM *geom)
Calculate required memory segment to contain a serialized form of the LWGEOM.
Definition: gserialized.c:230
double lwline_length_2d(const LWLINE *line)
Definition: lwline.c:520
void ptarray_longitude_shift(POINTARRAY *pa)
Longitude shift for a pointarray.
Definition: ptarray.c:1498
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:109
int lwgeom_geohash_precision(GBOX bbox, GBOX *bounds)
Definition: lwalgorithm.c:763
double lwcircstring_length_2d(const LWCIRCSTRING *circ)
Definition: lwcircstring.c:274
LWPOINT * lwpoint_clone(const LWPOINT *lwgeom)
Definition: lwpoint.c:239
lwinterrupt_callback * _lwgeom_interrupt_callback
Definition: lwgeom_api.c:671
LWGEOM * lwline_remove_repeated_points(const LWLINE *in, double tolerance)
Definition: lwline.c:439
int lwcircstring_is_closed(const LWCIRCSTRING *curve)
Definition: lwcircstring.c:261
void ptarray_reverse_in_place(POINTARRAY *pa)
Definition: ptarray.c:331
LWLINE * lwline_clone(const LWLINE *lwgeom)
Definition: lwline.c:93
char lwcollection_same(const LWCOLLECTION *p1, const LWCOLLECTION *p2)
check for same geometry composition
Definition: lwcollection.c:279
int p4d_same(const POINT4D *p1, const POINT4D *p2)
Definition: lwalgorithm.c:32
int ptarrayarc_contains_point(const POINTARRAY *pa, const POINT2D *pt)
For POINTARRAYs representing CIRCULARSTRINGS.
Definition: ptarray.c:852
double lwtriangle_area(const LWTRIANGLE *triangle)
Find the area of the outer ring.
Definition: lwtriangle.c:178
int p3d_same(const POINT3D *p1, const POINT3D *p2)
Definition: lwalgorithm.c:41
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:116
double lwcompound_length_2d(const LWCOMPOUND *comp)
Definition: lwcompound.c:74
int lwline_is_empty(const LWLINE *line)
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:1860
lwvarlena_t * geohash_point(double longitude, double latitude, int precision)
Definition: lwalgorithm.c:595
double ptarray_signed_area(const POINTARRAY *pa)
Returns the area in cartesian units.
Definition: ptarray.c:1016
int lwline_is_closed(const LWLINE *line)
Definition: lwline.c:445
uint32_t lwline_count_vertices(const LWLINE *line)
Definition: lwline.c:505
char lwtriangle_same(const LWTRIANGLE *p1, const LWTRIANGLE *p2)
Definition: lwtriangle.c:126
int lwpoly_startpoint(const LWPOLY *lwpoly, POINT4D *pt)
Definition: lwpoly.c:524
LWPOINT * lwpoint_force_dims(const LWPOINT *lwpoint, int hasz, int hasm, double zval, double mval)
Definition: lwpoint.c:304
POINTARRAY * ptarray_clone(const POINTARRAY *ptarray)
Clone a POINTARRAY object.
Definition: ptarray.c:678
int lwcollection_startpoint(const LWCOLLECTION *col, POINT4D *pt)
Definition: lwcollection.c:550
int _lwgeom_interrupt_requested
Definition: lwgeom_api.c:661
int ptarray_startpoint(const POINTARRAY *pa, POINT4D *pt)
Definition: ptarray.c:2076
int lwcompound_is_closed(const LWCOMPOUND *curve)
Definition: lwcompound.c:35
int gbox_contains_point2d(const GBOX *g, const POINT2D *p)
Definition: gbox.c:350
double lwtriangle_perimeter_2d(const LWTRIANGLE *triangle)
Definition: lwtriangle.c:210
int ptarray_scroll_in_place(POINTARRAY *pa, const POINT4D *newbase)
Definition: ptarray.c:2181
int lwpoly_is_clockwise(LWPOLY *poly)
Definition: lwpoly.c:288
void ptarray_grid_in_place(POINTARRAY *pa, const gridspec *grid)
Snap to grid.
Definition: ptarray.c:2091
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:434
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:370
int lwtriangle_is_clockwise(LWTRIANGLE *triangle)
Definition: lwtriangle.c:113
char ptarray_same(const POINTARRAY *pa1, const POINTARRAY *pa2)
Definition: ptarray.c:476
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:141
void ptarray_remove_repeated_points_in_place(POINTARRAY *pa, double tolerance, uint32_t min_points)
Definition: ptarray.c:1535
double lwtriangle_perimeter(const LWTRIANGLE *triangle)
Definition: lwtriangle.c:201
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:226
int lwpoint_is_empty(const LWPOINT *point)
void ptarray_simplify_in_place(POINTARRAY *pa, double tolerance, uint32_t minpts)
Definition: ptarray.c:1713
int pt_in_ring_2d(const POINT2D *p, const POINTARRAY *ring)
Definition: lwalgorithm.c:279
LWLINE * lwline_force_dims(const LWLINE *lwline, int hasz, int hasm, double zval, double mval)
Definition: lwline.c:486
double lwcompound_length(const LWCOMPOUND *comp)
Definition: lwcompound.c:69
LWCOLLECTION * lwcollection_clone_deep(const LWCOLLECTION *lwgeom)
Deep clone LWCOLLECTION object.
Definition: lwcollection.c:150
LWCOLLECTION * lwcollection_force_dims(const LWCOLLECTION *lwcol, int hasz, int hasm, double zval, double mval)
Definition: lwcollection.c:476
char lwpoint_same2d(const LWPOINT *p1, const LWPOINT *p2)
Definition: lwpoint.c:271
int lw_arc_side(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3, const POINT2D *Q)
Definition: lwalgorithm.c:176
double lw_seg_length(const POINT2D *A1, const POINT2D *A2)
Returns the length of a linear segment.
Definition: lwalgorithm.c:72
void lwtriangle_force_clockwise(LWTRIANGLE *triangle)
Definition: lwtriangle.c:106
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:1805
POINTARRAY * ptarray_remove_repeated_points(const POINTARRAY *in, double tolerance)
Definition: ptarray.c:1528
int project_pt(const POINT2D *P, double distance, double azimuth, POINT2D *R)
Azimuth is angle in radians from vertical axis.
Definition: measures.c:2475
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:2058
void ptarray_affine(POINTARRAY *pa, const AFFINE *affine)
Affine transform a pointarray.
Definition: ptarray.c:1890
int lwpsurface_is_closed(const LWPSURFACE *psurface)
Definition: lwpsurface.c:99
int lwtriangle_is_empty(const LWTRIANGLE *triangle)
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:753
int ptarrayarc_contains_point_partial(const POINTARRAY *pa, const POINT2D *pt, int check_closed, int *winding_number)
Definition: ptarray.c:858
double lwcurvepoly_perimeter(const LWCURVEPOLY *poly)
Definition: lwcurvepoly.c:147
uint32_t lwpoly_count_vertices(const LWPOLY *poly)
Definition: lwpoly.c:418
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:93
int lwpoly_is_empty(const LWPOLY *poly)
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:1047
int ptarray_has_z(const POINTARRAY *pa)
Definition: ptarray.c:37
double lwline_length(const LWLINE *line)
Definition: lwline.c:513
int gserialized_peek_gbox_p(const GSERIALIZED *g, GBOX *gbox)
uint8_t MULTITYPE[NUMTYPES]
Look-up for the correct MULTI* type promotion for singleton types.
Definition: lwgeom.c:354
void lwcollection_reserve(LWCOLLECTION *col, uint32_t ngeoms)
Ensure the collection can hold at least up to ngeoms geometries.
Definition: lwcollection.c:175
void lwpoly_force_clockwise(LWPOLY *poly)
Definition: lwpoly.c:268
uint32_t lwcollection_count_vertices(const LWCOLLECTION *col)
Definition: lwcollection.c:500
void ptarray_swap_ordinates(POINTARRAY *pa, LWORD o1, LWORD o2)
Swap ordinate values o1 and o2 on a given POINTARRAY.
Definition: ptarray.c:379
int gserialized_read_gbox_p(const GSERIALIZED *g, GBOX *gbox)
Pull a GBOX from the header of a GSERIALIZED, if one is available.
LWPOLY * lwcurvepoly_stroke(const LWCURVEPOLY *curvepoly, uint32_t perQuad)
Definition: lwstroke.c:688
double lwpoly_perimeter_2d(const LWPOLY *poly)
Compute the sum of polygon rings length (forcing 2d computation).
Definition: lwpoly.c:485
int ptarray_npoints_in_rect(const POINTARRAY *pa, const GBOX *gbox)
Definition: ptarray.c:2158
int lw_segment_side(const POINT2D *p1, const POINT2D *p2, const POINT2D *q)
lw_segment_side()
Definition: lwalgorithm.c:62
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 project_pt_pt(const POINT4D *A, const POINT4D *B, double distance, POINT4D *R)
Azimuth is angle in radians from vertical axis.
Definition: measures.c:2499
char ptarray_same2d(const POINTARRAY *pa1, const POINTARRAY *pa2)
Definition: ptarray.c:501
int lwpoly_contains_point(const LWPOLY *poly, const POINT2D *pt)
Definition: lwpoly.c:532
void closest_point_on_segment(const POINT4D *R, const POINT4D *A, const POINT4D *B, POINT4D *ret)
Definition: ptarray.c:1276
GBOX * gbox_clone(const GBOX *gbox)
Definition: gbox.c:45
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:269
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:103
double lwcurvepoly_area(const LWCURVEPOLY *curvepoly)
This should be rewritten to make use of the curve itself.
Definition: lwcurvepoly.c:133
LWCOLLECTION * lwcollection_clone(const LWCOLLECTION *lwgeom)
Clone LWCOLLECTION object.
Definition: lwcollection.c:124
void decode_geohash_bbox(char *geohash, double *lat, double *lon, int precision)
Definition: lwalgorithm.c:718
int lwpoly_is_closed(const LWPOLY *poly)
Definition: lwpoly.c:499
int lwcollection_allows_subtype(int collectiontype, int subtype)
Check if subtype is allowed in collectiontype.
Definition: lwcollection.c:513
LWGEOM * lwgeom_force_dims(const LWGEOM *lwgeom, int hasz, int hasm, double zval, double mval)
Definition: lwgeom.c:817
LWPOLY * lwpoly_clone(const LWPOLY *lwgeom)
Definition: lwpoly.c:213
void ptarray_copy_point(POINTARRAY *pa, uint32_t from, uint32_t to)
Definition: lwgeom_api.c:394
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:83
int ptarray_has_m(const POINTARRAY *pa)
Definition: ptarray.c:44
int lwcircstring_is_empty(const LWCIRCSTRING *circ)
int lwcollection_is_empty(const LWCOLLECTION *col)
double lwcurvepoly_perimeter_2d(const LWCURVEPOLY *poly)
Definition: lwcurvepoly.c:159
int lwprint_double(double d, int maxdd, char *buf)
Definition: lwprint.c:457
double lwpoly_perimeter(const LWPOLY *poly)
Compute the sum of polygon rings length.
Definition: lwpoly.c:467
int lw_arc_calculate_gbox_cartesian_2d(const POINT2D *A1, const POINT2D *A2, const POINT2D *A3, GBOX *gbox)
Definition: gbox.c:453
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
LWPOLY * lwpoly_force_dims(const LWPOLY *lwpoly, int hasz, int hasm, double zval, double mval)
Definition: lwpoly.c:394
int p2d_same(const POINT2D *p1, const POINT2D *p2)
Definition: lwalgorithm.c:49
static double distance(double x1, double y1, double x2, double y2)
Definition: lwtree.c:1032
int value
Definition: genraster.py:62
Snap-to-grid.
Definition: liblwgeom.h:1375