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
|
from __future__ import absolute_import
import os
import random
import numpy as np
from numpy.testing import assert_almost_equal, assert_array_less
from .. import graph
from .. import great_circle_arc
from .. import polygon
from .. import vector
from .test_util import *
from .test_shared import resolve_imagename
graph.DEBUG = True
def test_normalize_vector():
x, y, z = np.ogrid[-100:100:11,-100:100:11,-100:100:11]
xyz = np.dstack((x.flatten(), y.flatten(), z.flatten()))[0]
xyzn = vector.normalize_vector(xyz)
l = np.sqrt(np.sum(xyzn * xyzn, axis=-1))
assert_almost_equal(l, 1.0)
def test_radec_to_vector():
npx, npy, npz = vector.radec_to_vector(np.arange(-360, 360, 1), 90)
assert_almost_equal(npx, 0.0)
assert_almost_equal(npy, 0.0)
assert_almost_equal(npz, 1.0)
spx, spy, spz = vector.radec_to_vector(np.arange(-360, 360, 1), -90)
assert_almost_equal(spx, 0.0)
assert_almost_equal(spy, 0.0)
assert_almost_equal(spz, -1.0)
eqx, eqy, eqz = vector.radec_to_vector(np.arange(-360, 360, 1), 0)
assert_almost_equal(eqz, 0.0)
def test_vector_to_radec():
ra, dec = vector.vector_to_radec(0, 0, 1)
assert_almost_equal(dec, 90)
ra, dec = vector.vector_to_radec(0, 0, -1)
assert_almost_equal(dec, -90)
ra, dec = vector.vector_to_radec(1, 1, 0)
assert_almost_equal(ra, 45.0)
assert_almost_equal(dec, 0.0)
def test_intersects_poly_simple():
ra1 = [-10, 10, 10, -10, -10]
dec1 = [30, 30, 0, 0, 30]
poly1 = polygon.SphericalPolygon.from_radec(ra1, dec1)
ra2 = [-5, 15, 15, -5, -5]
dec2 = [20, 20, -10, -10, 20]
poly2 = polygon.SphericalPolygon.from_radec(ra2, dec2)
assert poly1.intersects_poly(poly2)
# Make sure it isn't order-dependent
ra1 = ra1[::-1]
dec1 = dec1[::-1]
poly1 = polygon.SphericalPolygon.from_radec(ra1, dec1)
ra2 = ra2[::-1]
dec2 = dec2[::-1]
poly2 = polygon.SphericalPolygon.from_radec(ra2, dec2)
assert poly1.intersects_poly(poly2)
def test_intersects_poly_fully_contained():
ra1 = [-10, 10, 10, -10, -10]
dec1 = [30, 30, 0, 0, 30]
poly1 = polygon.SphericalPolygon.from_radec(ra1, dec1)
ra2 = [-5, 5, 5, -5, -5]
dec2 = [20, 20, 10, 10, 20]
poly2 = polygon.SphericalPolygon.from_radec(ra2, dec2)
assert poly1.intersects_poly(poly2)
# Make sure it isn't order-dependent
ra1 = ra1[::-1]
dec1 = dec1[::-1]
poly1 = polygon.SphericalPolygon.from_radec(ra1, dec1)
ra2 = ra2[::-1]
dec2 = dec2[::-1]
poly2 = polygon.SphericalPolygon.from_radec(ra2, dec2)
assert poly1.intersects_poly(poly2)
def test_hard_intersects_poly():
ra1 = [-10, 10, 10, -10, -10]
dec1 = [30, 30, 0, 0, 30]
poly1 = polygon.SphericalPolygon.from_radec(ra1, dec1)
ra2 = [-20, 20, 20, -20, -20]
dec2 = [20, 20, 10, 10, 20]
poly2 = polygon.SphericalPolygon.from_radec(ra2, dec2)
assert poly1.intersects_poly(poly2)
# Make sure it isn't order-dependent
ra1 = ra1[::-1]
dec1 = dec1[::-1]
poly1 = polygon.SphericalPolygon.from_radec(ra1, dec1)
ra2 = ra2[::-1]
dec2 = dec2[::-1]
poly2 = polygon.SphericalPolygon.from_radec(ra2, dec2)
assert poly1.intersects_poly(poly2)
def test_not_intersects_poly():
ra1 = [-10, 10, 10, -10, -10]
dec1 = [30, 30, 5, 5, 30]
poly1 = polygon.SphericalPolygon.from_radec(ra1, dec1)
ra2 = [-20, 20, 20, -20, -20]
dec2 = [-20, -20, -10, -10, -20]
poly2 = polygon.SphericalPolygon.from_radec(ra2, dec2)
assert not poly1.intersects_poly(poly2)
# Make sure it isn't order-dependent
ra1 = ra1[::-1]
dec1 = dec1[::-1]
poly1 = polygon.SphericalPolygon.from_radec(ra1, dec1)
ra2 = ra2[::-1]
dec2 = dec2[::-1]
poly2 = polygon.SphericalPolygon.from_radec(ra2, dec2)
assert not poly1.intersects_poly(poly2)
def test_point_in_poly():
point = np.asarray([-0.27475449, 0.47588873, -0.83548781])
points = np.asarray([[ 0.04821217, -0.29877206, 0.95310589],
[ 0.04451801, -0.47274119, 0.88007608],
[-0.14916503, -0.46369786, 0.87334649],
[-0.16101648, -0.29210164, 0.94273555],
[ 0.04821217, -0.29877206, 0.95310589]])
inside = np.asarray([-0.03416009, -0.36858623, 0.9289657])
poly = polygon.SphericalPolygon(points, inside)
assert not poly.contains_point(point)
def test_point_in_poly_lots():
from astropy.io import fits
fits = fits.open(resolve_imagename(ROOT_DIR, '1904-66_TAN.fits'))
header = fits[0].header
poly1 = polygon.SphericalPolygon.from_wcs(
header, 1, crval=[0, 87])
poly2 = polygon.SphericalPolygon.from_wcs(
header, 1, crval=[20, 89])
poly3 = polygon.SphericalPolygon.from_wcs(
header, 1, crval=[180, 89])
points = get_point_set()
count = 0
for point in points:
if poly1.contains_point(point) or poly2.contains_point(point) or \
poly3.contains_point(point):
count += 1
assert count == 5
assert poly1.intersects_poly(poly2)
assert not poly1.intersects_poly(poly3)
assert not poly2.intersects_poly(poly3)
def test_great_circle_arc_intersection():
A = [-10, -10]
B = [10, 10]
C = [-25, 10]
D = [15, -10]
E = [-20, 40]
F = [20, 40]
correct = [0.99912414, -0.02936109, -0.02981403]
A = vector.radec_to_vector(*A)
B = vector.radec_to_vector(*B)
C = vector.radec_to_vector(*C)
D = vector.radec_to_vector(*D)
E = vector.radec_to_vector(*E)
F = vector.radec_to_vector(*F)
assert great_circle_arc.intersects(A, B, C, D)
r = great_circle_arc.intersection(A, B, C, D)
assert r.shape == (3,)
assert_almost_equal(r, correct)
assert np.all(great_circle_arc.intersects([A], [B], [C], [D]))
r = great_circle_arc.intersection([A], [B], [C], [D])
assert r.shape == (1, 3)
assert_almost_equal(r, [correct])
assert np.all(great_circle_arc.intersects([A], [B], C, D))
r = great_circle_arc.intersection([A], [B], C, D)
assert r.shape == (1, 3)
assert_almost_equal(r, [correct])
assert not np.all(great_circle_arc.intersects([A, E], [B, F], [C], [D]))
r = great_circle_arc.intersection([A, E], [B, F], [C], [D])
assert r.shape == (2, 3)
assert_almost_equal(r[0], correct)
assert np.all(np.isnan(r[1]))
# Test parallel arcs
r = great_circle_arc.intersection(A, B, A, B)
assert np.all(np.isnan(r))
def test_great_circle_arc_length():
A = [90, 0]
B = [-90, 0]
A = vector.radec_to_vector(*A)
B = vector.radec_to_vector(*B)
assert great_circle_arc.length(A, B) == 180.0
A = [135, 0]
B = [-90, 0]
A = vector.radec_to_vector(*A)
B = vector.radec_to_vector(*B)
assert_almost_equal(great_circle_arc.length(A, B), 135.0)
A = [0, 0]
B = [0, 90]
A = vector.radec_to_vector(*A)
B = vector.radec_to_vector(*B)
assert_almost_equal(great_circle_arc.length(A, B), 90.0)
def test_great_circle_arc_angle():
A = [1, 0, 0]
B = [0, 1, 0]
C = [0, 0, 1]
assert great_circle_arc.angle(A, B, C) == 90.0
# TODO: More angle tests
def test_cone():
random.seed(0)
for i in range(50):
ra = random.randrange(-180, 180)
dec = random.randrange(20, 90)
cone = polygon.SphericalPolygon.from_cone(ra, dec, 8, steps=64)
def test_area():
triangles = [
([[90, 0], [0, -45], [0, 45], [90, 0]], np.pi * 0.5),
([[90, 0], [0, -22.5], [0, 22.5], [90, 0]], np.pi * 0.25),
([[90, 0], [0, -11.25], [0, 11.25], [90, 0]], np.pi * 0.125)
]
for tri, area in triangles:
tri = np.array(tri)
x, y, z = vector.radec_to_vector(tri[:,1], tri[:,0])
points = np.dstack((x, y, z))[0]
poly = polygon.SphericalPolygon(points)
calc_area = poly.area()
def test_fast_area():
a = np.array( # Clockwise
[[ 0.35327617, 0.6351561 , -0.6868571 ],
[ 0.35295533, 0.63510299, -0.68707112],
[ 0.35298984, 0.63505081, -0.68710162],
[ 0.35331262, 0.63510039, -0.68688987],
[ 0.35327617, 0.6351561 , -0.6868571 ]])
b = np.array([ # Clockwise
[ 0.35331737, 0.6351013 , -0.68688658],
[ 0.3536442 , 0.63515101, -0.68667239],
[ 0.35360581, 0.63521041, -0.68663722],
[ 0.35328338, 0.63515742, -0.68685217],
[ 0.35328614, 0.63515318, -0.68685467],
[ 0.35328374, 0.63515279, -0.68685627],
[ 0.35331737, 0.6351013 , -0.68688658]])
c = np.array([ # Counterclockwise
[ 0.35331737, 0.6351013 , -0.68688658],
[ 0.35328374, 0.63515279, -0.68685627],
[ 0.35328614, 0.63515318, -0.68685467],
[ 0.35328338, 0.63515742, -0.68685217],
[ 0.35360581, 0.63521041, -0.68663722],
[ 0.3536442 , 0.63515101, -0.68667239],
[ 0.35331737, 0.6351013 , -0.68688658]])
assert graph.Graph._fast_area(a) > 0
assert graph.Graph._fast_area(b) > 0
assert graph.Graph._fast_area(c) < 0
|
