union_multi.cpp 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499
  1. // Boost.Geometry (aka GGL, Generic Geometry Library)
  2. // Unit Test
  3. // Copyright (c) 2010-2015 Barend Gehrels, Amsterdam, the Netherlands.
  4. // This file was modified by Oracle on 2016.
  5. // Modifications copyright (c) 2016, Oracle and/or its affiliates.
  6. // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
  7. // Use, modification and distribution is subject to the Boost Software License,
  8. // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
  9. // http://www.boost.org/LICENSE_1_0.txt)
  10. #include <iostream>
  11. #include <string>
  12. #include "test_union.hpp"
  13. #include <algorithms/test_overlay.hpp>
  14. #include <algorithms/overlay/multi_overlay_cases.hpp>
  15. #include <boost/geometry/algorithms/correct.hpp>
  16. #include <boost/geometry/algorithms/intersection.hpp>
  17. #include <boost/geometry/algorithms/within.hpp>
  18. #include <boost/geometry/geometries/point_xy.hpp>
  19. #include <boost/geometry/geometries/multi_linestring.hpp>
  20. #include <boost/geometry/geometries/multi_polygon.hpp>
  21. #include <boost/geometry/io/wkt/read.hpp>
  22. #define TEST_UNION(caseid, clips, holes, points, area) \
  23. (test_one<Polygon, MultiPolygon, MultiPolygon>) \
  24. ( #caseid, caseid[0], caseid[1], clips, holes, points, area)
  25. #define TEST_UNION_IGNORE(caseid, clips, holes, points, area) \
  26. { ut_settings ignore_validity; ignore_validity.test_validity = false; \
  27. test_one<Polygon, MultiPolygon, MultiPolygon> \
  28. (#caseid, caseid[0], caseid[1], \
  29. clips, holes, points, area, ignore_validity); }
  30. template <typename Ring, typename Polygon, typename MultiPolygon>
  31. void test_areal()
  32. {
  33. test_one<Polygon, MultiPolygon, MultiPolygon>("simplex_multi",
  34. case_multi_simplex[0], case_multi_simplex[1],
  35. 1, 0, 20, 14.58);
  36. test_one<Polygon, Polygon, MultiPolygon>("simplex_multi_p_mp",
  37. case_single_simplex, case_multi_simplex[0],
  38. 1, 0, 20, 14.58);
  39. test_one<Polygon, MultiPolygon, Polygon>("simplex_multi_mp_p",
  40. case_multi_simplex[0], case_single_simplex,
  41. 1, 0, 20, 14.58);
  42. test_one<Polygon, Ring, MultiPolygon>("simplex_multi_r_mp",
  43. case_single_simplex, case_multi_simplex[0],
  44. 1, 0, 20, 14.58);
  45. test_one<Ring, MultiPolygon, Polygon>("simplex_multi_mp_r",
  46. case_multi_simplex[0], case_single_simplex,
  47. 1, 0, 20, 14.58);
  48. // Normal test cases
  49. test_one<Polygon, MultiPolygon, MultiPolygon>("case_multi_no_ip",
  50. case_multi_no_ip[0], case_multi_no_ip[1],
  51. 4, 0, 16, 66.5);
  52. test_one<Polygon, MultiPolygon, MultiPolygon>("case_multi_2",
  53. case_multi_2[0], case_multi_2[1],
  54. 3, 0, 16, 59.1);
  55. test_one<Polygon, MultiPolygon, MultiPolygon>("case_58_multi_a",
  56. case_58_multi[0], case_58_multi[3],
  57. 2, 0, 21, 19.83333333);
  58. test_one<Polygon, MultiPolygon, MultiPolygon>("case_58_multi_b",
  59. case_58_multi[1], case_58_multi[2],
  60. 1, 3, 17, 48.333333);
  61. // Constructed cases for multi/touch/equal/etc
  62. test_one<Polygon, MultiPolygon, MultiPolygon>("case_61_multi",
  63. case_61_multi[0], case_61_multi[1],
  64. 1, 0, 11, 4.0);
  65. test_one<Polygon, MultiPolygon, MultiPolygon>("case_62_multi",
  66. case_62_multi[0], case_62_multi[1],
  67. 2, 0, 10, 2.0);
  68. test_one<Polygon, MultiPolygon, MultiPolygon>("case_63_multi",
  69. case_63_multi[0], case_63_multi[1],
  70. 2, 0, 10, 2.0);
  71. test_one<Polygon, MultiPolygon, MultiPolygon>("case_64_multi",
  72. case_64_multi[0], case_64_multi[1],
  73. 1, 0, 9, 3.0);
  74. test_one<Polygon, MultiPolygon, MultiPolygon>("case_65_multi",
  75. case_65_multi[0], case_65_multi[1],
  76. 3, 0, 15, 4.0);
  77. test_one<Polygon, MultiPolygon, MultiPolygon>("case_66_multi",
  78. case_66_multi[0], case_66_multi[1],
  79. 3, 0, 23, 7.0);
  80. test_one<Polygon, MultiPolygon, MultiPolygon>("case_72_multi",
  81. case_72_multi[0], case_72_multi[1],
  82. 1, 0, 13, 10.65);
  83. test_one<Polygon, MultiPolygon, MultiPolygon>("case_75_multi",
  84. case_75_multi[0], case_75_multi[1],
  85. 5, 0, 25, 5.0);
  86. test_one<Polygon, MultiPolygon, MultiPolygon>("case_76_multi",
  87. case_76_multi[0], case_76_multi[1],
  88. 5, 0, 31, 8.0);
  89. test_one<Polygon, MultiPolygon, MultiPolygon>("case_89_multi",
  90. case_89_multi[0], case_89_multi[1],
  91. 1, 0, 13, 6);
  92. test_one<Polygon, MultiPolygon, MultiPolygon>("case_101_multi",
  93. case_101_multi[0], case_101_multi[1],
  94. 1, 3, 32, 22.25);
  95. test_one<Polygon, MultiPolygon, MultiPolygon>("case_103_multi",
  96. case_103_multi[0], case_103_multi[1],
  97. 1, 0, 7, 25);
  98. test_one<Polygon, MultiPolygon, MultiPolygon>("case_104_multi",
  99. case_104_multi[0], case_104_multi[1],
  100. 1, 0, 8, 25);
  101. test_one<Polygon, MultiPolygon, MultiPolygon>("case_105_multi",
  102. case_105_multi[0], case_105_multi[1],
  103. 1, 0, 5, 25);
  104. test_one<Polygon, MultiPolygon, MultiPolygon>("case_106_multi",
  105. case_106_multi[0], case_106_multi[1],
  106. 1, 0, 5, 25);
  107. test_one<Polygon, MultiPolygon, MultiPolygon>("case_107_multi",
  108. case_107_multi[0], case_107_multi[1],
  109. 1, 0, 15, 6.75);
  110. test_one<Polygon, MultiPolygon, MultiPolygon>("case_108_multi",
  111. case_108_multi[0], case_108_multi[1],
  112. 1, 1, 20, 22.75);
  113. TEST_UNION(case_109_multi, 1, 2, 14, 1400);
  114. // Should have 9 holes, they are all separate and touching
  115. test_one<Polygon, MultiPolygon, MultiPolygon>("case_110_multi",
  116. case_110_multi[0], case_110_multi[1],
  117. 1, 9, 45, 1250);
  118. test_one<Polygon, MultiPolygon, MultiPolygon>("case_111_multi",
  119. case_111_multi[0], case_111_multi[1],
  120. 2, 0, 10, 16);
  121. test_one<Polygon, MultiPolygon, MultiPolygon>("case_112_multi",
  122. case_112_multi[0], case_112_multi[1],
  123. 2, 0, 16, 48);
  124. test_one<Polygon, MultiPolygon, MultiPolygon>("case_113_multi",
  125. case_113_multi[0], case_113_multi[1],
  126. 2, 0, 13, 162.5);
  127. test_one<Polygon, MultiPolygon, MultiPolygon>("case_114_multi",
  128. case_114_multi[0], case_114_multi[1],
  129. 1, 1, 13, 187.5);
  130. test_one<Polygon, MultiPolygon, MultiPolygon>("case_115_multi",
  131. case_115_multi[0], case_115_multi[1],
  132. 1, 1, 18, 26.7036);
  133. test_one<Polygon, MultiPolygon, MultiPolygon>("case_116_multi",
  134. case_116_multi[0], case_116_multi[1],
  135. 1, 2, 27, 51);
  136. test_one<Polygon, MultiPolygon, MultiPolygon>("case_117_multi",
  137. case_117_multi[0], case_117_multi[1],
  138. 2, 0, 18, 22);
  139. test_one<Polygon, MultiPolygon, MultiPolygon>("case_118_multi",
  140. case_118_multi[0], case_118_multi[1],
  141. 3, 0, 27, 46);
  142. test_one<Polygon, MultiPolygon, MultiPolygon>("case_119_multi",
  143. case_119_multi[0], case_119_multi[1],
  144. 2, 0, 26, 44);
  145. test_one<Polygon, MultiPolygon, MultiPolygon>("case_120_multi",
  146. case_120_multi[0], case_120_multi[1],
  147. 1, 1, 17, 35);
  148. test_one<Polygon, MultiPolygon, MultiPolygon>("case_121_multi",
  149. case_121_multi[0], case_121_multi[1],
  150. 1, 1, 14, 25.5);
  151. test_one<Polygon, MultiPolygon, MultiPolygon>("case_122_multi",
  152. case_122_multi[0], case_122_multi[1],
  153. 1, 1, 14, 29.5);
  154. TEST_UNION(case_123_multi, 1, 0, 11, 2.75);
  155. TEST_UNION(case_124_multi, 1, 0, 9, 2.75);
  156. TEST_UNION(case_125_multi, 1, 0, 9, 2.75);
  157. TEST_UNION(case_126_multi, 1, 2, 27, 52.0);
  158. TEST_UNION(case_131_multi, 1, 2, 15, 14.0);
  159. // SQL Server returns: MULTIPOLYGON (((4 4, 5.5 4.5, 6 6, 4.5 5.5, 4 4)), ((2 2, 3.5 2.5, 4 4, 2.5 3.5, 2 2)), ((0 0, 8 0, 8 8, 0 8, 0 0), (2 2, 2 4, 4 4, 4 6, 6 6, 6 4, 4 4, 4 2, 2 2)))
  160. // Which is one self-connected hole with two island polygons in both parts, basically identical to what Boost.Geometry delivers
  161. // PostGIS returns: MULTIPOLYGON(((0 0,0 8,8 8,8 0,0 0),(4 6,4 4,6 4,6 6,4 6)),((2 2,2.5 3.5,4 4,3.5 2.5,2 2),(4 4,2 4,2 2,4 2,4 4)),((4 4,4.5 5.5,6 6,5.5 4.5,4 4)))
  162. // Which seems wrong because the second hole is part of a smaller polygon (?)
  163. // ("POSTGIS="2.1.7 r13414" GEOS="3.5.0dev-CAPI-1.9.0 r4057")
  164. TEST_UNION(case_132_multi, 3, 2, 26, 60.0);
  165. TEST_UNION(case_133_multi, 2, 1, -1, 64.625);
  166. TEST_UNION(case_134_multi, 1, 2, -1, 66.0);
  167. TEST_UNION(case_135_multi, 1, 2, -1, 22.0);
  168. TEST_UNION(case_136_multi, 1, 2, -1, 22.0);
  169. TEST_UNION(case_137_multi, 1, 2, -1, 22.0);
  170. TEST_UNION(case_138_multi, 2, 1, -1, 65.225);
  171. TEST_UNION(case_139_multi, 2, 1, -1, 64.953);
  172. TEST_UNION(case_140_multi, 2, 1, -1, 64.953);
  173. TEST_UNION(case_141_multi, 1, 0, -1, 100.0);
  174. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_1",
  175. case_recursive_boxes_1[0], case_recursive_boxes_1[1],
  176. 1, 1, 16, 97.0);
  177. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_2",
  178. case_recursive_boxes_2[0], case_recursive_boxes_2[1],
  179. 1, 0, 5, 100.0); // Area from SQL Server
  180. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_3",
  181. case_recursive_boxes_3[0], case_recursive_boxes_3[1],
  182. 17, 6, 154, 56.5); // Area from SQL Server
  183. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_4",
  184. case_recursive_boxes_4[0], case_recursive_boxes_4[1],
  185. 1, 2, 26, 96.75);
  186. TEST_UNION(case_recursive_boxes_5, 3, 10, 98, 70.0);
  187. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_6",
  188. case_recursive_boxes_6[0], case_recursive_boxes_6[1],
  189. 1, 3, 17, 24.0);
  190. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_7",
  191. case_recursive_boxes_7[0], case_recursive_boxes_7[1],
  192. 2, 0, 20, 7.0);
  193. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_8",
  194. case_recursive_boxes_8[0], case_recursive_boxes_8[1],
  195. 1, 0, 13, 12.0);
  196. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_9",
  197. case_recursive_boxes_9[0], case_recursive_boxes_9[1],
  198. 1, 1, 11, 8.25);
  199. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_10",
  200. case_recursive_boxes_10[0], case_recursive_boxes_10[1],
  201. 1, 0, -1, 2.75);
  202. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_11",
  203. case_recursive_boxes_11[0], case_recursive_boxes_11[1],
  204. 1, 0, -1, 8.0);
  205. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_12",
  206. case_recursive_boxes_12[0], case_recursive_boxes_12[1],
  207. 6, 0, -1, 6.0);
  208. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_13",
  209. case_recursive_boxes_13[0], case_recursive_boxes_13[1],
  210. 3, 0, -1, 10.25);
  211. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_14",
  212. case_recursive_boxes_14[0], case_recursive_boxes_14[1],
  213. 5, 0, -1, 4.5);
  214. // 12, 13, 14 with invalid input. To make then valid it is necessary
  215. // to break regions at self-intersection points (postponed)
  216. TEST_UNION_IGNORE(case_recursive_boxes_12_invalid, 5, 0, -1, 6.0);
  217. TEST_UNION_IGNORE(case_recursive_boxes_13_invalid, 2, 0, -1, 10.25);
  218. TEST_UNION_IGNORE(case_recursive_boxes_14_invalid, 4, 0, -1, 4.5);
  219. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_15",
  220. case_recursive_boxes_15[0], case_recursive_boxes_15[1],
  221. 3, 0, -1, 6.0);
  222. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_16",
  223. case_recursive_boxes_16[0], case_recursive_boxes_16[1],
  224. 1, 4, -1, 22.0);
  225. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_17",
  226. case_recursive_boxes_17[0], case_recursive_boxes_17[1],
  227. 5, 2, -1, 21.0);
  228. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_18",
  229. case_recursive_boxes_18[0], case_recursive_boxes_18[1],
  230. 3, 0, -1, 2.5);
  231. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_19",
  232. case_recursive_boxes_19[0], case_recursive_boxes_19[1],
  233. 3, 0, -1, 2.5);
  234. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_20",
  235. case_recursive_boxes_20[0], case_recursive_boxes_20[1],
  236. 2, 0, -1, 2.0);
  237. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_21",
  238. case_recursive_boxes_21[0], case_recursive_boxes_21[1],
  239. 1, 0, -1, 2.5);
  240. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_22",
  241. case_recursive_boxes_22[0], case_recursive_boxes_22[1],
  242. 2, 0, -1, 3.25);
  243. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_23",
  244. case_recursive_boxes_23[0], case_recursive_boxes_23[1],
  245. 3, 0, -1, 1.75);
  246. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_24",
  247. case_recursive_boxes_24[0], case_recursive_boxes_24[1],
  248. 5, 0, -1, 5.0);
  249. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_25",
  250. case_recursive_boxes_25[0], case_recursive_boxes_25[1],
  251. 2, 0, -1, 5.5);
  252. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_26",
  253. case_recursive_boxes_26[0], case_recursive_boxes_26[1],
  254. 3, 0, -1, 6.0);
  255. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_27",
  256. case_recursive_boxes_27[0], case_recursive_boxes_27[1],
  257. 4, 0, -1, 4.5);
  258. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_28",
  259. case_recursive_boxes_28[0], case_recursive_boxes_28[1],
  260. 2, 0, -1, 6.5);
  261. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_29",
  262. case_recursive_boxes_29[0], case_recursive_boxes_29[1],
  263. 2, 2, -1, 15.5);
  264. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_30",
  265. case_recursive_boxes_30[0], case_recursive_boxes_30[1],
  266. 1, 3, -1, 17.5);
  267. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_31",
  268. case_recursive_boxes_31[0], case_recursive_boxes_31[1],
  269. 3, 0, -1, 5.0);
  270. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_32",
  271. case_recursive_boxes_32[0], case_recursive_boxes_32[1],
  272. 2, 0, -1, 5.75);
  273. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_33",
  274. case_recursive_boxes_33[0], case_recursive_boxes_33[1],
  275. 1, 1, -1, 11.0);
  276. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_34",
  277. case_recursive_boxes_34[0], case_recursive_boxes_34[1],
  278. 1, 0, -1, 25.0);
  279. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_35",
  280. case_recursive_boxes_35[0], case_recursive_boxes_35[1],
  281. 1, 1, -1, 24.5);
  282. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_36",
  283. case_recursive_boxes_36[0], case_recursive_boxes_36[1],
  284. 3, 0, -1, 3.0);
  285. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_37",
  286. case_recursive_boxes_37[0], case_recursive_boxes_37[1],
  287. 2, 1, -1, 7.75);
  288. test_one<Polygon, MultiPolygon, MultiPolygon>("case_recursive_boxes_38",
  289. case_recursive_boxes_38[0], case_recursive_boxes_38[1],
  290. 2, 1, -1, 14.0);
  291. TEST_UNION(case_recursive_boxes_46, 1, 4, 51, 33.0);
  292. TEST_UNION(case_recursive_boxes_47, 1, 0, -1, 22.0);
  293. TEST_UNION(case_recursive_boxes_48, 1, 1, -1, 10.0);
  294. TEST_UNION(case_recursive_boxes_49, 1, 3, -1, 59.0);
  295. TEST_UNION(case_recursive_boxes_50, 7, 4, -1, 68.0);
  296. TEST_UNION(case_recursive_boxes_51, 2, 6, -1, 75.0);
  297. TEST_UNION(case_recursive_boxes_52, 2, 6, -1, 77.0);
  298. TEST_UNION(case_recursive_boxes_53, 1, 1, -1, 24.75);
  299. TEST_UNION(case_recursive_boxes_54, 1, 2, -1, 22.5);
  300. TEST_UNION(case_recursive_boxes_55, 3, 1, -1, 15.5);
  301. TEST_UNION(case_recursive_boxes_56, 5, 1, -1, 7.75);
  302. TEST_UNION(case_recursive_boxes_57, 3, 4, -1, 19.75);
  303. TEST_UNION(case_recursive_boxes_58, 6, 1, -1, 6.25);
  304. TEST_UNION(case_recursive_boxes_59, 1, 3, -1, 21.75);
  305. TEST_UNION(case_recursive_boxes_60, 3, 0, -1, 20.5);
  306. TEST_UNION(case_recursive_boxes_61, 1, 1, -1, 23.5);
  307. TEST_UNION(case_recursive_boxes_62, 2, 3, -1, 21.25);
  308. TEST_UNION(case_recursive_boxes_63, 2, 3, -1, 44.0);
  309. TEST_UNION(case_recursive_boxes_64, 1, 2, -1, 24.5);
  310. TEST_UNION(case_recursive_boxes_65, 1, 1, -1, 24.5);
  311. TEST_UNION(case_recursive_boxes_66, 1, 1, -1, 24.75);
  312. TEST_UNION(case_recursive_boxes_67, 4, 0, -1, 14.75);
  313. TEST_UNION(case_recursive_boxes_68, 1, 4, -1, 22.5);
  314. TEST_UNION(case_recursive_boxes_69, 4, 0, -1, 16.25);
  315. TEST_UNION(case_recursive_boxes_70, 1, 0, -1, 25.0);
  316. TEST_UNION(case_recursive_boxes_71, 4, 2, -1, 15.75);
  317. TEST_UNION(case_recursive_boxes_72, 10, 0, -1, 15.0);
  318. TEST_UNION(case_recursive_boxes_73, 1, 2, -1, 24.25);
  319. TEST_UNION(case_recursive_boxes_74, 1, 1, -1, 24.75);
  320. TEST_UNION(case_recursive_boxes_75, 1, 2, -1, 23.25);
  321. TEST_UNION(case_recursive_boxes_76, 1, 0, -1, 24.5);
  322. TEST_UNION(case_recursive_boxes_77, 8, 1, -1, 13.5);
  323. TEST_UNION(case_recursive_boxes_78, 2, 5, -1, 18.0);
  324. TEST_UNION(case_recursive_boxes_79, 1, 2, -1, 14.75);
  325. // No hole should be generated (but rescaling generates one hole)
  326. TEST_UNION(case_recursive_boxes_80, 2, BG_IF_RESCALED(1, 0), -1, 1.5);
  327. TEST_UNION(case_recursive_boxes_81, 5, 0, -1, 15.5);
  328. TEST_UNION(case_recursive_boxes_82, 2, 2, -1, 20.25);
  329. TEST_UNION(case_recursive_boxes_83, 3, 1, -1, 20.75);
  330. TEST_UNION(case_recursive_boxes_84, 4, 1, -1, 17.5);
  331. TEST_UNION(case_recursive_boxes_85, 9, 0, -1, 8.0);
  332. TEST_UNION(case_recursive_boxes_86, 3, 0, -1, 3.0);
  333. TEST_UNION(case_recursive_boxes_87, 8, 0, -1, 4.5);
  334. TEST_UNION(case_recursive_boxes_88, 5, 1, -1, 15.0);
  335. test_one<Polygon, MultiPolygon, MultiPolygon>("ggl_list_20120915_h2_a",
  336. ggl_list_20120915_h2[0], ggl_list_20120915_h2[1],
  337. 1, 0, 12, 23.0); // Area from SQL Server
  338. test_one<Polygon, MultiPolygon, MultiPolygon>("ggl_list_20120915_h2_b",
  339. ggl_list_20120915_h2[0], ggl_list_20120915_h2[2],
  340. 1, 0, 12, 23.0); // Area from SQL Server
  341. test_one<Polygon, MultiPolygon, MultiPolygon>("ggl_list_20140212_sybren",
  342. ggl_list_20140212_sybren[0], ggl_list_20140212_sybren[1],
  343. 2, 0, 16, 0.002471626);
  344. {
  345. // Generates either 4 or 3 output polygons
  346. // With rescaling the result is invalid.
  347. ut_settings settings;
  348. settings.test_validity = BG_IF_RESCALED(false, true);
  349. test_one<Polygon, MultiPolygon, MultiPolygon>("ticket_9081",
  350. ticket_9081[0], ticket_9081[1],
  351. BG_IF_RESCALED(4, 3), 0, 31, 0.2187385,
  352. settings);
  353. }
  354. test_one<Polygon, MultiPolygon, MultiPolygon>("ticket_10803",
  355. ticket_10803[0], ticket_10803[1],
  356. 1, 0, 9, 2663736.07038);
  357. test_one<Polygon, MultiPolygon, MultiPolygon>("ticket_11984",
  358. ticket_11984[0], ticket_11984[1],
  359. 1, 2, 134, 60071.08077);
  360. test_one<Polygon, MultiPolygon, MultiPolygon>("ticket_12118",
  361. ticket_12118[0], ticket_12118[1],
  362. 1, -1, 27, 2221.38713);
  363. #if defined(BOOST_GEOMETRY_TEST_FAILURES) || ! defined(BOOST_GEOMETRY_USE_RESCALING)
  364. // No output if rescaling is done
  365. test_one<Polygon, MultiPolygon, MultiPolygon>("ticket_12125",
  366. ticket_12125[0], ticket_12125[1],
  367. 1, 0, -1, 575.831180350007);
  368. #endif
  369. TEST_UNION(ticket_12503, 42, 1, -1, 945.625);
  370. #if ! defined(BOOST_GEOMETRY_USE_RESCALING) || defined(BOOST_GEOMETRY_TEST_FAILURES)
  371. // Failure with rescaling
  372. TEST_UNION(issue_630_a, 1, 0, -1, 2.200326);
  373. #endif
  374. TEST_UNION(issue_630_b, 1, 0, -1, 1.675976);
  375. #if ! defined(BOOST_GEOMETRY_USE_KRAMER_RULE) || defined(BOOST_GEOMETRY_TEST_FAILURES)
  376. // Failure with Kramer rule
  377. TEST_UNION(issue_630_c, 1, 0, -1, 1.670367);
  378. #endif
  379. #if ! defined(BOOST_GEOMETRY_USE_RESCALING) || defined(BOOST_GEOMETRY_TEST_FAILURES)
  380. // With rescaling the small polygon is added on top of the outer polygon
  381. TEST_UNION(issue_643, 1, 0, -1, 80.0);
  382. #endif
  383. #if defined(BOOST_GEOMETRY_USE_KRAMER_RULE)
  384. // Two polygons, should ideally be merged
  385. TEST_UNION(mail_2019_01_21_johan, 2, 0, -1, 0.00058896);
  386. #else
  387. // Correct: one polygon
  388. TEST_UNION(mail_2019_01_21_johan, 1, 0, -1, 0.00058896);
  389. #endif
  390. TEST_UNION(mysql_23023665_7, 1, 1, -1, 99.19494);
  391. TEST_UNION(mysql_23023665_8, 1, 2, -1, 1400.0);
  392. test_one<Polygon, MultiPolygon, MultiPolygon>("mysql_23023665_9",
  393. mysql_23023665_9[0], mysql_23023665_9[1],
  394. 1, 9, -1, 1250.0);
  395. TEST_UNION(mysql_regression_1_65_2017_08_31, 3, 0, -1, 181.966397646608);
  396. }
  397. // Test cases (generic)
  398. template <typename Point, bool ClockWise, bool Closed>
  399. void test_all()
  400. {
  401. typedef bg::model::ring<Point, ClockWise, Closed> ring;
  402. typedef bg::model::polygon<Point, ClockWise, Closed> polygon;
  403. typedef bg::model::multi_polygon<polygon> multi_polygon;
  404. test_areal<ring, polygon, multi_polygon>();
  405. }
  406. // Test cases for integer coordinates / ccw / open
  407. template <typename Point, bool ClockWise, bool Closed>
  408. void test_specific()
  409. {
  410. typedef bg::model::polygon<Point, ClockWise, Closed> polygon;
  411. typedef bg::model::multi_polygon<polygon> multi_polygon;
  412. ut_settings settings;
  413. settings.test_validity = true;
  414. test_one<polygon, multi_polygon, multi_polygon>("ticket_10803",
  415. ticket_10803[0], ticket_10803[1],
  416. 1, 0, 9, 2664270, settings);
  417. }
  418. int test_main(int, char* [])
  419. {
  420. BoostGeometryWriteTestConfiguration();
  421. test_all<bg::model::d2::point_xy<default_test_type>, true, true>();
  422. #if ! defined(BOOST_GEOMETRY_TEST_ONLY_ONE_TYPE)
  423. test_all<bg::model::d2::point_xy<double>, false, false>();
  424. test_specific<bg::model::d2::point_xy<int>, false, false>();
  425. test_all<bg::model::d2::point_xy<float>, true, true>();
  426. #if defined(HAVE_TTMATH)
  427. std::cout << "Testing TTMATH" << std::endl;
  428. test_all<bg::model::d2::point_xy<ttmath_big> >();
  429. #endif
  430. #endif
  431. return 0;
  432. }