forked from mysql/mysql-server
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathintersects.cc
706 lines (565 loc) · 23.8 KB
/
intersects.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
// Copyright (c) 2017, 2024, Oracle and/or its affiliates.
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License, version 2.0,
// as published by the Free Software Foundation.
//
// This program is designed to work with certain software (including
// but not limited to OpenSSL) that is licensed under separate terms,
// as designated in a particular file or component or in included license
// documentation. The authors of MySQL hereby grant you an additional
// permission to link the program and your derivative works with the
// separately licensed software that they have either included with
// the program or referenced in the documentation.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License, version 2.0, for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
/// @file
///
/// This file implements the intersects functor and function.
#include <boost/geometry.hpp>
#include "sql/dd/types/spatial_reference_system.h" // dd::Spatial_reference_system
#include "sql/gis/box.h"
#include "sql/gis/box_traits.h"
#include "sql/gis/disjoint_functor.h"
#include "sql/gis/geometries.h"
#include "sql/gis/geometries_traits.h"
#include "sql/gis/intersects_functor.h"
#include "sql/gis/mbr_utils.h"
#include "sql/gis/relops.h"
#include "sql/sql_exception_handler.h" // handle_gis_exception
namespace bg = boost::geometry;
namespace gis {
/// Apply an Intersects functor to two geometries, which both may be geometry
/// collections, and return the booelan result of the functor applied on each
/// combination of elements in the collections.
///
/// @tparam GC Coordinate specific gometry collection type.
///
/// @param f Functor to apply.
/// @param g1 First geometry.
/// @param g2 Second geometry.
///
/// @retval true g1 intersects g2.
/// @retval false g1 doesn't intersect g2.
template <typename GC>
static bool geometry_collection_apply_intersects(const Intersects &f,
const Geometry *g1,
const Geometry *g2) {
if (g1->type() == Geometry_type::kGeometrycollection) {
const auto gc1 = down_cast<const GC *>(g1);
for (const auto g1_i : *gc1)
if (geometry_collection_apply_intersects<GC>(f, g1_i, g2)) return true;
} else if (g2->type() == Geometry_type::kGeometrycollection) {
const auto gc2 = down_cast<const GC *>(g2);
for (const auto g2_j : *gc2)
if (geometry_collection_apply_intersects<GC>(f, g1, g2_j)) return true;
} else {
return f(g1, g2);
}
return false;
}
Intersects::Intersects(double semi_major, double semi_minor)
: m_semi_major(semi_major),
m_semi_minor(semi_minor),
m_geographic_pl_pa_strategy(
bg::srs::spheroid<double>(semi_major, semi_minor)),
m_geographic_ll_la_aa_strategy(
bg::srs::spheroid<double>(semi_major, semi_minor)) {}
bool Intersects::operator()(const Geometry *g1, const Geometry *g2) const {
return apply(*this, g1, g2);
}
bool Intersects::operator()(const Box *b1, const Box *b2) const {
assert(b1->coordinate_system() == b2->coordinate_system());
switch (b1->coordinate_system()) {
case Coordinate_system::kCartesian:
return eval(down_cast<const Cartesian_box *>(b1),
down_cast<const Cartesian_box *>(b2));
case Coordinate_system::kGeographic:
return eval(down_cast<const Geographic_box *>(b1),
down_cast<const Geographic_box *>(b2));
}
assert(false);
return false;
}
bool Intersects::eval(const Geometry *g1, const Geometry *g2) const {
// All parameter type combinations have been implemented.
assert(false);
throw not_implemented_exception::for_non_projected(*g1, *g2);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Cartesian_point, *)
bool Intersects::eval(const Cartesian_point *g1,
const Cartesian_point *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_point *g1,
const Cartesian_linestring *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_point *g1,
const Cartesian_polygon *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_point *g1,
const Cartesian_geometrycollection *g2) const {
return geometry_collection_apply_intersects<Cartesian_geometrycollection>(
*this, g1, g2);
}
bool Intersects::eval(const Cartesian_point *g1,
const Cartesian_multipoint *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_point *g1,
const Cartesian_multilinestring *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_point *g1,
const Cartesian_multipolygon *g2) const {
return bg::intersects(*g1, *g2);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Cartesian_linestring, *)
bool Intersects::eval(const Cartesian_linestring *g1,
const Cartesian_point *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_linestring *g1,
const Cartesian_linestring *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_linestring *g1,
const Cartesian_polygon *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_linestring *g1,
const Cartesian_geometrycollection *g2) const {
return geometry_collection_apply_intersects<Cartesian_geometrycollection>(
*this, g1, g2);
}
bool Intersects::eval(const Cartesian_linestring *g1,
const Cartesian_multipoint *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_linestring *g1,
const Cartesian_multilinestring *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_linestring *g1,
const Cartesian_multipolygon *g2) const {
return bg::intersects(*g1, *g2);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Cartesian_polygon, *)
bool Intersects::eval(const Cartesian_polygon *g1,
const Cartesian_point *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_polygon *g1,
const Cartesian_linestring *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_polygon *g1,
const Cartesian_polygon *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_polygon *g1,
const Cartesian_geometrycollection *g2) const {
return geometry_collection_apply_intersects<Cartesian_geometrycollection>(
*this, g1, g2);
}
bool Intersects::eval(const Cartesian_polygon *g1,
const Cartesian_multipoint *g2) const {
Disjoint disjoint(m_semi_major, m_semi_minor);
return !disjoint(g1, g2);
}
bool Intersects::eval(const Cartesian_polygon *g1,
const Cartesian_multilinestring *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_polygon *g1,
const Cartesian_multipolygon *g2) const {
return bg::intersects(*g1, *g2);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Cartesian_geometrycollection, *)
bool Intersects::eval(const Cartesian_geometrycollection *g1,
const Geometry *g2) const {
return geometry_collection_apply_intersects<Cartesian_geometrycollection>(
*this, g1, g2);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Cartesian_multipoint, *)
bool Intersects::eval(const Cartesian_multipoint *g1,
const Cartesian_point *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multipoint *g1,
const Cartesian_linestring *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multipoint *g1,
const Cartesian_polygon *g2) const {
Disjoint disjoint(m_semi_major, m_semi_minor);
return !disjoint(g1, g2);
}
bool Intersects::eval(const Cartesian_multipoint *g1,
const Cartesian_geometrycollection *g2) const {
return geometry_collection_apply_intersects<Cartesian_geometrycollection>(
*this, g1, g2);
}
bool Intersects::eval(const Cartesian_multipoint *g1,
const Cartesian_multipoint *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multipoint *g1,
const Cartesian_multilinestring *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multipoint *g1,
const Cartesian_multipolygon *g2) const {
Disjoint disjoint(m_semi_major, m_semi_minor);
return !disjoint(g1, g2);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Cartesian_multilinestring, *)
bool Intersects::eval(const Cartesian_multilinestring *g1,
const Cartesian_point *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multilinestring *g1,
const Cartesian_linestring *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multilinestring *g1,
const Cartesian_polygon *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multilinestring *g1,
const Cartesian_geometrycollection *g2) const {
return geometry_collection_apply_intersects<Cartesian_geometrycollection>(
*this, g1, g2);
}
bool Intersects::eval(const Cartesian_multilinestring *g1,
const Cartesian_multipoint *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multilinestring *g1,
const Cartesian_multilinestring *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multilinestring *g1,
const Cartesian_multipolygon *g2) const {
return bg::intersects(*g1, *g2);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Cartesian_multipolygon, *)
bool Intersects::eval(const Cartesian_multipolygon *g1,
const Cartesian_point *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multipolygon *g1,
const Cartesian_linestring *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multipolygon *g1,
const Cartesian_polygon *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multipolygon *g1,
const Cartesian_geometrycollection *g2) const {
return geometry_collection_apply_intersects<Cartesian_geometrycollection>(
*this, g1, g2);
}
bool Intersects::eval(const Cartesian_multipolygon *g1,
const Cartesian_multipoint *g2) const {
Disjoint disjoint(m_semi_major, m_semi_minor);
return !disjoint(g1, g2);
}
bool Intersects::eval(const Cartesian_multipolygon *g1,
const Cartesian_multilinestring *g2) const {
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Cartesian_multipolygon *g1,
const Cartesian_multipolygon *g2) const {
return bg::intersects(*g1, *g2);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Geographic_point, *)
bool Intersects::eval(const Geographic_point *g1,
const Geographic_point *g2) const {
// Default strategy is OK. P/P computations do not depend on shape of
// ellipsoid.
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Geographic_point *g1,
const Geographic_linestring *g2) const {
return bg::intersects(*g1, *g2, m_geographic_pl_pa_strategy);
}
bool Intersects::eval(const Geographic_point *g1,
const Geographic_polygon *g2) const {
return bg::intersects(*g1, *g2, m_geographic_pl_pa_strategy);
}
bool Intersects::eval(const Geographic_point *g1,
const Geographic_geometrycollection *g2) const {
return geometry_collection_apply_intersects<Geographic_geometrycollection>(
*this, g1, g2);
}
bool Intersects::eval(const Geographic_point *g1,
const Geographic_multipoint *g2) const {
// Default strategy is OK. P/P computations do not depend on shape of
// ellipsoid.
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Geographic_point *g1,
const Geographic_multilinestring *g2) const {
return bg::intersects(*g1, *g2, m_geographic_pl_pa_strategy);
}
bool Intersects::eval(const Geographic_point *g1,
const Geographic_multipolygon *g2) const {
return bg::intersects(*g1, *g2, m_geographic_pl_pa_strategy);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Geographic_linestring, *)
bool Intersects::eval(const Geographic_linestring *g1,
const Geographic_point *g2) const {
return bg::intersects(*g1, *g2, m_geographic_pl_pa_strategy);
}
bool Intersects::eval(const Geographic_linestring *g1,
const Geographic_linestring *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
bool Intersects::eval(const Geographic_linestring *g1,
const Geographic_polygon *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
bool Intersects::eval(const Geographic_linestring *g1,
const Geographic_geometrycollection *g2) const {
return geometry_collection_apply_intersects<Geographic_geometrycollection>(
*this, g1, g2);
}
bool Intersects::eval(const Geographic_linestring *g1,
const Geographic_multipoint *g2) const {
return bg::intersects(*g1, *g2, m_geographic_pl_pa_strategy);
}
bool Intersects::eval(const Geographic_linestring *g1,
const Geographic_multilinestring *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
bool Intersects::eval(const Geographic_linestring *g1,
const Geographic_multipolygon *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Geographic_polygon, *)
bool Intersects::eval(const Geographic_polygon *g1,
const Geographic_point *g2) const {
return bg::intersects(*g1, *g2, m_geographic_pl_pa_strategy);
}
bool Intersects::eval(const Geographic_polygon *g1,
const Geographic_linestring *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
bool Intersects::eval(const Geographic_polygon *g1,
const Geographic_polygon *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
bool Intersects::eval(const Geographic_polygon *g1,
const Geographic_geometrycollection *g2) const {
return geometry_collection_apply_intersects<Geographic_geometrycollection>(
*this, g1, g2);
}
bool Intersects::eval(const Geographic_polygon *g1,
const Geographic_multipoint *g2) const {
Disjoint disjoint(m_semi_major, m_semi_minor);
return !disjoint(g1, g2);
}
bool Intersects::eval(const Geographic_polygon *g1,
const Geographic_multilinestring *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
bool Intersects::eval(const Geographic_polygon *g1,
const Geographic_multipolygon *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Geographic_geometrycollection, *)
bool Intersects::eval(const Geographic_geometrycollection *g1,
const Geometry *g2) const {
return geometry_collection_apply_intersects<Geographic_geometrycollection>(
*this, g1, g2);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Geographic_multipoint, *)
bool Intersects::eval(const Geographic_multipoint *g1,
const Geographic_point *g2) const {
// Default strategy is OK. P/P computations do not depend on shape of
// ellipsoid.
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Geographic_multipoint *g1,
const Geographic_linestring *g2) const {
return bg::intersects(*g1, *g2, m_geographic_pl_pa_strategy);
}
bool Intersects::eval(const Geographic_multipoint *g1,
const Geographic_polygon *g2) const {
Disjoint disjoint(m_semi_major, m_semi_minor);
return !disjoint(g1, g2);
}
bool Intersects::eval(const Geographic_multipoint *g1,
const Geographic_geometrycollection *g2) const {
return geometry_collection_apply_intersects<Geographic_geometrycollection>(
*this, g1, g2);
}
bool Intersects::eval(const Geographic_multipoint *g1,
const Geographic_multipoint *g2) const {
// Default strategy is OK. P/P computations do not depend on shape of
// ellipsoid.
return bg::intersects(*g1, *g2);
}
bool Intersects::eval(const Geographic_multipoint *g1,
const Geographic_multilinestring *g2) const {
return bg::intersects(*g1, *g2, m_geographic_pl_pa_strategy);
}
bool Intersects::eval(const Geographic_multipoint *g1,
const Geographic_multipolygon *g2) const {
Disjoint disjoint(m_semi_major, m_semi_minor);
return !disjoint(g1, g2);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Geographic_multilinestring, *)
bool Intersects::eval(const Geographic_multilinestring *g1,
const Geographic_point *g2) const {
return bg::intersects(*g1, *g2, m_geographic_pl_pa_strategy);
}
bool Intersects::eval(const Geographic_multilinestring *g1,
const Geographic_linestring *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
bool Intersects::eval(const Geographic_multilinestring *g1,
const Geographic_polygon *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
bool Intersects::eval(const Geographic_multilinestring *g1,
const Geographic_geometrycollection *g2) const {
return geometry_collection_apply_intersects<Geographic_geometrycollection>(
*this, g1, g2);
}
bool Intersects::eval(const Geographic_multilinestring *g1,
const Geographic_multipoint *g2) const {
return bg::intersects(*g1, *g2, m_geographic_pl_pa_strategy);
}
bool Intersects::eval(const Geographic_multilinestring *g1,
const Geographic_multilinestring *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
bool Intersects::eval(const Geographic_multilinestring *g1,
const Geographic_multipolygon *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Geographic_multipolygon, *)
bool Intersects::eval(const Geographic_multipolygon *g1,
const Geographic_point *g2) const {
return bg::intersects(*g1, *g2, m_geographic_pl_pa_strategy);
}
bool Intersects::eval(const Geographic_multipolygon *g1,
const Geographic_linestring *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
bool Intersects::eval(const Geographic_multipolygon *g1,
const Geographic_polygon *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
bool Intersects::eval(const Geographic_multipolygon *g1,
const Geographic_geometrycollection *g2) const {
return geometry_collection_apply_intersects<Geographic_geometrycollection>(
*this, g1, g2);
}
bool Intersects::eval(const Geographic_multipolygon *g1,
const Geographic_multipoint *g2) const {
Disjoint disjoint(m_semi_major, m_semi_minor);
return !disjoint(g1, g2);
}
bool Intersects::eval(const Geographic_multipolygon *g1,
const Geographic_multilinestring *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
bool Intersects::eval(const Geographic_multipolygon *g1,
const Geographic_multipolygon *g2) const {
return bg::intersects(*g1, *g2, m_geographic_ll_la_aa_strategy);
}
//////////////////////////////////////////////////////////////////////////////
// intersects(Box, Box)
bool Intersects::eval(const Cartesian_box *b1, const Cartesian_box *b2) const {
return bg::intersects(*b1, *b2);
}
bool Intersects::eval(const Geographic_box *b1,
const Geographic_box *b2) const {
return bg::intersects(*b1, *b2);
}
//////////////////////////////////////////////////////////////////////////////
bool intersects(const dd::Spatial_reference_system *srs, const Geometry *g1,
const Geometry *g2, const char *func_name, bool *intersects,
bool *null) noexcept {
try {
assert(g1->coordinate_system() == g2->coordinate_system());
assert(srs == nullptr ||
((srs->is_cartesian() &&
g1->coordinate_system() == Coordinate_system::kCartesian) ||
(srs->is_geographic() &&
g1->coordinate_system() == Coordinate_system::kGeographic)));
if ((*null = (g1->is_empty() || g2->is_empty()))) return false;
Intersects intersects_func(srs ? srs->semi_major_axis() : 0.0,
srs ? srs->semi_minor_axis() : 0.0);
*intersects = intersects_func(g1, g2);
} catch (...) {
handle_gis_exception(func_name);
return true;
}
return false;
}
bool mbr_intersects(const dd::Spatial_reference_system *srs, const Geometry *g1,
const Geometry *g2, const char *func_name, bool *intersects,
bool *null) noexcept {
try {
assert(g1->coordinate_system() == g2->coordinate_system());
assert(srs == nullptr ||
((srs->is_cartesian() &&
g1->coordinate_system() == Coordinate_system::kCartesian) ||
(srs->is_geographic() &&
g1->coordinate_system() == Coordinate_system::kGeographic)));
if ((*null = (g1->is_empty() || g2->is_empty()))) return false;
Intersects intersects_func(srs ? srs->semi_major_axis() : 0.0,
srs ? srs->semi_minor_axis() : 0.0);
switch (g1->coordinate_system()) {
case Coordinate_system::kCartesian: {
Cartesian_box mbr1;
box_envelope(g1, srs, &mbr1);
Cartesian_box mbr2;
box_envelope(g2, srs, &mbr2);
*intersects = intersects_func(&mbr1, &mbr2);
break;
}
case Coordinate_system::kGeographic: {
Geographic_box mbr1;
box_envelope(g1, srs, &mbr1);
Geographic_box mbr2;
box_envelope(g2, srs, &mbr2);
*intersects = intersects_func(&mbr1, &mbr2);
break;
}
}
} catch (...) {
handle_gis_exception(func_name);
return true;
}
return false;
}
} // namespace gis