forked from mpetroff/qgsazimuth
-
Notifications
You must be signed in to change notification settings - Fork 0
/
utils.py
246 lines (199 loc) · 6.26 KB
/
utils.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
__author__ = "Nathan.Woodrow"
import math
from qgis.core import QgsPointXY, QgsFeature, QgsGeometry, QgsMessageLog
from collections import namedtuple
def azimuth_from_line(geometry):
line = geometry.asPolyline()
p1 = line[0]
p2 = line[1]
az = p1.azimuth(p2)
return az
def createpoints(points):
for point in points:
geom = QgsGeometry.fromPointXY(point)
feature = QgsFeature()
feature.setGeometry(geom)
yield feature
def createline(points):
"""
Creata a line feature from a list of points
:param points: List of QgsPointsXY
"""
geom = QgsGeometry.fromPolylineXY(points)
feature = QgsFeature()
feature.setGeometry(geom)
return feature
def createpolygon(polygon):
"""
Create a polygon from a list of points
:param points: List of QgsPoints
"""
geom = QgsGeometry.fromPolygonXY(polygon)
if not geom:
return None
feature = QgsFeature()
feature.setGeometry(geom)
return feature
class Point(QgsPointXY):
def __init__(self, x, y, z=0, arc_point=False):
QgsPointXY.__init__(self, x, y)
self.arc_point = arc_point
self.z = z
@property
def x(self):
return QgsPointXY.x(self)
@property
def y(self):
return QgsPointXY.y(self)
def to_qgspoints(points, repeatfirst=False):
"""
Generate a QgsPointXY list from a list of x,y pairs
:param repeatfirst: Repeat the first item in the list for each other point
:return:
"""
if not repeatfirst:
# Just return a full list like normal
return [QgsPointXY(point[0], point[1]) for point in points]
else:
pointlist = []
# Pop the first point
points = iter(points)
v0 = next(points)
v0 = QgsPointXY(v0[0], v0[1])
# Loop the rest
for point in points:
p = QgsPointXY(point[0], point[1])
pointlist.append(v0)
pointlist.append(p)
return pointlist
def pairs(points, matchtail):
"""
Return a list of pairs from a list of points
:param matchtail: The HEAD of the next pair will be the TAIL of the current pair e.g pair[1] == next[0]
:param points: List of points to process
:return:
"""
if matchtail:
it = zip(points, points[1:])
else:
it = zip(points[::2], points[1::2])
for start, end in it:
yield [start, end]
def nextvertex(reference_point, distance, angle, zenith_angle=90, arc_point=False):
"""
Return the next vertex given a start, angle, distance.
:param reference_point: Start point
:param distance: Distance to the next vertex
:param angle: Angle is assumed to already include north correction
:param zenith_angle: Zenith angle for height correction
:return: A tuple of x,y,z for the next point.
"""
angle = math.radians(angle)
zenith_angle = math.radians(zenith_angle)
d1 = distance * math.sin(zenith_angle)
x = reference_point.x + d1 * math.sin(angle)
y = reference_point.y + d1 * math.cos(angle)
z = reference_point.z + distance * math.cos(zenith_angle)
return Point(x, y, z, arc_point)
def arc_length(radius, c_angle):
"""
The length of the total arc given the radius and central angle.
:param radius: Radius
:param c_angle: Central angle of the circle
:return: The length of the arc
"""
return 2 * math.pi * radius * (c_angle / 360)
def points_on_arc(count, center, radius, start, end):
pass
def dmsToDd(dms):
"It's not fast, but it's a safe way of dealing with DMS"
# dms=dms.replace(" ", "")
if isinstance(dms, float):
return dms
for c in dms:
if (not c.isdigit()) and (c != ".") and (c != "-"):
dms = dms.replace(c, ";")
while dms.find(";;") >= 0:
dms = dms.replace(";;", ";")
if dms[0] == ";":
dms = dms[1:]
dms = dms.split(";")
dd = 0
# dd=str(float(dms[0])+float(dms[1])/60+float(dms[2])/3600)
for row, f in enumerate(dms):
if f != "":
dd += float(f) / pow(60, row)
return dd
def gradianToDd(gradian):
factor = 1
out = ""
for c in gradian:
if c in "cC":
factor *= 0.01
if c.isdigit() or c in ".-":
out += c
return float(out) * factor * 0.9
def angle_to(p1, p2):
xDiff = p1.x - p2.x
yDiff = p1.y - p2.y
rads = math.atan2(xDiff, yDiff)
angle = math.degrees(rads)
if angle < 0:
angle += 360
return angle
def calculate_center(start, end, radius, distance, direction):
def func(diff):
half = distance / 2
result = math.sqrt(radius ** 2 - half ** 2) * diff / distance
if direction == Direction.ANTICLOCKWISE:
result *= -1
return result
midpoint = calculate_midpoint(start, end)
return Point(midpoint.x - func(start.y - end.y), midpoint.y - func(end.x - start.x))
def calculate_midpoint(start, end):
midpoint = Point((start.x + end.x) / 2, (start.y + end.y) / 2)
return midpoint
class Direction(object):
CLOCKWISE = 0
ANTICLOCKWISE = 1
@classmethod
def resolve(cls, value):
if value == "a" or value == "anticlockwise":
return Direction.ANTICLOCKWISE
else:
return Direction.CLOCKWISE
def arc_points(
start,
end,
distance,
radius,
point_count=20,
direction=Direction.CLOCKWISE,
zenith_angle=90,
):
center = calculate_center(start, end, radius, distance, direction)
first_angle = angle_to(start, center)
last_angle = angle_to(end, center)
if direction == Direction.ANTICLOCKWISE:
last_angle, first_angle = first_angle, last_angle
if first_angle < last_angle:
sweep = last_angle - first_angle
elif first_angle > last_angle:
last_angle += 360
sweep = last_angle - first_angle
else:
sweep = 0
alpha = sweep / float(point_count)
if sweep < 0:
alpha *= -1.0
print("First:", first_angle)
print("Last:", last_angle)
print("Sweep", sweep)
print("Alpha", alpha)
a = first_angle
for i in range(point_count + 1):
a += alpha
if not a >= last_angle and not a <= first_angle:
yield nextvertex(
center, radius, a, zenith_angle=zenith_angle, arc_point=True
)