{{ message }}
Repository navigation
Expand file tree
/
Copy pathis_valid.cpp
More file actions
1894 lines (1655 loc) · 143 KB
/
Copy pathis_valid.cpp
File metadata and controls
1894 lines (1655 loc) · 143 KB
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
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Boost.Geometry (aka GGL, Generic Geometry Library)
// Unit Test
// Copyright (c) 2014-2025, Oracle and/or its affiliates.
// Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
// Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
// Licensed under the Boost Software License version 1.0.
// http://www.boost.org/users/license.html
#ifndef BOOST_TEST_MODULE
#define BOOST_TEST_MODULE test_is_valid
#endif
//#define BOOST_GEOMETRY_ALLOW_INCONSISTENT_ORIENTATION
#include <limits>
#include <iostream>
#include <type_traits>
#include <boost/test/included/unit_test.hpp>
#if defined(TEST_WITH_SVG)
# include <boost/geometry/io/svg/svg_mapper.hpp>
#else
# include <boost/core/ignore_unused.hpp>
#endif
#include "geometry_test_common.hpp"
#include "test_is_valid.hpp"
#include "overlay/overlay_cases.hpp"
#include <boost/geometry/core/coordinate_type.hpp>
#include <boost/geometry/algorithms/correct.hpp>
#include <boost/geometry/algorithms/intersection.hpp>
#include <boost/geometry/algorithms/reverse.hpp>
#include <boost/geometry/geometries/geometry_collection.hpp>
#include <boost/geometry/geometries/polyhedral_surface.hpp>
template <typename Geometry>
void geometry_to_svg(Geometry const& geometry, const std::string& case_id)
{
#if defined(TEST_WITH_SVG)
{
using point_type = typename bg::point_type<Geometry>::type;
std::ostringstream filename;
filename << "/tmp/svg/" << case_id << ".svg";
std::ofstream svg(filename.str().c_str());
bg::svg_mapper<point_type> mapper(svg, 1200, 800);
mapper.add(geometry);
mapper.map(geometry, "fill-opacity:0.5;fill:rgb(153,204,0);"
"stroke:rgb(153,204,0);stroke-width:1");
// Get self-turns and map them
using turn_info = bg::detail::overlay::turn_info
<
point_type,
typename bg::segment_ratio_type<point_type>::type
>;
using strategy_type = typename bg::strategies::relate::services::default_strategy
<
Geometry, Geometry
>::type;
strategy_type strategy;
std::vector<turn_info> turns;
bg::detail::self_get_turn_points::no_interrupt_policy policy;
bg::self_turns
<
bg::detail::overlay::assign_null_policy
>(geometry, strategy, turns, policy);
for (turn_info const& turn : turns)
{
if (turn.method == bg::detail::overlay::method_none)
{
continue;
}
mapper.map(turn.point, "fill:rgb(255,128,0);stroke:rgb(0,0,100);stroke-width:1", 2);
std::ostringstream out;
out << bg::method_char(turn.method)
<< std::setprecision(16) << " " << bg::get<0>(turn.point) << " " << bg::get<1>(turn.point);
mapper.text(turn.point, out.str(), "fill:rgb(0,0,0);font-family:Arial;font-size:10px", 5, 5);
}
}
#else
boost::ignore_unused(geometry, case_id);
#endif
}
BOOST_AUTO_TEST_CASE( test_is_valid_point )
{
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << std::endl << std::endl;
std::cout << "************************************" << std::endl;
std::cout << " is_valid: POINT " << std::endl;
std::cout << "************************************" << std::endl;
#endif
typedef point_type G;
typedef default_validity_tester tester;
typedef test_valid<tester, G> test;
test::apply("p01", "POINT(0 0)", true);
}
BOOST_AUTO_TEST_CASE( test_is_valid_multipoint )
{
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << std::endl << std::endl;
std::cout << "************************************" << std::endl;
std::cout << " is_valid: MULTIPOINT " << std::endl;
std::cout << "************************************" << std::endl;
#endif
typedef multi_point_type G;
typedef default_validity_tester tester;
typedef test_valid<tester, G> test;
test::apply("mp01", "MULTIPOINT()", true);
test::apply("mp02", "MULTIPOINT(0 0,0 0)", true);
test::apply("mp03", "MULTIPOINT(0 0,1 0,1 1,0 1)", true);
test::apply("mp04", "MULTIPOINT(0 0,1 0,1 1,1 0,0 1)", true);
}
BOOST_AUTO_TEST_CASE( test_is_valid_segment )
{
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << std::endl << std::endl;
std::cout << "************************************" << std::endl;
std::cout << " is_valid: SEGMENT " << std::endl;
std::cout << "************************************" << std::endl;
#endif
typedef segment_type G;
typedef default_validity_tester tester;
typedef test_valid<tester, G> test;
test::apply("s01", "SEGMENT(0 0,0 0)", false);
test::apply("s02", "SEGMENT(0 0,1 0)", true);
}
BOOST_AUTO_TEST_CASE( test_is_valid_box )
{
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << std::endl << std::endl;
std::cout << "************************************" << std::endl;
std::cout << " is_valid: BOX " << std::endl;
std::cout << "************************************" << std::endl;
#endif
typedef box_type G;
typedef default_validity_tester tester;
typedef test_valid<tester, G> test;
// boxes where the max corner and below and/or to the left of min corner
test::apply("b01", "BOX(0 0,-1 0)", false);
test::apply("b02", "BOX(0 0,0 -1)", false);
test::apply("b03", "BOX(0 0,-1 -1)", false);
// boxes of zero area; they are not 2-dimensional, so invalid
test::apply("b04", "BOX(0 0,0 0)", false);
test::apply("b05", "BOX(0 0,1 0)", false);
test::apply("b06", "BOX(0 0,0 1)", false);
test::apply("b07", "BOX(0 0,1 1)", true);
}
template <typename G, bool AllowSpikes>
void test_linestrings()
{
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << "SPIKES ALLOWED? "
<< std::boolalpha
<< AllowSpikes
<< std::noboolalpha
<< std::endl;
#endif
typedef validity_tester_linear<AllowSpikes> tester;
typedef test_valid<tester, G> test;
// empty linestring
test::apply("l01", "LINESTRING()", false);
// 1-point linestrings
test::apply("l02", "LINESTRING(0 0)", false);
test::apply("l03", "LINESTRING(0 0,0 0)", false);
test::apply("l04", "LINESTRING(0 0,0 0,0 0)", false);
// 2-point linestrings
test::apply("l05", "LINESTRING(0 0,1 2)", true);
test::apply("l06", "LINESTRING(0 0,1 2,1 2)", true);
test::apply("l07", "LINESTRING(0 0,0 0,1 2,1 2)", true);
test::apply("l08", "LINESTRING(0 0,0 0,0 0,1 2,1 2)", true);
// 3-point linestrings
test::apply("l09", "LINESTRING(0 0,1 0,2 10)", true);
test::apply("l10", "LINESTRING(0 0,1 0,2 10,0 0)", true);
test::apply("l11", "LINESTRING(0 0,10 0,10 10,5 0)", true);
// linestrings with spikes
test::apply("l12", "LINESTRING(0 0,1 2,0 0)", AllowSpikes);
test::apply("l13", "LINESTRING(0 0,1 2,1 2,0 0)", AllowSpikes);
test::apply("l14", "LINESTRING(0 0,0 0,1 2,1 2,0 0)", AllowSpikes);
test::apply("l15", "LINESTRING(0 0,0 0,0 0,1 2,1 2,0 0,0 0)", AllowSpikes);
test::apply("l16", "LINESTRING(0 0,10 0,5 0)", AllowSpikes);
test::apply("l17", "LINESTRING(0 0,10 0,10 10,5 0,0 0)", AllowSpikes);
test::apply("l18", "LINESTRING(0 0,10 0,10 10,5 0,4 0,6 0)", AllowSpikes);
test::apply("l19", "LINESTRING(0 0,1 0,1 1,5 5,4 4)", AllowSpikes);
test::apply("l20", "LINESTRING(0 0,1 0,1 1,5 5,4 4,6 6)", AllowSpikes);
test::apply("l21", "LINESTRING(0 0,1 0,1 1,5 5,4 4,4 0)", AllowSpikes);
test::apply("l22",
"LINESTRING(0 0,0 0,1 0,1 0,1 0,0 0,0 0,2 0)",
AllowSpikes);
test::apply("l23",
"LINESTRING(0 0,1 0,0 0,2 0,0 0,3 0,0 0,4 0)",
AllowSpikes);
test::apply("l24",
"LINESTRING(0 0,1 0,0 0,2 0,0 0,3 0,0 0,4 0,0 0)",
AllowSpikes);
// other examples
test::apply("l25", "LINESTRING(0 0,10 0,10 10,5 0,4 0)", true);
test::apply("l26", "LINESTRING(0 0,10 0,10 10,5 0,4 0,3 0)", true);
test::apply("l27", "LINESTRING(0 0,10 0,10 10,5 0,4 0,-1 0)", true);
test::apply("l28", "LINESTRING(0 0,1 0,1 1,-1 1,-1 0,0 0)", true);
test::apply("l29", "LINESTRING(0 0,1 0,1 1,-1 1,-1 0,0.5 0)", true);
}
BOOST_AUTO_TEST_CASE( test_is_valid_linestring )
{
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << std::endl << std::endl;
std::cout << "************************************" << std::endl;
std::cout << " is_valid: LINESTRING " << std::endl;
std::cout << "************************************" << std::endl;
#endif
bool const allow_spikes = true;
bool const do_not_allow_spikes = !allow_spikes;
test_linestrings<linestring_type, allow_spikes>();
test_linestrings<linestring_type, do_not_allow_spikes>();
}
template <typename G, bool AllowSpikes>
void test_multilinestrings()
{
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << "SPIKES ALLOWED? "
<< std::boolalpha
<< AllowSpikes
<< std::noboolalpha
<< std::endl;
#endif
typedef validity_tester_linear<AllowSpikes> tester;
typedef test_valid<tester, G> test;
// empty multilinestring
test::apply("mls01", "MULTILINESTRING()", true);
// multilinestring with empty linestring(s)
test::apply("mls02", "MULTILINESTRING(())", false);
test::apply("mls03", "MULTILINESTRING((),(),())", false);
test::apply("mls04", "MULTILINESTRING((),(0 1,1 0))", false);
// multilinestring with invalid linestrings
test::apply("mls05", "MULTILINESTRING((0 0),(0 1,1 0))", false);
test::apply("mls06", "MULTILINESTRING((0 0,0 0),(0 1,1 0))", false);
test::apply("mls07", "MULTILINESTRING((0 0),(1 0))", false);
test::apply("mls08", "MULTILINESTRING((0 0,0 0),(1 0,1 0))", false);
test::apply("mls09", "MULTILINESTRING((0 0),(0 0))", false);
test::apply("mls10", "MULTILINESTRING((0 0,1 0,0 0),(5 0))", false);
// multilinstring that has linestrings with spikes
test::apply("mls11",
"MULTILINESTRING((0 0,1 0,0 0),(5 0,1 0,4 1))",
AllowSpikes);
test::apply("mls12",
"MULTILINESTRING((0 0,1 0,0 0),(1 0,2 0))",
AllowSpikes);
// valid multilinestrings
test::apply("mls13", "MULTILINESTRING((0 0,1 0,2 0),(5 0,1 0,4 1))", true);
test::apply("mls14", "MULTILINESTRING((0 0,1 0,2 0),(1 0,2 0))", true);
test::apply("mls15", "MULTILINESTRING((0 0,1 1),(0 1,1 0))", true);
test::apply("mls16", "MULTILINESTRING((0 0,1 1,2 2),(0 1,1 0,2 2))", true);
}
BOOST_AUTO_TEST_CASE( test_is_valid_multilinestring )
{
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << std::endl << std::endl;
std::cout << "************************************" << std::endl;
std::cout << " is_valid: MULTILINESTRING " << std::endl;
std::cout << "************************************" << std::endl;
#endif
bool const allow_spikes = true;
bool const do_not_allow_spikes = !allow_spikes;
test_multilinestrings<multi_linestring_type, allow_spikes>();
test_multilinestrings<multi_linestring_type, do_not_allow_spikes>();
}
template <typename Point, bool AllowDuplicates>
inline void test_open_rings()
{
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << std::endl << std::endl;
std::cout << "************************************" << std::endl;
std::cout << " is_valid: RING (open) " << std::endl;
std::cout << "************************************" << std::endl;
std::cout << "DUPLICATES ALLOWED? "
<< std::boolalpha
<< AllowDuplicates
<< std::noboolalpha
<< std::endl;
#endif
typedef bg::model::ring<Point, false, false> OG; // ccw, open ring
typedef bg::model::ring<Point, false, true> CG; // ccw, closed ring
typedef bg::model::ring<Point, true, false> CW_OG; // cw, open ring
typedef bg::model::ring<Point, true, true> CW_CG; // cw, closed ring
typedef validity_tester_areal<AllowDuplicates> tester;
typedef test_valid<tester, OG, CG, CW_OG, CW_CG> test;
// not enough points
test::apply("r01", "POLYGON(())", false);
test::apply("r02", "POLYGON((0 0))", false);
test::apply("r03", "POLYGON((0 0,1 0))", false);
// duplicate points
test::apply("r04", "POLYGON((0 0,0 0,0 0))", false);
test::apply("r05", "POLYGON((0 0,1 0,1 0))", false);
test::apply("r06", "POLYGON((0 0,1 0,0 0))", false);
test::apply("r07", "POLYGON((0 0,1 0,1 1,0 0,0 0))", AllowDuplicates);
test::apply("r08", "POLYGON((0 0,1 0,1 0,1 1))", AllowDuplicates);
test::apply("r09", "POLYGON((0 0,1 0,1 0,1 1,0 0))", AllowDuplicates);
// with spikes
test::apply("r10", "POLYGON((0 0,2 0,2 2,0 2,1 2))", false);
test::apply("r11", "POLYGON((0 0,2 0,1 0,2 2))", false);
test::apply("r12", "POLYGON((0 0,1 0,2 0,1 0,4 0,4 4))", false);
test::apply("r13", "POLYGON((0 0,2 0,2 2,1 0))", false);
test::apply("r14", "POLYGON((0 0,2 0,1 0))", false);
test::apply("r15", "POLYGON((0 0,5 0,5 5,4 4,5 5,0 5))", false);
test::apply("r16", "POLYGON((0 0,5 0,5 5,4 4,3 3,5 5,0 5))", false);
// with spikes and duplicate points
test::apply("r17", "POLYGON((0 0,0 0,2 0,2 0,1 0,1 0))", false);
// with self-crossings
test::apply("r18", "POLYGON((0 0,5 0,5 5,3 -1,0 5))", false);
// with self-crossings and duplicate points
test::apply("r19", "POLYGON((0 0,5 0,5 5,5 5,3 -1,0 5,0 5))", false);
// with self-intersections
test::apply("r20", "POLYGON((0 0,5 0,5 5,3 5,3 0,2 0,2 5,0 5))", false);
test::apply("r21", "POLYGON((0 0,5 0,5 5,3 5,3 0,2 5,0 5))", false);
test::apply("r22",
"POLYGON((0 0,5 0,5 1,1 1,1 2,2 2,3 1,4 2,5 2,5 5,0 5))",
false);
// with self-intersections and duplicate points
test::apply("r23",
"POLYGON((0 0,5 0,5 5,3 5,3 5,3 0,3 0,2 0,2 0,2 5,2 5,0 5))",
false);
// next two suggested by Adam Wulkiewicz
test::apply("r24",
"POLYGON((0 0,5 0,5 5,0 5,4 4,2 2,0 5))",
false);
test::apply("r25",
"POLYGON((0 0,5 0,5 5,1 4,4 4,4 1,0 5))",
false);
// and a few more
test::apply("r26",
"POLYGON((0 0,5 0,5 5,4 4,1 4,1 1,4 1,4 4,0 5))",
false);
test::apply("r27",
"POLYGON((0 0,5 0,5 5,4 4,4 1,1 1,1 4,4 4,0 5))",
false);
// valid rings
test::apply("r28", "POLYGON((0 0,1 0,1 1))", true);
test::apply("r29", "POLYGON((1 0,1 1,0 0))", true);
test::apply("r30", "POLYGON((0 0,1 0,1 1,0 1))", true);
test::apply("r31", "POLYGON((1 0,1 1,0 1,0 0))", true);
// test cases coming from buffer
test::apply("r32",
"POLYGON((1.1713032141645456 -0.9370425713316364,\
5.1713032141645456 4.0629574286683638,\
4.7808688094430307 4.3753049524455756,\
4.7808688094430307 4.3753049524455756,\
0.7808688094430304 -0.6246950475544243,\
0.7808688094430304 -0.6246950475544243))",
AllowDuplicates);
// wrong orientation
test::apply("r33", "POLYGON((0 0,0 1,1 1))", false);
// Normal case, plus spikes formed in two different ways
test::apply("r34", "POLYGON((0 0,4 0,4 4,0 4,0 0))", true);
test::apply("r35", "POLYGON((0 0,5 0,4 0,4 4,0 4,0 0))", false);
test::apply("r36", "POLYGON((0 0,4 0,4 -1,4 4,0 4,0 0))", false);
}
template <typename Point, bool AllowDuplicates>
inline void test_closed_rings()
{
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << std::endl << std::endl;
std::cout << "************************************" << std::endl;
std::cout << " is_valid: RING (closed) " << std::endl;
std::cout << "************************************" << std::endl;
std::cout << "DUPLICATES ALLOWED? "
<< std::boolalpha
<< AllowDuplicates
<< std::noboolalpha
<< std::endl;
#endif
typedef bg::model::ring<Point, false, true> CG; // ccw, closed ring
typedef bg::model::ring<Point, true, true> CW_CG; // cw, closed ring
typedef validity_tester_areal<AllowDuplicates> tester;
typedef test_valid<tester, CG, CG, CW_CG> test;
// not enough points
test::apply("r01c", "POLYGON(())", false);
test::apply("r02c", "POLYGON((0 0))", false);
test::apply("r03c", "POLYGON((0 0,0 0))", false);
test::apply("r04c", "POLYGON((0 0,1 0))", false);
test::apply("r05c", "POLYGON((0 0,1 0,1 0))", false);
test::apply("r06c", "POLYGON((0 0,1 0,2 0))", false);
test::apply("r07c", "POLYGON((0 0,1 0,1 0,2 0))", false);
test::apply("r08c", "POLYGON((0 0,1 0,2 0,2 0))", false);
// boundary not closed
test::apply("r09c", "POLYGON((0 0,1 0,1 1,1 2))", false);
test::apply("r10c", "POLYGON((0 0,1 0,1 0,1 1,1 1,1 2))", false);
// with spikes
test::apply("r11c", "POLYGON((0 0,1 0,1 0,2 0,0 0))", false);
test::apply("r12c", "POLYGON((0 0,1 0,1 1,2 2,0.5 0.5,0 1,0 0))", false);
// wrong orientation
test::apply("r13c", "POLYGON((0 0,0 1,1 1,2 0,0 0))", false);
}
BOOST_AUTO_TEST_CASE( test_is_valid_ring )
{
bool const allow_duplicates = true;
bool const do_not_allow_duplicates = !allow_duplicates;
test_open_rings<point_type, allow_duplicates>();
test_open_rings<point_type, do_not_allow_duplicates>();
test_closed_rings<point_type, allow_duplicates>();
test_closed_rings<point_type, do_not_allow_duplicates>();
}
template <typename Point, bool AllowDuplicates>
inline void test_open_polygons()
{
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << std::endl << std::endl;
std::cout << "************************************" << std::endl;
std::cout << " is_valid: POLYGON (open) " << std::endl;
std::cout << "************************************" << std::endl;
std::cout << "DUPLICATES ALLOWED? "
<< std::boolalpha
<< AllowDuplicates
<< std::noboolalpha
<< std::endl;
#endif
typedef bg::model::polygon<Point, false, false> OG; // ccw, open
typedef bg::model::polygon<Point, false, true> CG; // ccw, closed
typedef bg::model::polygon<Point, true, false> CW_OG; // cw, open
typedef bg::model::polygon<Point, true, true> CW_CG; // cw, closed
typedef validity_tester_areal<AllowDuplicates> tester;
typedef test_valid<tester, OG, CG, CW_OG, CW_CG> test;
// not enough points in exterior ring
test::apply("pg001", "POLYGON(())", false);
test::apply("pg002", "POLYGON((0 0))", false);
test::apply("pg003", "POLYGON((0 0,1 0))", false);
// not enough points in interior ring
test::apply("pg004", "POLYGON((0 0,10 0,10 10,0 10),())", false);
test::apply("pg005", "POLYGON((0 0,10 0,10 10,0 10),(1 1))", false);
test::apply("pg006", "POLYGON((0 0,10 0,10 10,0 10),(1 1,2 2))", false);
// duplicate points in exterior ring
test::apply("pg007", "POLYGON((0 0,0 0,0 0))", false);
test::apply("pg008", "POLYGON((0 0,1 0,1 0))", false);
test::apply("pg009", "POLYGON((0 0,1 0,0 0))", false);
test::apply("pg010", "POLYGON((0 0,1 0,1 1,0 0,0 0))", AllowDuplicates);
test::apply("pg011", "POLYGON((0 0,1 0,1 0,1 1))", AllowDuplicates);
test::apply("pg012", "POLYGON((0 0,1 0,1 0,1 1,0 0))", AllowDuplicates);
// duplicate points in interior ring
test::apply("pg013", "POLYGON((0 0,10 0,10 10,0 10),(1 1,1 1,1 1))", false);
test::apply("pg014", "POLYGON((0 0,10 0,10 10,0 10),(1 1,2 1,2 1))", false);
test::apply("pg015", "POLYGON((0 0,10 0,10 10,0 10),(1 1,2 1,1 1))", false);
test::apply("pg016",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,2 2,2 1,1 1,1 1))",
AllowDuplicates);
test::apply("pg017",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,2 2,2 2,2 1))",
AllowDuplicates);
test::apply("pg018",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,2 2,2 1,2 1,1 1))",
AllowDuplicates);
// with spikes in exterior ring
test::apply("pg019", "POLYGON((0 0,2 0,2 2,0 2,1 2))", false);
test::apply("pg020", "POLYGON((0 0,2 0,1 0,2 2))", false);
test::apply("pg021", "POLYGON((0 0,1 0,2 0,1 0,4 0,4 4))", false);
test::apply("pg022", "POLYGON((0 0,2 0,2 2,1 0))", false);
test::apply("pg023", "POLYGON((0 0,2 0,1 0))", false);
test::apply("pg024", "POLYGON((0 0,5 0,5 5,4 4,5 5,0 5))", false);
test::apply("pg025", "POLYGON((0 0,5 0,5 5,4 4,3 3,5 5,0 5))", false);
// with spikes in interior ring
test::apply("pg026",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,3 1,3 3,1 3,2 3))",
false);
test::apply("pg027",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,3 1,2 1,3 3))",
false);
test::apply("pg028",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,2 1,3 1,2 1,4 1,4 4))",
false);
test::apply("pg029",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,3 1,3 3,2 1))",
false);
test::apply("pg030", "POLYGON((0 0,10 0,10 10,0 10),(1 1,3 1,2 1))", false);
// with self-crossings in exterior ring
test::apply("pg031", "POLYGON((0 0,5 0,5 5,3 -1,0 5))", false);
// example from Norvald Ryeng
test::apply("pg032",
"POLYGON((100 1300,140 1300,140 170,100 1700))",
false);
// and with point order reversed
test::apply("pg033",
"POLYGON((100 1300,100 1700,140 170,140 1300))",
false);
// with self-crossings in interior ring
test::apply("pg034",
"POLYGON((0 0,10 0,10 10,0 10),(3 3,3 7,4 6,2 6))",
false);
// with self-crossings between rings
test::apply("pg035", "POLYGON((0 0,5 0,5 5,0 5),(1 1,2 1,1 -1))", false);
// with self-intersections in exterior ring
test::apply("pg036", "POLYGON((0 0,5 0,5 5,3 5,3 0,2 0,2 5,0 5))", false);
test::apply("pg037", "POLYGON((0 0,5 0,5 5,3 5,3 0,2 5,0 5))", false);
test::apply("pg038",
"POLYGON((0 0,5 0,5 1,1 1,1 2,2 2,3 1,4 2,5 2,5 5,0 5))",
false);
// next two suggested by Adam Wulkiewicz
test::apply("pg039", "POLYGON((0 0,5 0,5 5,0 5,4 4,2 2,0 5))", false);
test::apply("pg040", "POLYGON((0 0,5 0,5 5,1 4,4 4,4 1,0 5))", false);
test::apply("pg041",
"POLYGON((0 0,5 0,5 5,4 4,1 4,1 1,4 1,4 4,0 5))",
false);
test::apply("pg042",
"POLYGON((0 0,5 0,5 5,4 4,4 1,1 1,1 4,4 4,0 5))",
false);
// with self-intersections in interior ring
test::apply("pg043",
"POLYGON((-10 -10,10 -10,10 10,-10 10),(0 0,5 0,5 5,3 5,3 0,2 0,2 5,0 5))",
false);
test::apply("pg044",
"POLYGON((-10 -10,10 -10,10 10,-10 10),(0 0,5 0,5 5,3 5,3 0,2 5,0 5))",
false);
test::apply("pg045",
"POLYGON((-10 -10,10 -10,10 10,-10 10),(0 0,5 0,5 1,1 1,1 2,2 2,3 1,4 2,5 2,5 5,0 5))",
false);
// with self-intersections between rings
// hole has common segment with exterior ring
test::apply("pg046",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,1 10,2 10,2 1))",
false);
test::apply("pg047",
"POLYGON((0 0,0 0,10 0,10 10,0 10,0 10),(1 1,1 10,1 10,2 10,2 10,2 1))",
false);
// hole touches exterior ring at one point
test::apply("pg048", "POLYGON((0 0,10 0,10 10,0 10),(1 1,1 10,2 1))", true);
// "hole" is outside the exterior ring, but touches it
test::apply("pg049",
"POLYGON((0 0,10 0,10 10,0 10),(5 10,4 11,6 11))",
false);
// hole touches exterior ring at vertex
test::apply("pg050", "POLYGON((0 0,10 0,10 10,0 10),(0 0,1 4,4 1))", true);
// "hole" is completely outside the exterior ring
test::apply("pg051",
"POLYGON((0 0,10 0,10 10,0 10),(20 20,20 21,21 21,21 20))",
false);
// two "holes" completely outside the exterior ring, that touch
// each other
test::apply("pg052",
"POLYGON((0 0,10 0,10 10,0 10),(20 0,25 10,21 0),(30 0,25 10,31 0))",
false);
// example from Norvald Ryeng
test::apply("pg053",
"POLYGON((58 31,56.57 30,62 33),(35 9,28 14,31 16),(23 11,29 5,26 4))",
false);
// and with points reversed
test::apply("pg054",
"POLYGON((58 31,62 33,56.57 30),(35 9,31 16,28 14),(23 11,26 4,29 5))",
false);
// "hole" is completely inside another "hole"
test::apply("pg055",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,1 9,9 9,9 1),(2 2,2 8,8 8,8 2))",
false);
test::apply("pg056",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,1 9,9 9,9 1),(2 2,8 2,8 8,2 8))",
false);
// "hole" is inside another "hole" (touching)
test::apply("pg057",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,1 9,9 9,9 1),(2 2,2 8,8 8,9 6,8 2))",
false);
test::apply("pg058",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,1 9,9 9,9 1),(2 2,2 8,8 8,9 6,8 2))",
false);
test::apply("pg058a",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,1 9,9 9,9 1),(2 2,8 2,9 6,8 8,2 8))",
false);
test::apply("pg059",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,1 9,9 9,9 1),(2 2,2 8,8 8,9 6,8 2))",
false);
test::apply("pg059a",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,9 1,9 9,1 9),(2 2,2 8,8 8,9 6,8 2))",
false);
test::apply("pg060",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,1 9,9 9,9 1),(2 2,2 8,8 8,9 6,8 2))",
false);
test::apply("pg060a",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,9 1,9 9,1 9),(2 2,8 2,9 6,8 8,2 8))",
false);
// hole touches exterior ring at two points
test::apply("pg061", "POLYGON((0 0,10 0,10 10,0 10),(5 0,0 5,5 5))", false);
// cases with more holes
// two holes, touching the exterior at the same point
test::apply("pg062",
"POLYGON((0 0,10 0,10 10,0 10),(0 0,1 9,2 9),(0 0,9 2,9 1))",
true);
test::apply("pg063",
"POLYGON((0 0,0 0,10 0,10 10,0 10,0 0),(0 0,0 0,1 9,2 9),(0 0,0 0,9 2,9 1))",
AllowDuplicates);
test::apply("pg063",
"POLYGON((0 10,0 0,0 0,0 0,10 0,10 10),(2 9,0 0,0 0,1 9),(9 1,0 0,0 0,9 2))",
AllowDuplicates);
// two holes, one inside the other
test::apply("pg064",
"POLYGON((0 0,10 0,10 10,0 10),(0 0,1 9,9 1),(0 0,4 5,5 4))",
false);
// 1st hole touches has common segment with 2nd hole
test::apply("pg066",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,1 5,5 5,5 1),(5 4,5 8,8 8,8 4))",
false);
// 1st hole touches 2nd hole at two points
test::apply("pg067",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,1 9,9 9,9 8,2 8,2 1),(2 5,5 8,5 5))",
false);
// polygon with many holes, where the last two touch at two points
test::apply("pg068",
"POLYGON((0 0,20 0,20 20,0 20),(1 18,1 19,2 19,2 18),(3 18,3 19,4 19,4 18),(5 18,5 19,6 19,6 18),(7 18,7 19,8 19,8 18),(9 18,9 19,10 19,10 18),(11 18,11 19,12 19,12 18),(13 18,13 19,14 19,14 18),(15 18,15 19,16 19,16 18),(17 18,17 19,18 19,18 18),(1 1,1 9,9 9,9 8,2 8,2 1),(2 5,5 8,5 5))",
false);
// two holes completely inside exterior ring but touching each
// other at a point
test::apply("pg069",
"POLYGON((0 0,10 0,10 10,0 10),(1 1,1 9,2 9),(1 1,9 2,9 1))",
true);
// four holes, each two touching at different points
test::apply("pg070",
"POLYGON((0 0,10 0,10 10,0 10),(0 10,2 1,1 1),(0 10,4 1,3 1),(10 10,9 1,8 1),(10 10,7 1,6 1))",
true);
// five holes, with two pairs touching each at some point, and
// fifth hole creating a disconnected component for the interior
test::apply("pg071",
"POLYGON((0 0,10 0,10 10,0 10),(0 10,2 1,1 1),(0 10,4 1,3 1),(10 10,9 1,8 1),(10 10,7 1,6 1),(4 1,4 4,6 4,6 1))",
false);
// five holes, with two pairs touching each at some point, and
// fifth hole creating three disconnected components for the interior
test::apply("pg072",
"POLYGON((0 0,10 0,10 10,0 10),(0 10,2 1,1 1),(0 10,4 1,3 1),(10 10,9 1,8 1),(10 10,7 1,6 1),(4 1,4 4,6 4,6 1,5 0))",
false);
// both examples: a polygon with one hole, where the hole contains
// the exterior ring
test::apply("pg073",
"POLYGON((0 0,1 0,1 1,0 1),(-10 -10,-10 10,10 10,10 -10))",
false);
test::apply("pg074",
"POLYGON((-10 -10,1 0,1 1,0 1),(-10 -10,-10 10,10 10,10 -10))",
false);
test::apply
("pg075",
"POLYGON((-6 -10,-6.6923076923076925 -6.711538461538462,\
-9 -7,-8.824742268041238 -6.123711340206185,\
-10 -6,-8.583333333333332 -4.916666666666667,\
-8.094117647058823 -2.4705882352941173,-10 -3,\
-8.526315789473683 -0.05263157894736803,-10 1,\
-10 10,-7.764705882352941 8.509803921568627,\
-7.65090909090909 7.789090909090909,-10 10,\
-7.574468085106383 7.304964539007091,-7.4375 6.4375,\
-6.5 5.5,-6.4 6,-7.574468085106383 7.304964539007091,\
-7.65090909090909 7.789090909090909,\
-6.297029702970297 6.514851485148515,\
0 0,-6.297029702970297 6.514851485148515,\
-4.848484848484849 5.151515151515151,-4 6,\
-6.117647058823529 7.411764705882352,\
0 0,-6.11764705882353 7.411764705882353,\
-7.764705882352941 8.509803921568627,-8 10,\
-2.9473684210526314 7.052631578947368,-2 8,\
-0.17821782178217824 6.633663366336634,1 10,\
1.8095238095238098 5.142857142857142,\
3.2038834951456314 4.097087378640777,7 7,\
3.7142857142857144 3.7142857142857144,\
4.4 3.1999999999999997,8 2,\
6.540540540540541 1.5945945945945947,10 -1,\
7.454545454545455 -4.393939393939394,8 -5,\
7.320754716981132 -4.716981132075472,7 -6,\
6.062068965517241 -5.117241379310345,\
4.9504132231404965 -5.256198347107438,\
6.1506849315068495 -7.123287671232877,9 -8,\
6.548387096774194 -7.741935483870968,8 -10,\
5.906976744186046 -7.674418604651163,\
3.9107142857142856 -7.464285714285714,4 -8,\
2.8043478260869565 -7.3478260869565215,\
1.7829457364341086 -7.24031007751938,2 -8,\
1.0728476821192054 -7.1655629139072845,\
-4.3583617747440275 -6.593856655290103,-5 -9,\
-5.2020725388601035 -7.720207253886011,-6 -10),\
(5.127659574468085 -6.808510638297872,\
3.72972972972973 -6.378378378378379,\
3.571428571428571 -5.428571428571429,\
3.8539325842696632 -5.393258426966292,\
5.127659574468085 -6.808510638297872),\
(-5.5 4.5,-6.5 5.5,-6.4 6,\
-5.263157894736842 4.736842105263158,-5.5 4.5))",
false);
// test cases coming from buffer
test::apply
("pg076",
"POLYGON((1.1713032141645456 -0.9370425713316364,\
5.1713032141645456 4.0629574286683638,\
4.7808688094430307 4.3753049524455756,\
4.7808688094430307 4.3753049524455756,\
0.7808688094430304 -0.6246950475544243,\
0.7808688094430304 -0.6246950475544243))",
AllowDuplicates);
// MySQL report on Sep 30, 2015
test::apply
("pg077",
"POLYGON((72.8714768817168 -167.0048853643874,9274.40641550926 3433.5957427942167,-58.09039811390054 187.50989457746405,-81.09039811390053 179.50989457746405,-207.99999999999997 135.36742435621204,-208 1,-208 0,-208 -276.9111154485375,49.8714768817168 -176.0048853643874))",
true);
test::apply("pg077-simplified",
"POLYGON((-200 0,-207.99999999999997 135.36742435621204,-208 1,-208 0,-208 -276.9111154485375))",
true);
test::apply
("pg078",
"POLYGON((0 10,-10 0,0 0,10 0))",
true);
test::apply
("pg078spike1",
"POLYGON((0 10,-10 0,0 0,-10 0,10 0))",
false);
test::apply
("pg078spike2",
"POLYGON((0 10,-10 0,0 0,-8 0,10 0))",
false);
test::apply
("pg078spike3",
"POLYGON((0 10,-10 0,0 0,-11 0,10 0))",
false);
test::apply
("pg078reversed",
"POLYGON((0 10,10 0,0 0,-10 0))",
false);
test::apply
("pg079",
"POLYGON((10 0,0 10,0 0,0 -10))",
true);
test::apply
("pg079spike1",
"POLYGON((10 0,0 10,0 0,0 10,0 -10))",
false);
test::apply
("pg079spike2",
"POLYGON((10 0,0 10,0 0,0 8,0 -10))",
false);
test::apply
("pg079spike3",
"POLYGON((10 0,0 10,0 0,0 11,0 -10))",
false);
test::apply
("pg079reversed",
"POLYGON((10 0,0 -10,0 0,0 10))",
false);
}
template <typename Point>
inline void test_doc_example_polygon()
{
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << std::endl << std::endl;
std::cout << "************************************" << std::endl;
std::cout << " is_valid: doc example polygon " << std::endl;
std::cout << "************************************" << std::endl;
#endif
typedef bg::model::polygon<Point> ClockwiseClosedPolygon;
typedef validity_tester_areal<true> tester;
typedef test_valid<tester, ClockwiseClosedPolygon> test;
test::apply("pg-doc",
"POLYGON((0 0,0 10,10 10,10 0,0 0),(0 0,9 1,9 2,0 0),(0 0,2 9,1 9,0 0),(2 9,9 2,9 9,2 9))",
false);
// Containing a self touching point, which should be valid
test::apply("ggl_list_20190307_matthieu_2", ggl_list_20190307_matthieu_2[1], true);
}
BOOST_AUTO_TEST_CASE( test_is_valid_polygon )
{
bool const allow_duplicates = true;
bool const do_not_allow_duplicates = !allow_duplicates;
test_open_polygons<point_type, allow_duplicates>();
test_open_polygons<point_type, do_not_allow_duplicates>();
test_doc_example_polygon<point_type>();
}
template <typename Point, bool AllowDuplicates>
inline void test_open_multipolygons()
{
// WKT of multipolygons should be defined as ccw, open
#ifdef BOOST_GEOMETRY_TEST_DEBUG
std::cout << std::endl << std::endl;
std::cout << "************************************" << std::endl;
std::cout << " is_valid: MULTIPOLYGON (open) " << std::endl;
std::cout << "************************************" << std::endl;
std::cout << "DUPLICATES ALLOWED? "
<< std::boolalpha
<< AllowDuplicates
<< std::noboolalpha
<< std::endl;
#endif
// cw, ccw, open and closed polygons
typedef bg::model::polygon<point_type,false,false> ccw_open_polygon_type;
typedef bg::model::polygon<point_type,false,true> ccw_closed_polygon_type;
typedef bg::model::polygon<point_type,true,false> cw_open_polygon_type;
typedef bg::model::polygon<point_type,true,true> cw_closed_polygon_type;
typedef bg::model::multi_polygon<ccw_open_polygon_type> OG;
typedef bg::model::multi_polygon<ccw_closed_polygon_type> CG;
typedef bg::model::multi_polygon<cw_open_polygon_type> CW_OG;
typedef bg::model::multi_polygon<cw_closed_polygon_type> CW_CG;
typedef validity_tester_areal<AllowDuplicates> tester;
typedef test_valid<tester, OG, CG, CW_OG, CW_CG> test;
// not enough points
test::apply("mpg01", "MULTIPOLYGON()", true);
test::apply("mpg02", "MULTIPOLYGON((()))", false);
test::apply("mpg03", "MULTIPOLYGON(((0 0)),(()))", false);
test::apply("mpg04", "MULTIPOLYGON(((0 0,1 0)))", false);
// two disjoint polygons
test::apply("mpg05",
"MULTIPOLYGON(((0 0,1 0,1 1,0 1)),((2 2,3 2,3 3,2 3)))",
true);
// two disjoint polygons with multiple points
test::apply("mpg06",
"MULTIPOLYGON(((0 0,1 0,1 0,1 1,0 1)),((2 2,3 2,3 3,3 3,2 3)))",
AllowDuplicates);
// two polygons touch at a point
test::apply("mpg07",
"MULTIPOLYGON(((0 0,1 0,1 1,0 1)),((1 1,2 1,2 2,1 2)))",
true);
// two polygons share a segment at a point
test::apply("mpg08",
"MULTIPOLYGON(((0 0,1.5 0,1.5 1,0 1)),((1 1,2 1,2 2,1 2)))",
false);
// one polygon inside another and boundaries touching
test::apply("mpg09",
"MULTIPOLYGON(((0 0,10 0,10 10,0 10)),((0 0,9 1,9 2)))",
false);
test::apply("mpg09_2",
"MULTIPOLYGON(((0 0,5 1,10 0,10 10,0 10)),((1 1,9 1,9 2)))",
false);
// one polygon inside another and boundaries not touching
test::apply("mpg10",
"MULTIPOLYGON(((0 0,10 0,10 10,0 10)),((1 1,9 1,9 2)))",
false);
// free space is disconnected
test::apply("mpg11",
"MULTIPOLYGON(((0 0,1 0,1 1,0 1)),((1 1,2 1,2 2,1 2)),((0 1,0 2,-1 2,-1 -1)),((1 2,1 3,0 3,0 2)))",
true);
// multi-polygon with a polygon inside the hole of another polygon
test::apply("mpg12",
"MULTIPOLYGON(((0 0,100 0,100 100,0 100),(1 1,1 99,99 99,99 1)),((2 2,98 2,98 98,2 98)))",
true);
test::apply("mpg13",
"MULTIPOLYGON(((0 0,100 0,100 100,0 100),(1 1,1 99,99 99,99 1)),((1 1,98 2,98 98,2 98)))",
true);
// test case suggested by Barend Gehrels: take two valid polygons P1 and
// P2 with holes H1 and H2, respectively, and consider P2 to be
// fully inside H1; now invalidate the multi-polygon by
// considering H2 as a hole of P1 and H1 as a hole of P2; this
// should be invalid
//
// first the valid case:
test::apply("mpg14",
"MULTIPOLYGON(((0 0,100 0,100 100,0 100),(1 1,1 99,99 99,99 1)),((2 2,98 2,98 98,2 98),(3 3,3 97,97 97,97 3)))",
true);
// and the invalid case:
test::apply("mpg15",
"MULTIPOLYGON(((0 0,100 0,100 100,0 100),(3 3,3 97,97 97,97 3)),((2 2,98 2,98 98,2 98),(1 1,1 99,99 99,99 1)))",
false);
test::apply
("mpg16",
"MULTIPOLYGON(((-1 4,8 -10,-10 10,7 -6,8 -2,\
-10 10,-10 1,-3 -4,4 1,-1 2,4 3,-8 10,-5 -9,-1 6,-5 0)),\
((-10 -3,-8 1,2 -8,-2 6,-4 0,8 -5,-1 5,8 2)),\
((-6 -10,1 10,4 -8,-7 -2,2 0,-4 3,-10 9)),\
((10 -1,-2 8,-7 3,-6 8,-9 -7,7 -5)),\
((7 7,-4 -4,9 -8,-10 -6)))",
false);
You can’t perform that action at this time.