-
Notifications
You must be signed in to change notification settings - Fork 10
/
blockr.py
270 lines (244 loc) · 9.32 KB
/
blockr.py
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
from shapely.geometry import Point, Polygon, MultiPolygon, asShape
from shapely.geometry.polygon import LinearRing
from shapely.ops import cascaded_union, polygonize
from shapely.prepared import prep
from rtree import Rtree
from outliers import load_points, discard_outliers
import sys, json, math, pickle, os, geojson
SAMPLE_SIZE = 20
SCALE_FACTOR = 111111.0 # meters per degree latitude
#ACTION_THRESHOLD = 2.0/math.sqrt(1000.0) # 1 point closer than 1km
ACTION_THRESHOLD = 20.0/math.sqrt(1000.0) # 1 point closer than 1km
AREA_BOUND = 0.001
TARGET_ASSIGN_LEVEL = 0.75
name_file, line_file, point_file = sys.argv[1:4]
places = {}
names = {}
blocks = {}
if os.path.exists(point_file + '.cache'):
print >>sys.stderr, "Reading from %s cache..." % point_file
names, blocks, places = pickle.load(file(point_file + ".cache"))
blocks = map(asShape, blocks)
else:
all_names = {}
count = 0
for line in file(name_file):
place_id, name = line.strip().split(None, 1)
all_names[int(place_id)] = name
count += 1
if count % 1000 == 0:
print >>sys.stderr, "\rRead %d names from %s." % (count, name_file),
print >>sys.stderr, "\rRead %d names from %s." % (count, name_file)
places = load_points(point_file)
for place_id in places:
names[place_id] = all_names.get(place_id, "")
places = discard_outliers(places)
lines = []
do_polygonize = False
print >>sys.stderr, "Reading lines from %s..." % line_file,
for feature in geojson.loads(file(line_file).read()):
if feature.geometry.type in ('LineString', 'MultiLineString'):
do_polygonize = True
lines.append(asShape(feature.geometry.to_dict()))
print >>sys.stderr, "%d lines read." % len(lines)
if do_polygonize:
print >>sys.stderr, "Polygonizing %d lines..." % (len(lines)),
blocks = [poly.__geo_interface__ for poly in polygonize(lines)]
print >>sys.stderr, "%d blocks formed." % len(blocks)
else:
blocks = [poly.__geo_interface__ for poly in lines]
if not os.path.exists(point_file + '.cache'):
print >>sys.stderr, "Caching points, blocks, and names ..."
pickle.dump((names, blocks, places), file(point_file + ".cache", "w"), -1)
blocks = map(asShape, blocks)
points = []
place_list = set()
count = 0
for place_id, pts in places.items():
count += 1
print >>sys.stderr, "\rPreparing %d of %d places..." % (count, len(places)),
for pt in pts:
place_list.add((len(points), pt+pt, None))
points.append((place_id, Point(pt)))
print >>sys.stderr, "Indexing...",
index = Rtree(place_list)
print >>sys.stderr, "Done."
def score_block(polygon):
centroid = polygon.centroid
#prepared = prep(polygon)
score = {}
outside_samples = 0
for item in index.nearest((centroid.x, centroid.y), num_results=SAMPLE_SIZE):
place_id, point = points[item]
score.setdefault(place_id, 0.0)
#if prepared.contains(point):
# score[place_id] += 1.0
#else:
score[place_id] += 1.0 / math.sqrt(max(polygon.distance(point)*SCALE_FACTOR, 1.0))
outside_samples += 1
return list(reversed(sorted((sc, place_id) for place_id, sc in score.items())))
count = 0
assigned_blocks = {}
assigned_ct = 0
unassigned = {} #keyed on the polygon's index in blocks
for count in range(len(blocks)):
polygon = blocks[count]
print >>sys.stderr, "\rScoring %d of %d blocks..." % ((count+1), len(blocks)),
if not polygon.is_valid:
try:
polygon = polygon.buffer(0)
blocks[count] = polygon
except:
pass
if not polygon.is_valid:
continue
if polygon.is_empty: continue
if polygon.area > AREA_BOUND: continue
scores = score_block(polygon)
best, winner = scores[0]
if best > ACTION_THRESHOLD:
assigned_ct += 1
assigned_blocks.setdefault(winner, [])
assigned_blocks[winner].append(polygon)
else:
# if the block wasn't assigned hang onto the info about the winning nbhd
unassigned[count] = (best, winner)
print >>sys.stderr, "Done, assigned %d of %d blocks" % (assigned_ct, len(blocks))
new_threshold = ACTION_THRESHOLD
while float(assigned_ct)/len(blocks) < TARGET_ASSIGN_LEVEL and len(unassigned) > 0:
new_threshold -= 0.1
print >>sys.stderr, "\rDropping threshold to %f1.3... " % new_threshold
for blockindex in unassigned.keys():
best, winner = unassigned[blockindex]
#if blocks[blockindex].is_empty: del(unassigned[blockindex])
if best > new_threshold:
assigned_ct += 1
assigned_blocks.setdefault(winner, [])
assigned_blocks[winner].append(blocks[blockindex])
del unassigned[blockindex]
print >>sys.stderr, "Done, assigned %d of %d blocks" % (assigned_ct, len(blocks))
polygons = {}
count = 0
for place_id in places.keys():
count += 1
print >>sys.stderr, "\rMerging %d of %d boundaries..." % (count, len(places)),
if place_id not in assigned_blocks: continue
polygons[place_id] = cascaded_union(assigned_blocks[place_id])
print >>sys.stderr, "Done."
count = 0
orphans = []
for place_id, multipolygon in polygons.items():
count += 1
print >>sys.stderr, "\rRemoving %d orphans from %d of %d polygons..." % (len(orphans), count, len(polygons)),
if type(multipolygon) is not MultiPolygon: continue
polygon_count = [0] * len(multipolygon)
for i, polygon in enumerate(multipolygon.geoms):
prepared = prep(polygon)
for item in index.intersection(polygon.bounds):
item_id, point = points[item]
if item_id == place_id and prepared.intersects(point):
polygon_count[i] += 1
winner = max((c, i) for (i, c) in enumerate(polygon_count))[1]
polygons[place_id] = multipolygon.geoms[winner]
orphans.extend((place_id, p) for i, p in enumerate(multipolygon.geoms) if i != winner)
print >>sys.stderr, "Done."
count = 0
total = len(orphans)
retries = 0
unassigned = None
while orphans:
unassigned = []
for origin_id, orphan in orphans:
count += 1
changed = False
print >>sys.stderr, "\rReassigning %d of %d orphans..." % (count-retries, total),
for score, place_id in score_block(orphan):
if place_id not in polygons:
# Turns out we just wind up assigning tiny, inappropriate places
#polygons[place_id] = orphan
#changed = True
continue
elif place_id != origin_id and orphan.intersects(polygons[place_id]):
polygons[place_id] = polygons[place_id].union(orphan)
changed = True
if changed:
break
if not changed:
unassigned.append((origin_id, orphan))
retries += 1
if len(unassigned) == len(orphans):
# give up
break
orphans = unassigned
print >>sys.stderr, "%d retried, %d unassigned." % (retries, len(unassigned))
print >>sys.stderr, "Returning remaining orphans to original places."
for origin_id, orphan in orphans:
if orphan.intersects(polygons[origin_id]):
polygons[origin_id] = polygons[origin_id].union(orphan)
print >>sys.stderr, "Try to assign the holes to neighboring neighborhoods."
#merge the nbhds
city = cascaded_union(polygons.values())
#pull out any holes in the resulting Polygon/Multipolygon
if type(city) is Polygon:
over = [city]
elif type(city) is MultiPolygon:
over = city.geoms
else:
print >>sys.stderr, "\rcity is of type %s, wtf." % (type(city))
holes = []
for poly in over:
holes.extend((Polygon(LinearRing(interior.coords)) for interior in poly.interiors))
count = 0
total = len(holes)
retries = 0
unassigned = None
while holes:
unassigned = []
for hole in holes:
count += 1
changed = False
print >>sys.stderr, "\rReassigning %d of %d holes..." % (count-retries, total),
for score, place_id in score_block(hole):
if place_id not in polygons:
# Turns out we just wind up assigning tiny, inappropriate places
#nbhds[place_id] = hole
#changed = True
continue
elif hole.intersects(polygons[place_id]):
polygons[place_id] = polygons[place_id].union(hole)
changed = True
if changed:
break
if not changed:
unassigned.append(hole)
retries += 1
if len(unassigned) == len(holes):
# give up
break
holes = unassigned
print >>sys.stderr, "%d retried, %d unassigned." % (retries, len(unassigned))
print >>sys.stderr, "Buffering polygons."
for place_id, polygon in polygons.items():
if type(polygon) is Polygon:
polygon = Polygon(polygon.exterior.coords)
else:
bits = []
for p in polygon.geoms:
if type(p) is Polygon:
bits.append(Polygon(p.exterior.coords))
polygon = MultiPolygon(bits)
polygons[place_id] = polygon.buffer(0)
print >>sys.stderr, "Writing output."
features = []
for place_id, poly in polygons.items():
features.append({
"type": "Feature",
"id": place_id,
"geometry": poly.__geo_interface__,
"properties": {"woe_id": place_id, "name": names.get(place_id, "")}
})
collection = {
"type": "FeatureCollection",
"features": features
}
print json.dumps(collection)