/usr/lib/python2.7/dist-packages/imposm/test/test_multipolygon.py is in python-imposm 2.6.0+ds-4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | # Copyright 2011 Omniscale (http://omniscale.com)
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
from imposm.base import Relation, Way
from imposm.multipolygon import UnionRelationBuilder, ContainsRelationBuilder, Ring, merge_rings
from nose.tools import eq_, assert_almost_equal
class RelationBuilderTestBase(object):
def test_broken_polygon_self_intersect(self):
# 2##3 6##7
# # # ####
# 1##4____5##8
w1 = Way(1, {}, [1, 2, 3, 4, 5, 6, 7, 8, 1])
w1.coords = [(0, 0), (0, 10), (10, 10), (10, 0), (20, 0), (20, 10), (30, 10), (30, 0), (0, 0)]
w2 = Way(2, {}, [15, 16, 17, 18, 15])
w2.coords = [(2, 2), (8, 2), (8, 8), (2, 8), (2, 2)]
yield self.check_broken_polygon, w1, w2
# 2##3 6##7
# # # ####
# 1##4____5##8
w1 = Way(1, {}, [4, 1, 2, 3, 4, 5, 6, 7, 8, 4])
w1.coords = [(10, 0), (0, 0), (0, 10), (10, 10), (10, 0), (20, 0), (20, 10), (30, 10), (30, 0), (10, 0)]
yield self.check_broken_polygon, w1, w2
def check_broken_polygon(self, w1, w2):
r = Relation(1, {}, [(1, 'way', 'outer'), (2, 'way', 'inner')])
builder = self.relation_builder(r, None, None)
rings = builder.build_rings([w1, w2])
eq_(len(rings), 2)
eq_(rings[0].geom.area, 200)
eq_(rings[1].geom.area, 36)
builder.build_relation_geometry(rings)
eq_(r.geom.area, 200-36)
def test_broken_polygon_self_intersect_triangle(self):
# 2###
# # ###4
# # ###3
# 1###
# triangle with four points, minor overlapping
w1 = Way(1, {}, [1, 2, 3, 4, 1])
w1.coords = [(0, 0), (0, 100), (100, 50 - 0.00001), (100, 50 + 0.00001), (0, 0)]
w2 = Way(2, {}, [15, 16, 17, 18, 15])
w2.coords = [(10, 45), (10, 55), (20, 55), (20, 45), (10, 45)]
r = Relation(1, {}, [(1, 'way', 'outer'), (2, 'way', 'inner')])
builder = self.relation_builder(r, None, None)
rings = builder.build_rings([w1, w2])
eq_(len(rings), 2)
assert_almost_equal(rings[0].geom.area, 100 * 100 / 2, 2)
eq_(rings[1].geom.area, 100)
builder.build_relation_geometry(rings)
assert_almost_equal(r.geom.area, 100 * 100 / 2 - 100, 2)
# larger overlapp
w1 = Way(1, {}, [1, 2, 3, 4, 1])
w1.coords = [(0, 0), (0, 100), (100, 50 - 1), (100, 50 + 1), (0, 0)]
w2 = Way(2, {}, [15, 16, 17, 18, 15])
w2.coords = [(10, 45), (10, 55), (20, 55), (20, 45), (10, 45)]
r = Relation(1, {}, [(1, 'way', 'outer'), (2, 'way', 'inner')])
builder = self.relation_builder(r, None, None)
rings = builder.build_rings([w1, w2])
eq_(len(rings), 2)
assert_almost_equal(rings[0].geom.area, 100 * 100 / 2, -3)
eq_(rings[1].geom.area, 100)
builder.build_relation_geometry(rings)
assert_almost_equal(r.geom.area, 100 * 100 / 2 - 100, -3)
# # 2### ###4
# # # ### #
# # # ### #
# # 1### ###3
# # hourglass
# w1 = Way(1, {}, [1, 2, 3, 4, 1])
# w1.coords = [(0, 0), (0, 100), (100, 0), (100, 100), (0, 0)]
# w2 = Way(2, {}, [15, 16, 17, 18, 15])
# w2.coords = [(10, 45), (10, 55), (20, 55), (20, 45), (10, 45)]
# w3 = Way(3, {}, [25, 26, 27, 28, 25])
# w3.coords = [(80, 45), (80, 55), (90, 55), (90, 45), (80, 45)]
#
# r = Relation(1, {}, [(1, 'way', 'outer'), (2, 'way', 'inner')])
# builder = self.relation_builder(r, None, None)
# rings = builder.build_rings([w1, w2, w3])
# eq_(len(rings), 3)
# print rings[0].geom.wkt, rings[0].geom.simplify(0.000001, False).wkt
# eq_(rings[0].geom.area, 100 * 100 / 2)
# eq_(rings[1].geom.area, 100)
# eq_(rings[2].geom.area, 100)
#
# builder.build_relation_geometry(rings)
# assert_almost_equal(r.geom.area, 100 * 100 / 2 - 100, -3)
def test_simple_polygon_w_hole(self):
w1 = Way(1, {}, [1, 2, 3, 4, 1])
w1.coords = [(0, 0), (10, 0), (10, 10), (0, 10), (0, 0)]
w2 = Way(2, {}, [5, 6, 7, 8, 5])
w2.coords = [(2, 2), (8, 2), (8, 8), (2, 8), (2, 2)]
r = Relation(1, {}, [(1, 'way', 'outer'), (2, 'way', 'inner')])
builder = self.relation_builder(r, None, None)
rings = builder.build_rings([w1, w2])
eq_(len(rings), 2)
eq_(rings[0].geom.area, 100)
eq_(rings[1].geom.area, 36)
builder.build_relation_geometry(rings)
eq_(r.geom.area, 100-36)
def test_polygon_w_multiple_holes(self):
w1 = Way(1, {'landusage': 'forest'}, [1, 2, 3, 4, 1])
w1.coords = [(0, 0), (10, 0), (10, 10), (0, 10), (0, 0)]
w2 = Way(2, {'water': 'basin'}, [1, 2, 3, 4, 1])
w2.coords = [(1, 1), (2, 1), (2, 2), (1, 2), (1, 1)]
w3 = Way(3, {'landusage': 'scrub'}, [1, 2, 3, 4, 1])
w3.coords = [(3, 3), (4, 3), (4, 4), (3, 4), (3, 3)]
r = Relation(1, {'landusage': 'forest'}, [
(1, 'way', 'outer'), (2, 'way', 'inner'), (3, 'way', 'inner')])
builder = self.relation_builder(r, None, None)
rings = builder.build_rings([w1, w2, w3])
eq_(len(rings), 3)
eq_(rings[0].geom.area, 100)
eq_(rings[1].geom.area, 1)
eq_(rings[2].geom.area, 1)
builder.build_relation_geometry(rings)
eq_(rings[0].inserted, True)
eq_(rings[1].inserted, False)
eq_(rings[2].inserted, False)
eq_(r.geom.area, 100-1-1)
def test_polygon_w_nested_holes(self):
w1 = Way(1, {'landusage': 'forest'}, [1, 2, 3, 4, 1])
w1.coords = [(0, 0), (10, 0), (10, 10), (0, 10), (0, 0)]
w2 = Way(2, {'landusage': 'scrub'}, [1, 2, 3, 4, 1])
w2.coords = [(1, 1), (9, 1), (9, 9), (1, 9), (1, 1)]
w3 = Way(3, {}, [5, 6, 7, 8, 5]) # with no tags
w3.coords = [(2, 2), (8, 2), (8, 8), (2, 8), (2, 2)]
w4 = Way(4, {'landusage': 'scrub'}, [9, 10, 11, 12, 9])
w4.coords = [(3, 3), (7, 3), (7, 7), (3, 7), (3, 3)]
w5 = Way(5, {'landusage': 'forest'}, [9, 10, 11, 12, 9])
w5.coords = [(4, 4), (6, 4), (6, 6), (4, 6), (4, 4)]
r = Relation(1, {'landusage': 'forest'}, [
(1, 'way', 'outer'), (2, 'way', 'inner'), (3, 'way', 'inner'),
(4, 'way', 'inner'), (5, 'way', 'inner')])
builder = self.relation_builder(r, None, None)
rings = builder.build_rings([w1, w2, w3, w4, w5])
eq_(len(rings), 5)
eq_(rings[0].geom.area, 100)
eq_(rings[1].geom.area, 64)
eq_(rings[2].geom.area, 36)
eq_(rings[3].geom.area, 16)
eq_(rings[4].geom.area, 4)
builder.build_relation_geometry(rings)
eq_(rings[0].inserted, True)
eq_(rings[1].inserted, False)
eq_(rings[2].inserted, True)
eq_(rings[3].inserted, False)
eq_(rings[4].inserted, True)
eq_(r.geom.area, 100-64+36-16+4)
def test_polygon_w_touching_holes(self):
w1 = Way(1, {'landusage': 'forest'}, [1, 2, 3, 4, 1])
w1.coords = [(0, 0), (10, 0), (10, 10), (0, 10), (0, 0)]
w2 = Way(2, {'landusage': 'scrub'}, [1, 2, 3, 4, 1])
w2.coords = [(1, 1), (5, 1), (5, 9), (1, 9), (1, 1)]
w3 = Way(3, {'water': 'basin'}, [1, 2, 3, 4, 1])
w3.coords = [(5, 1), (9, 1), (9, 9), (5, 9), (5, 1)]
r = Relation(1, {'landusage': 'forest'}, [
(1, 'way', 'outer'), (2, 'way', 'inner'), (3, 'way', 'inner')])
builder = self.relation_builder(r, None, None)
rings = builder.build_rings([w1, w2, w3])
eq_(len(rings), 3)
eq_(rings[0].geom.area, 100)
eq_(rings[1].geom.area, 32)
eq_(rings[2].geom.area, 32)
builder.build_relation_geometry(rings)
eq_(rings[0].inserted, True)
eq_(rings[1].inserted, False)
eq_(rings[2].inserted, False)
eq_(r.geom.area, 100-64)
def test_touching_polygons_w_hole(self):
w1 = Way(1, {'water': 'riverbank'}, [1, 2, 3, 4, 1])
w1.coords = [(0, 0), (10, 0), (10, 10), (0, 10), (0, 0)]
w2 = Way(2, {'water': 'riverbank'}, [2, 5, 6, 3, 2])
w2.coords = [(10, 0), (30, 0), (30, 10), (10, 10), (10, 0)]
w3 = Way(3, {'landusage': 'forest'}, [7, 8, 9, 10, 7])
w3.coords = [(2, 2), (8, 2), (8, 8), (2, 8), (2, 2)]
r = Relation(1, {'water': 'riverbank'}, [
(1, 'way', 'outer'), (2, 'way', 'outer'), (3, 'way', 'inner')])
builder = self.relation_builder(r, None, None)
rings = builder.build_rings([w1, w2, w3])
eq_(len(rings), 3)
eq_(rings[0].geom.area, 100)
eq_(rings[1].geom.area, 200)
eq_(rings[2].geom.area, 36)
builder.build_relation_geometry(rings)
eq_(rings[0].inserted, True)
eq_(rings[1].inserted, True)
eq_(rings[2].inserted, False)
eq_(r.geom.area, 100+200-36)
def test_simple_polygon_from_two_lines(self):
w1 = Way(1, {}, [1, 2, 3])
w1.coords = [(0, 0), (10, 0), (10, 10)]
w2 = Way(2, {}, [3, 4, 1])
w2.coords = [(10, 10), (0, 10), (0, 0)]
r = Relation(1, {}, [(1, 'way', 'outer'), (2, 'way', 'inner')])
builder = self.relation_builder(r, None, None)
rings = builder.build_rings([w1, w2])
eq_(len(rings), 1)
eq_(rings[0].geom.area, 100)
builder.build_relation_geometry(rings)
eq_(r.geom.area, 100)
def test_inserted_ways_different_tags(self):
w1 = Way(1, {'landusage': 'forest'}, [1, 2, 3])
w1.coords = [(0, 0), (10, 0), (10, 10)]
w2 = Way(2, {'highway': 'secondary'}, [3, 4, 1])
w2.coords = [(10, 10), (0, 10), (0, 0)]
r = Relation(1, {'landusage': 'forest'}, [(1, 'way', 'outer'), (2, 'way', 'inner')])
builder = self.relation_builder(r, None, None)
rings = builder.build_rings([w1, w2])
builder.build_relation_geometry(rings)
eq_(w1.inserted, True)
eq_(w2.inserted, False)
def test_inserted_multiple_tags(self):
w1 = Way(1, {'landusage': 'forest', 'highway': 'secondary'}, [1, 2, 3])
w1.coords = [(0, 0), (10, 0), (10, 10)]
w2 = Way(2, {'highway': 'secondary'}, [3, 4, 1])
w2.coords = [(10, 10), (0, 10), (0, 0)]
r = Relation(1, {'landusage': 'forest'}, [(1, 'way', 'outer'), (2, 'way', 'inner')])
builder = self.relation_builder(r, None, None)
rings = builder.build_rings([w1, w2])
builder.build_relation_geometry(rings)
eq_(w1.inserted, False) # also highway=secondary
eq_(w2.inserted, False)
class TestUnionRelationBuilder(RelationBuilderTestBase):
relation_builder = UnionRelationBuilder
class TestContainsRelationBuilder(RelationBuilderTestBase):
relation_builder = ContainsRelationBuilder
def test_merge_rings():
w1 = Way(1, {}, [1, 2, 3])
w1.coords = [(0, 0), (10, 0), (10, 10)]
r1 = Ring(w1)
w2 = Way(2, {}, [3, 4, 1])
w2.coords = [(10, 10), (0, 10), (0, 0)]
r2 = Ring(w2)
rings = merge_rings([r1, r2])
eq_(len(rings), 1)
r = rings[0]
eq_(r.is_closed(), True)
# eq_(r.ways, [w1, w2])
def test_merge_rings_reverse_endpoint():
w1 = Way(1, {'name': 'foo'}, [1, 2, 3, 4])
w1.coords = []
r1 = Ring(w1)
w2 = Way(2, {'building': 'true'}, [6, 5, 4])
w2.coords = []
r2 = Ring(w2)
w3 = Way(3, {}, [1, 7, 6])
w3.coords = []
r3 = Ring(w3)
rings = merge_rings([r1, r2, r3])
eq_(len(rings), 1)
r = rings[0]
eq_(r.tags, {'name': 'foo', 'building': 'true'})
eq_(r.is_closed(), True)
# eq_(r.ways, [w1, w2, w3])
class W(Way):
# way without coords
coords = []
from imposm.merge import permutations
def test_merge_rings_permutations():
"""
Test all possible permutations of 4 ring segments.
"""
for i in range(16):
# test each segment in both directions
f1 = i & 1 == 0
f2 = i & 2 == 0
f3 = i & 4 == 0
f4 = i & 8 == 0
for i1, i2, i3, i4 in permutations([0, 1, 2, 3]):
ways = [
W(1, {}, [1, 2, 3, 4] if f1 else [4, 3, 2, 1]),
W(2, {}, [4, 5, 6, 7] if f2 else [7, 6, 5, 4]),
W(3, {}, [7, 8, 9, 10] if f3 else [10, 9, 8, 7]),
W(4, {}, [10, 11, 12, 1] if f4 else [1, 12, 11, 10]),
]
ways = [ways[i1], ways[i2], ways[i3], ways[i4]]
rings = [Ring(w) for w in ways]
merged_rings = merge_rings(rings)
eq_(len(merged_rings), 1)
r = merged_rings[0]
eq_(r.is_closed(), True, (ways, r.refs))
eq_(set(r.ways), set(ways))
# check order of refs
prev_x = r.refs[0]
for x in r.refs[1:]:
if not abs(prev_x - x) == 1:
assert (
(prev_x == 1 and x == 12) or
(prev_x == 12 and x == 1)
), 'not in order %r' % r.refs
prev_x = x
|