-
Notifications
You must be signed in to change notification settings - Fork 25
/
core_grid.py
280 lines (256 loc) · 10.3 KB
/
core_grid.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
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
#!/usr/bin/env python
# -*- coding: utf-8 -*-
__author__ = ['Benjamin Dillenburger','Demetris Shammas','Mathias Bernhard']
__copyright__ = 'Copyright 2019 / Digital Building Technologies DBT / ETH Zurich'
__license__ = 'MIT License'
__email__ = ['<[email protected]>']
import math
from mola.core_mesh import Mesh
from mola.core_vertex import Vertex
from mola.core_face import Face
class GridManager:
"""
A `GridManager` is taking care of getting and setting values and
retrieving neighbors in an orthogonal grid of either 2 or 3 dimension.
Attributes
----------
nx, ny, nz : int
The number of elements in x,y and z direction.
"""
def __init__(self, nx, ny, nz=1):
self.nx = nx
self.ny = ny
self.nz = nz
self.length = nx * ny * nz
self.nyz = ny * nz
def get_index(self, x, y, z=0):
"""
returns the value at position x,y,z
"""
return x * self.nyz + y * self.nz + z
def get_x(self,index):
"""
returns the X coordinate of a specific index
"""
return index // self.nyz
def get_y(self,index):
"""
returns the Y coordinate of a specific index
"""
return (index // self.nz) % self.ny
def get_z(self,index):
"""
returns the Z coordinate of a specific index
"""
return index % self.nz
def get_neighbors_hex_2d(self,index,continuous=False):
"""
returns the 6 neighbor indices of a cell in a hexagonal grid
set `continuous` to `True` to get torus topology (left edge stitched to right and top to bottom)
"""
nbs = []
x = self.get_x(index)
y = self.get_y(index)
if not continuous:
if x < self.nx - 1:
nbs.append(self.get_index(x + 1, y))
if x > 0:
nbs.append(self.get_index(x - 1, y))
if y > 0:
nbs.append(self.get_index(x, y - 1))
if y < self.ny - 1:
nbs.append(self.get_index(x, y + 1))
if y % 2 == 0:
if x < self.nx - 1 and y < self.ny - 1:
nbs.append(self.get_index(x + 1, y + 1))
if x < self.nx - 1 and y > 0:
nbs.append(self.get_index(x + 1, y - 1))
else:
if x > 0 and y < self.ny - 1:
nbs.append(self.get_index(x - 1, y + 1))
if x > 0 and y > 0:
nbs.append(self.get_index(x - 1, y - 1))
else:
xNext = x + 1 if x < self.nx - 1 else 0
xPrev = x - 1 if x > 0 else self.nx - 1
yNext = y + 1 if y < self.ny - 1 else 0
yPrev = y - 1 if y > 0 else self.ny - 1
nbs.append(self.get_index(xNext, y))
nbs.append(self.get_index(xPrev, y))
nbs.append(self.get_index(x, yPrev))
nbs.append(self.get_index(x, yNext))
if y % 2 == 0:
nbs.append(self.get_index(xNext, yNext))
nbs.append(self.get_index(xNext, yPrev))
else:
nbs.append(self.get_index(xPrev, yNext))
nbs.append(self.get_index(xPrev, yPrev))
return nbs
def get_neighbors_2d(self,index,nbs8=False,continuous=False):
"""
returns the neighbor indices of a cell in an orthogonal grid
set `nbs8` to `True` to get 8 neighbors, default is 4
set `continuous` to `True` to get torus topology (left edge stitched to right and top to bottom)
"""
nbs = []
x = self.get_x(index)
y = self.get_y(index)
if not continuous:
if x < self.nx - 1:
nbs.append(self.get_index(x + 1, y))
if nbs8:
if x < self.nx - 1 and y < self.ny - 1:
nbs.append(self.get_index(x + 1, y + 1))
if y < self.ny - 1:
nbs.append(self.get_index(x, y + 1))
if nbs8:
if x > 0 and y < self.ny - 1:
nbs.append(self.get_index(x - 1, y + 1))
if x > 0:
nbs.append(self.get_index(x - 1, y))
if nbs8:
if x > 0 and y > 0:
nbs.append(self.get_index(x - 1, y - 1))
if y > 0:
nbs.append(self.get_index(x, y - 1))
if nbs8:
if x < self.nx - 1 and y > 0:
nbs.append(self.get_index(x + 1, y - 1))
else:
xPrev = x - 1 if x > 0 else self.nx - 1
xNext = x + 1 if x < self.nx - 1 else 0
yPrev = y - 1 if y > 0 else self.ny - 1
yNext = y + 1 if y < self.ny - 1 else 0
nbs.append(self.get_index(xNext, y))
if nbs8:
nbs.append(self.get_index(xNext, yNext))
nbs.append(self.get_index(x, yNext))
if nbs8:
nbs.append(self.get_index(xPrev, yNext))
nbs.append(self.get_index(xPrev, y))
if nbs8:
nbs.append(self.get_index(xPrev, yPrev))
nbs.append(self.get_index(x, yPrev))
if nbs8:
nbs.append(self.get_index(xNext, yPrev))
return nbs
def get_neighbors_3d(self, index, mode=3, continuous=False):
nbs = []
x = self.get_x(index)
y = self.get_y(index)
z = self.get_z(index)
# mode: neighbourhood type
# 1 : 6 nbs, shared face
# 2 : 18 nbs, shared face or edge
# 3 : 26 nbs, shared face, edge or vertex
if not mode:
mode==3
if mode<1:
mode==1
if mode>3:
mode==3
# precalculate distances
# dists = [1, math.sqrt(2), math.sqrt(3)]
# create a list of directions with x,y and z offsets
directions = []
for i in range(-1,2):
for j in range(-1,2):
for k in range(-1,2):
l = [i,j,k]
s = sum([abs(v) for v in l])
# check for neighbourhood type
if s > 0 and s <= mode:
directions.append(l)
for d in directions:
ex = x + d[0]
ey = y + d[1]
ez = z + d[2]
if continuous:
ex = ex % self.nx
ey = ey % self.ny
ez = ez % self.nz
if 0 <= ex < self.nx and 0 <= ey < self.ny and 0 <= ez < self.nz:
nbs.append(self.get_index(ex,ey,ez))
return nbs
class Grid(GridManager):
def __init__(self, nx, ny, nz=1, values=None):
super().__init__(nx, ny, nz)
# self.nx = nx
# self.ny = ny
# self.nz = nz
# self.nyz = ny * nz
if values is None:
self.values = [0] * nx * ny * nz
else:
self.values = values
def set_value_at_xyz(self, value, x, y, z=0):
self.values[self.get_index(x, y, z)] = value
def get_value_at_xyz(self, x, y, z=0):
return self.values[self.get_index(x, y, z)]
def set_value_at_index(self, value, index):
self.values[index] = value
def get_value_at_index(self, index):
return self.values[index]
def shortest_path(self, startindex, endindex, obstaclevalue):
# TODO
return []
def quad_mesh(self, functionIn, functionOut):
faces = []
for x in range(self.nx):
for y in range(self.ny):
for z in range(self.nz):
index=self.get_index(x,y,z)
if functionIn(self.values[index]):
# (x,y) (x1,y) (x1,y1) (x,y1)
if x == self.nx - 1 or functionOut(self.get_value_at_xyz(x + 1, y, z)):
v1 = Vertex(x + 1, y, z)
v2 = Vertex(x + 1, y + 1, z)
v3 = Vertex(x + 1, y + 1, z + 1)
v4 = Vertex(x + 1, y, z + 1)
faces.append(Face([v1, v2, v3, v4]))
if x == 0 or functionOut(self.get_value_at_xyz(x-1,y,z)):
v1 = Vertex(x, y + 1, z)
v2 = Vertex(x, y, z)
v3 = Vertex(x, y, z + 1)
v4 = Vertex(x, y + 1, z + 1)
faces.append(Face([v1, v2, v3, v4]))
if y == self.ny - 1 or functionOut(self.get_value_at_xyz(x, y + 1, z)):
v1 = Vertex(x + 1, y + 1, z)
v2 = Vertex(x, y + 1, z)
v3 = Vertex(x, y + 1, z + 1)
v4 = Vertex(x + 1, y + 1, z + 1)
faces.append(Face([v1, v2, v3, v4]))
if y == 0 or functionOut(self.get_value_at_xyz(x, y - 1, z)):
v1 = Vertex(x, y, z)
v2 = Vertex(x + 1, y, z)
v3 = Vertex(x + 1, y, z + 1)
v4 = Vertex(x, y, z + 1)
faces.append(Face([v1, v2, v3, v4]))
if z==self.nz-1 or functionOut(self.get_value_at_xyz(x, y, z + 1)):
v1 = Vertex(x, y, z + 1)
v2 = Vertex(x + 1, y, z + 1)
v3 = Vertex(x + 1, y + 1, z + 1)
v4 = Vertex(x, y + 1, z + 1)
faces.append(Face([v1, v2, v3, v4]))
if z == 0 or functionOut(self.get_value_at_xyz(x, y, z - 1)):
v1 = Vertex(x, y + 1, z)
v2 = Vertex(x + 1, y + 1, z)
v3 = Vertex(x + 1, y, z)
v4 = Vertex(x, y, z)
faces.append(Face([v1, v2, v3, v4]))
mesh = Mesh()
mesh.faces = faces
mesh.update_topology()
return mesh
class HexGrid(Grid):
def __init__(self, nx, ny, nz=1, values=None):
super().__init__(nx, ny, nz, values)
# self.ny = nx
# self.ny = ny
# self.nz = nz
# self.nyz = ny * nz
# if values == None:
# self.values = [0] * nx * ny * nz
self.dimy = math.sqrt(3) * 0.5
def get_position(self, x, y, z=0):
return [x + (y % 2) * 0.5, y * self.dimy, z]