Spaces:
Build error
Build error
File size: 2,553 Bytes
6250360 |
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 |
import numpy as np
from scipy.spatial import Delaunay
from .area_of_polygon import area_of_polygon_crd
import networkx as nx
def sqrt_sum(a, b):
x = (a[0]-b[0])
y = (a[1]-b[1])
return np.sqrt(x*x+y*y)
def shapeToSomePolygons(shape):
G = nx.Graph()
allnodes = set()
for line in shape:
G.add_nodes_from(line)
G.add_edge(line[0], line[1])
allnodes.add(line[0])
allnodes.add(line[1])
result = []
while allnodes:
node = allnodes.pop()
new_node = next(iter(G[node]), None)
if not new_node: continue
G.remove_edge(node, new_node)
temp = nx.shortest_path(G, node, new_node)
for j,t in enumerate(temp):
if t in allnodes:
allnodes.remove(t)
result.append(temp)
return result
def getAlfaShapes(pts,alfas=1):
tri_ind = [(0,1),(1,2),(2,0)]
tri = Delaunay(pts)
lenghts={}
for s in tri.simplices:
for ind in tri_ind:
a = pts[s[ind[0]]]
b = pts[s[ind[1]]]
# print('a---', a)
# print('b---', b)
line = (a, b)
# line = ((a[0], a[1]), (b[0], b[1]))
lenghts[line] = sqrt_sum(a, b)
ls = sorted(lenghts.values())
mean_length = np.mean(ls)
mean_length_index = ls.index(next(filter(lambda x: x>=mean_length, ls)))
magic_numbers = [ls[i] for i in range(mean_length_index, len(ls))]
magic_numbers[0] = 0
sum_magic = np.sum(magic_numbers)
for i in range(2, len(magic_numbers)):
magic_numbers[i] += magic_numbers[i-1]
magic_numbers = [m /sum_magic for m in magic_numbers]
rez = []
for alfa in alfas:
i = magic_numbers.index(next(filter(lambda z: z > alfa, magic_numbers), magic_numbers[-1]))
av_length = ls[mean_length_index+i]
lines = {}
for s in tri.simplices:
used = True
for ind in tri_ind:
if lenghts[(pts[s[ind[0]]], pts[s[ind[1]]])] > av_length:
used = False
break
if used == False: continue
for ind in tri_ind:
i,j= s[ind[0]],s[ind[1]]
line = (pts[min(i,j)], pts[max(i,j)])
lines[line] = line in lines
good_lines = []
for v in lines:
if not lines[v]:
good_lines.append(v)
result = shapeToSomePolygons(good_lines)
result.sort(key=area_of_polygon_crd, reverse=True)
rez.append(result)
return rez
|