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
|
import csv
import math
import operator
import os
import re
from collections import deque
import matplotlib.pyplot as plot
def load(directory):
def _read(iterable):
for x, y in iterable:
yield float(x), float(y)
def _load(filename):
with open(filename) as fd:
reader = csv.reader(fd)
return list(_read(reader))
def _files(directory):
for file in os.listdir(directory):
match = re.match(r"SWI_(-?\d+)\.csv", file)
if match:
yield int(match.group(1)), os.path.join(directory, file)
return [(x, _load(y)) for x, y in sorted(_files(directory), key=lambda x: x[0])]
def increment(x):
return x + 1
def decrement(x):
return x - 1
def find_boundary_curves(swis, x, y):
segments = deque()
for index, data in swis:
width = data[-1][0] - data[0][0]
relative = x - data[0][0]
candidate = math.floor(relative / width * len(data)) + 1
condition = operator.lt if data[candidate][0] > x else operator.gt
step = decrement if data[candidate][0] > x else increment
j = candidate
i = candidate
while not condition(data[i][0], x):
j = i
i = step(i)
if i > j:
i, j = j, i
if data[i][1] > y and data[j][1] > y:
segments.append((index, data, i, j))
break
if data[i][1] < y and data[j][1] < y:
if segments:
segments.popleft()
segments.append((index, data, i, j))
return segments
swis = load("dataset")
x = 16.61
y = 8600
segments = find_boundary_curves(swis, x, y)
plot.plot([x], [y], "rx")
for index, data, i, j in segments:
plot.plot([x[0] for x in data], [x[1] for x in data], ".")
plot.show()
|
