forked from TargaryenGitHub/mscThesis_HaoxiangWu
-
Notifications
You must be signed in to change notification settings - Fork 0
/
LineGroupingFromSHP.py
217 lines (160 loc) · 7.56 KB
/
LineGroupingFromSHP.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
import math
import shapefile
from shapely.geometry import Point
from shapely.geometry import LineString
from shapely.geometry import Polygon
from shapely.geometry import polygon
from fix_drafting_errors import fix_disjoint_vertices
def LineGroupingFromSHP(abs_file_path, MINIMALDIST):
sf = shapefile.Reader(abs_file_path)
#------------------------ read lines from shapefile ---------------------------
chains=[]
for geom in sf.shapeRecords():
chain=[(geom.shape.points[0][0],geom.shape.points[0][1]),(geom.shape.points[1][0],geom.shape.points[1][1])]
chains.append(chain)
#------------------------------------------------------------------------------
#------------------ group lines & fix unconnected vertices --------------------
closed_chains=[]
k=1
RADIUS=MINIMALDIST
print '#-----------------------------'
print 'k=', k, 'RADIUS=', RADIUS
print 'len(chains)', len(chains)
print 'len(closed_chains)', len(closed_chains)
while (k<=5 and len(chains)>0):
if len(chains)==1:
pt11=Point(chains[0][0][0], chains[0][0][1])
pt12=Point(chains[0][-1][0],chains[0][-1][1])
if pt11.distance(pt12)<=RADIUS:
chains.pop(0)
l1=LineString([chain1[0], chain1[1]])
l2=LineString([chain1[-1], chain1[-2]])
new_pts1=fix_disjoint_vertices(l1, l2)
new_chain=chain1[1:-1]+new_pts1
closed_chains.append(new_chain)
break
else:
print 'wawawa'
k=k+1
RADIUS=RADIUS+MINIMALDIST
print '#-----------------------------'
print 'k=', k, 'RADIUS=', RADIUS
print 'len(chains)', len(chains)
print 'len(closed_chains)', len(closed_chains)
break
L=len(chains)
for i in range(0, len(chains)-1):
chain1=chains[i]
pt11=Point(chain1[0][0], chain1[0][1])
pt12=Point(chain1[-1][0],chain1[-1][1])
if pt11.distance(pt12)<=RADIUS:
chains.pop(i)
l1=LineString([chain1[0], chain1[1]])
l2=LineString([chain1[-1], chain1[-2]])
new_pts1=fix_disjoint_vertices(l1, l2)
new_chain=chain1[1:-1]+new_pts1
closed_chains.append(new_chain)
break
for j in range(i+1, len(chains)+1):
if j==len(chains):
break
chain2=chains[j]
pt21=Point(chain2[0][0], chain2[0][1])
pt22=Point(chain2[-1][0],chain2[-1][1])
if pt11.distance(pt21)<=RADIUS:
l1=LineString([chain1[0], chain1[1]])
l2=LineString([chain2[0], chain2[1]])
new_pts1=fix_disjoint_vertices(l1, l2)
if pt12.distance(pt22)<=RADIUS:
# closed
l1=LineString([chain1[-1], chain1[-2]])
l2=LineString([chain2[-1], chain2[-2]])
new_pts2=fix_disjoint_vertices(l1, l2)
chains.pop(j)
chains.pop(i)
chain1.reverse()
new_chain=new_pts2+chain1[1:-1]+new_pts1+chain2[1:-1]
closed_chains.append(new_chain)
break
else:
chains.pop(j)
chains.pop(i)
chain1.reverse()
new_chain=chain1[0:-1]+new_pts1+chain2[1:]
chains.append(new_chain)
break
elif pt11.distance(pt22)<=RADIUS:
l1=LineString([chain1[0], chain1[1]])
l2=LineString([chain2[-1], chain2[-2]])
new_pts1=fix_disjoint_vertices(l1, l2)
if pt12.distance(pt21)<=RADIUS:
# closed
l1=LineString([chain1[-1], chain1[-2]])
l2=LineString([chain2[0], chain2[1]])
new_pts2=fix_disjoint_vertices(l1, l2)
chains.pop(j)
chains.pop(i)
new_chain=new_pts1+chain1[1:-1]+new_pts2+chain2[1:-1]
closed_chains.append(new_chain)
break
else:
chains.pop(j)
chains.pop(i)
new_chain=chain2[0:-1]+new_pts1+chain1[1:]
chains.append(new_chain)
break
elif pt12.distance(pt21)<=RADIUS:
l1=LineString([chain1[-1], chain1[-2]])
l2=LineString([chain2[0], chain2[1]])
new_pts1=fix_disjoint_vertices(l1, l2)
chains.pop(j)
chains.pop(i)
new_chain=chain1[0:-1]+new_pts1+chain2[1:]
chains.append(new_chain)
break
elif pt12.distance(pt22)<=RADIUS:
l1=LineString([chain1[-1], chain1[-2]])
l2=LineString([chain2[-1], chain2[-2]])
new_pts1=fix_disjoint_vertices(l1, l2)
chains.pop(j)
chains.pop(i)
chain2.reverse()
new_chain=chain1[0:-1]+new_pts1+chain2[1:]
chains.append(new_chain)
break
else:
continue
if j==L:
continue
else:
break
if i==L-2 and j==L:
print 'hahaha'
k=k+1
RADIUS=RADIUS+MINIMALDIST
print '#-----------------------------'
print 'k=', k, 'RADIUS=', RADIUS
print 'len(chains)', len(chains)
print 'len(closed_chains)', len(closed_chains)
else:
continue
print '#-----------------------------'
print 'len(chains)', len(chains)
print 'len(closed_chains)', len(closed_chains)
#------------------------------------------------------------------------------
#------------------------------------------------------------------------------
groups_P=[]
for i in range(0, len(closed_chains)):
if len(closed_chains[i])>2:
if Polygon(closed_chains[i]).is_valid==True:
ply=Polygon(closed_chains[i])
new_ply=polygon.orient(ply, sign=1.0)
groups_P.append(list(new_ply.exterior.coords)[0:-1])
else:
ply=Polygon(closed_chains[i]).buffer(0).exterior.coords
new_ply=polygon.orient(ply, sign=1.0)
groups_P.append(list(new_ply.exterior.coords)[0:-1])
else:
print 'closed_chains ',i,' only has two points'
return groups_P
#------------------------------------------------------------------------------