mirror of
https://github.com/wassname/simpeg.git
synced 2026-06-29 11:51:35 +08:00
Rowan Cockett
417 lines
13 KiB
Python
417 lines
13 KiB
Python
import numpy as np, scipy.sparse as sp
|
|
from SimPEG.Utils import ndgrid, mkvc
|
|
|
|
|
|
NUM, PARENT, ACTIVE, EDIR, ENODE0, ENODE1 = range(6)
|
|
NUM, PARENT, ACTIVE, FDIR, FEDGE0, FEDGE1, FEDGE2, FEDGE3 = range(8)
|
|
NUM, PARENT, ACTIVE, CFACE0, CFACE1, CFACE2, CFACE3, CFACE4, CFACE5 = range(9)
|
|
|
|
def SortByX0(grid):
|
|
dtype=[('x',float),('y',float)]
|
|
grid2 = np.zeros(grid.shape[0], dtype=dtype)
|
|
grid2['x'][:] = grid[:,0]
|
|
grid2['y'][:] = grid[:,1]
|
|
P = np.argsort(grid2, order=['y','x'])
|
|
return P
|
|
|
|
|
|
class TreeMesh(object):
|
|
|
|
def __init__(self, hx, hy):
|
|
nx = np.r_[0,hx.cumsum()]
|
|
ny = np.r_[0,hy.cumsum()]
|
|
vnC = [nx.size-1, ny.size-1]
|
|
vnN = [nx.size, ny.size]
|
|
|
|
XY = ndgrid(nx, ny)
|
|
N = np.c_[np.arange(XY.shape[0]), XY]
|
|
|
|
N.astype([('num',int),('x',float),('y',float),('z',float)])
|
|
|
|
I = np.arange(nx.size * ny.size, dtype=int).reshape(vnN, order='F')
|
|
|
|
vEx = np.c_[mkvc(I[:-1,:]), mkvc(I[1:,:])]
|
|
vEy = np.c_[mkvc(I[:,:-1]), mkvc(I[:,1:])]
|
|
|
|
nEx = np.arange(vEx.shape[0], dtype=int).reshape(nx.size-1, ny.size, order='F')
|
|
nEy = np.arange(vEy.shape[0], dtype=int).reshape(nx.size, ny.size-1, order='F') + vEx.shape[0]
|
|
|
|
zEx = np.zeros(nEx.size, dtype=int)
|
|
zEy = np.zeros(nEy.size, dtype=int)
|
|
|
|
# # parent active dir, n1,n2
|
|
Ex = np.c_[mkvc(nEx), zEx-1, zEx+1, zEx+0, vEx]
|
|
Ey = np.c_[mkvc(nEy), zEy-1, zEy+1, zEy+1, vEy]
|
|
|
|
nC = np.arange(np.prod(vnC), dtype=int)
|
|
|
|
C = np.c_[nC, nC*0-1, nC*0+1, nC*0+2, mkvc(nEx[:,:-1]), mkvc(nEx[:,1:]), mkvc(nEy[:-1,:]), mkvc(nEy[1:,:])]
|
|
|
|
self._nodes = N
|
|
self._edges = np.r_[Ex, Ey]
|
|
self._faces = C
|
|
|
|
self.isNumbered = False
|
|
|
|
@property
|
|
def isNumbered(self):
|
|
return self._numberedCC and self._numberedFx and self._numberedFy
|
|
@isNumbered.setter
|
|
def isNumbered(self, value):
|
|
assert value is False, 'Can only set to False.'
|
|
self._numberedCC = False
|
|
self._numberedEx = False
|
|
self._numberedEy = False
|
|
|
|
@property
|
|
def dim(self):
|
|
return 2
|
|
|
|
def _push(self, attr, rows):
|
|
self.isNumbered = False
|
|
rows = np.atleast_2d(rows)
|
|
X = getattr(self, attr)
|
|
offset = X.shape[0]
|
|
rowNumer = np.arange(rows.shape[0], dtype=int) + offset
|
|
rows[:,0] = rowNumer*0-1
|
|
setattr(self, attr, np.vstack((X, rows)).astype(X.dtype))
|
|
if rows.shape[0] == 1:
|
|
return offset, rows.flatten()
|
|
return rowNumer, rows
|
|
|
|
def addNode(self, between):
|
|
"""Add a node between the node in list between"""
|
|
between = np.array(between).flatten()
|
|
nodes = self._nodes[between.astype(int), :]
|
|
newNode = np.mean(nodes, axis=0)
|
|
return self._push('_nodes', newNode)
|
|
|
|
def refineEdge(self, index):
|
|
e = self._edges[index,:]
|
|
self._edges[index, ACTIVE] = 0
|
|
|
|
newNode, node = self.addNode(e[[ENODE0, ENODE1]])
|
|
|
|
Es = np.zeros((2, 6))
|
|
Es[:, ACTIVE] = 1
|
|
Es[:, PARENT] = index
|
|
Es[:, EDIR] = e[EDIR]
|
|
Es[0, ENODE0] = e[ENODE0]
|
|
Es[0, ENODE1] = newNode
|
|
Es[1, ENODE0] = newNode
|
|
Es[1, ENODE1] = e[ENODE1]
|
|
return self._push('_edges', Es)
|
|
|
|
def refineFace(self, index):
|
|
f = self._faces[index,:]
|
|
nodeNums = self._edges[f[[FEDGE0, FEDGE1]],:][:,[ENODE0, ENODE1]]
|
|
|
|
self._faces[index, ACTIVE] = 0
|
|
|
|
# new faces and edges
|
|
# 2_______________3 _______________
|
|
# | e1--> | | | |
|
|
# ^ | | ^ | 2 3 3 | y z z
|
|
# | | | | | | | ^ ^ ^
|
|
# | | x | | ---> |---0---+---1---| | | |
|
|
# e2 | | e3 | | | | | |
|
|
# | | | 0 2 1 | z-----> x y-----> x x-----> y
|
|
# |_______________| |_______|_______|
|
|
# 0 e0--> 1
|
|
|
|
# Refine the outer edges
|
|
E0i, E0 = self.refineEdge(f[FEDGE0])
|
|
E1i, E1 = self.refineEdge(f[FEDGE1])
|
|
E2i, E2 = self.refineEdge(f[FEDGE2])
|
|
E3i, E3 = self.refineEdge(f[FEDGE3])
|
|
|
|
newNode, node = self.addNode(nodeNums)
|
|
|
|
# Refine the inner edges
|
|
nE = np.zeros((4,6))
|
|
nE[:, ACTIVE] = 1
|
|
nE[:, PARENT] = -1
|
|
nE[:, EDIR] = [0,0,1,1] if f[FDIR] == 2 else [0,0,2,2] if f[FDIR] == 1 else [1,1,2,2]
|
|
nE[0, ENODE0] = E2[0, ENODE1]
|
|
nE[0, ENODE1] = newNode
|
|
nE[1, ENODE0] = newNode
|
|
nE[1, ENODE1] = E3[0, ENODE1]
|
|
nE[2, ENODE0] = E0[0, ENODE1]
|
|
nE[2, ENODE1] = newNode
|
|
nE[3, ENODE0] = newNode
|
|
nE[3, ENODE1] = E1[0, ENODE1]
|
|
nEi, nE = self._push('_edges', nE)
|
|
|
|
# Add four new faces
|
|
Fs = np.zeros((4,8))
|
|
Fs[:, ACTIVE] = 1
|
|
Fs[:, PARENT] = index
|
|
Fs[:, FDIR] = f[FDIR]
|
|
|
|
fInds = [FEDGE0,FEDGE1,FEDGE2,FEDGE3]
|
|
Fs[0, fInds] = [E0i[0], nEi[0], E2i[0], nEi[2]]
|
|
Fs[1, fInds] = [E0i[1], nEi[1], nEi[2], E3i[0]]
|
|
Fs[2, fInds] = [nEi[0], E1i[0], E2i[1], nEi[3]]
|
|
Fs[3, fInds] = [nEi[1], E1i[1], nEi[3], E3i[1]]
|
|
|
|
return self._push('_faces', Fs)
|
|
|
|
@property
|
|
def nC(self):
|
|
if self.dim == 2:
|
|
return np.sum(self._faces[:,ACTIVE] == 1)
|
|
return np.sum(self._cells[:,ACTIVE] == 1)
|
|
|
|
@property
|
|
def nE(self):
|
|
return np.sum(self._edges[:,ACTIVE] == 1)
|
|
|
|
@property
|
|
def nF(self):
|
|
return np.sum(self._faces[:,ACTIVE] == 1)
|
|
|
|
@property
|
|
def nEx(self):
|
|
return np.sum((self._edges[:,ACTIVE] == 1) & (self._edges[:,EDIR] == 0))
|
|
|
|
@property
|
|
def nEy(self):
|
|
return np.sum((self._edges[:,ACTIVE] == 1) & (self._edges[:,EDIR] == 1))
|
|
|
|
@property
|
|
def nEz(self):
|
|
if self.dim == 2:
|
|
return None
|
|
return np.sum((self._edges[:,ACTIVE] == 1) & (self._edges[:,EDIR] == 2))
|
|
|
|
@property
|
|
def nFx(self):
|
|
if self.dim == 2:
|
|
return self.nEy
|
|
return np.sum((self._faces[:,ACTIVE] == 1) & (self._faces[:,FDIR] == 0))
|
|
|
|
@property
|
|
def nFy(self):
|
|
if self.dim == 2:
|
|
return self.nEx
|
|
return np.sum((self._faces[:,ACTIVE] == 1) & (self._faces[:,FDIR] == 1))
|
|
|
|
@property
|
|
def nFz(self):
|
|
if self.dim == 2:
|
|
return None
|
|
return np.sum((self._faces[:,ACTIVE] == 1) & (self._faces[:,FDIR] == 1))
|
|
|
|
@property
|
|
def area(self):
|
|
if getattr(self, '_area', None) is None:
|
|
|
|
N = self._nodes
|
|
E = self._edges
|
|
activeEdges = E[:,ACTIVE] == 1
|
|
e0xy = N[E[activeEdges,ENODE0],:][:,[1,2]]
|
|
e1xy = N[E[activeEdges,ENODE1],:][:,[1,2]]
|
|
|
|
self._area = np.sum((e1xy - e0xy)**2,axis=1)**0.5
|
|
|
|
return self._area
|
|
|
|
|
|
@property
|
|
def vol(self):
|
|
if getattr(self, '_vol', None) is None:
|
|
|
|
N = self._nodes
|
|
E = self._edges
|
|
C = self._faces
|
|
activeCells = C[:,ACTIVE] == 1
|
|
nInds1 = E[C[activeCells,FEDGE0],:][:,[ENODE0,ENODE1]]
|
|
nInds2 = E[C[activeCells,FEDGE1],:][:,[ENODE0,ENODE1]]
|
|
n0 = N[nInds1[:,0],:][:,[1,2]] # 2------3 3------2
|
|
n1 = N[nInds1[:,1],:][:,[1,2]] # | | --> | |
|
|
n3 = N[nInds2[:,0],:][:,[1,2]] # | | | |
|
|
n2 = N[nInds2[:,1],:][:,[1,2]] # 0------1 0------1
|
|
|
|
a = np.sum((n1 - n0)**2,axis=1)**0.5
|
|
b = np.sum((n2 - n1)**2,axis=1)**0.5
|
|
c = np.sum((n3 - n2)**2,axis=1)**0.5
|
|
d = np.sum((n0 - n3)**2,axis=1)**0.5
|
|
p = np.sum((n2 - n0)**2,axis=1)**0.5
|
|
q = np.sum((n3 - n1)**2,axis=1)**0.5
|
|
|
|
# Area of an arbitrary quadrilateral (in a plane)
|
|
self._vol = 0.25 * (4.0*(p**2)*(q**2) - (a**2 + c**2 - b**2 - d**2))**0.5
|
|
|
|
return self._vol
|
|
|
|
@property
|
|
def gridCC(self):
|
|
N = self._nodes
|
|
E = self._edges
|
|
C = self._faces
|
|
activeCells = C[:,ACTIVE] == 1
|
|
nInds1 = E[C[activeCells,FEDGE0],:][:,[ENODE0,ENODE1]]
|
|
nInds2 = E[C[activeCells,FEDGE1],:][:,[ENODE0,ENODE1]]
|
|
Cx = (N[nInds1[:,0],1] + N[nInds1[:,1],1] + N[nInds2[:,0],1] + N[nInds2[:,1],1])/4.0
|
|
Cy = (N[nInds1[:,0],2] + N[nInds1[:,1],2] + N[nInds2[:,0],2] + N[nInds2[:,1],2])/4.0
|
|
|
|
P = SortByX0(np.c_[N[nInds1[:,0],1], N[nInds1[:,0],2]])
|
|
if not self._numberedCC:
|
|
cnt = np.zeros(P.size, dtype=int)
|
|
cnt[P] = np.arange(P.size)
|
|
self._faces[activeCells, NUM] = cnt
|
|
self._numberedCC = True
|
|
|
|
return np.c_[Cx,Cy][P, :]
|
|
|
|
@property
|
|
def gridEx(self):
|
|
N = self._nodes
|
|
E = self._edges
|
|
C = self._faces
|
|
activeEdges = (E[:,ACTIVE] == 1) & (E[:,EDIR] == 0)
|
|
nInds = E[activeEdges,:][:,[ENODE0,ENODE1]]
|
|
Ex = (N[nInds[:,0],1] + N[nInds[:,1],1])/2.0
|
|
Ey = (N[nInds[:,0],2] + N[nInds[:,1],2])/2.0
|
|
|
|
P = SortByX0(np.c_[N[nInds[:,0],1], N[nInds[:,0],2]])
|
|
if not self._numberedEx:
|
|
cnt = np.zeros(P.size, dtype=int)
|
|
cnt[P] = np.arange(P.size)
|
|
self._edges[activeEdges, NUM] = cnt
|
|
self._numberedEx = True
|
|
|
|
return np.c_[Ex,Ey][P, :]
|
|
|
|
@property
|
|
def gridEy(self):
|
|
N = self._nodes
|
|
E = self._edges
|
|
C = self._faces
|
|
activeEdges = (E[:,ACTIVE] == 1) & (E[:,EDIR] == 1)
|
|
nInds = E[activeEdges,:][:,[ENODE0,ENODE1]]
|
|
Ex = (N[nInds[:,0],1] + N[nInds[:,1],1])/2.0
|
|
Ey = (N[nInds[:,0],2] + N[nInds[:,1],2])/2.0
|
|
|
|
P = SortByX0(np.c_[N[nInds[:,0],1], N[nInds[:,0],2]])
|
|
if not self._numberedEy:
|
|
cnt = np.zeros(P.size, dtype=int)
|
|
cnt[P] = np.arange(P.size)
|
|
self._edges[activeEdges, NUM] = cnt + self.nEx
|
|
self._numberedEy = True
|
|
|
|
return np.c_[Ex,Ey][P, :]
|
|
|
|
def _index(self, attr, index):
|
|
index = [index] if type(index) in [int, long] else list(index)
|
|
C = getattr(self, attr)
|
|
cSub = []
|
|
iSub = []
|
|
for I in index:
|
|
if C[I, ACTIVE] == 1:
|
|
iSub += [I]
|
|
cSub += [C[I, :]]
|
|
else:
|
|
subInds = np.argwhere(C[:,PARENT] == I).flatten()
|
|
i, c = self._index(attr, subInds)
|
|
iSub += i
|
|
cSub += [c]
|
|
return iSub, np.vstack(cSub)
|
|
|
|
@property
|
|
def faceDiv(self):
|
|
if getattr(self, '_faceDiv', None) is None:
|
|
self.number()
|
|
# TODO: Preallocate!
|
|
I, J, V = [], [], []
|
|
for cell in self.sortedCells:
|
|
faces = cell.faceDict
|
|
for face in faces:
|
|
j = faces[face].index
|
|
I += [cell.num]*len(j)
|
|
J += j
|
|
V += [-1 if 'm' in face else 1]*len(j)
|
|
VOL = self.vol
|
|
D = sp.csr_matrix((V,(I,J)), shape=(self.nC, self.nF))
|
|
S = self.area
|
|
self._faceDiv = Utils.sdiag(1/VOL)*D*Utils.sdiag(S)
|
|
return self._faceDiv
|
|
|
|
def number(self):
|
|
self._nodes[:,NUM] = -1
|
|
self._edges[:,NUM] = -1
|
|
self._faces[:,NUM] = -1
|
|
# self._cells[:,NUM] = -1
|
|
self.gridCC
|
|
self.gridEx
|
|
self.gridEy
|
|
|
|
def plotGrid(self, ax=None, text=True, showIt=False):
|
|
import matplotlib.pyplot as plt
|
|
|
|
|
|
axOpts = {'projection':'3d'} if self.dim == 3 else {}
|
|
if ax is None: ax = plt.subplot(111, **axOpts)
|
|
|
|
N = self._nodes
|
|
E = self._edges
|
|
C = self._faces
|
|
|
|
plt.plot(N[:,1], N[:,2], 'b.')
|
|
activeCells = C[:,ACTIVE] == 1
|
|
for FEDGE in [FEDGE0, FEDGE1, FEDGE2, FEDGE3]:
|
|
nInds = E[C[activeCells,FEDGE],:][:,[ENODE0,ENODE1]]
|
|
eX = np.c_[N[nInds[:,0],1], N[nInds[:,1],1], [np.nan]*nInds.shape[0]]
|
|
eY = np.c_[N[nInds[:,0],2], N[nInds[:,1],2], [np.nan]*nInds.shape[0]]
|
|
plt.plot(eX.flatten(), eY.flatten(), 'b-')
|
|
|
|
gridCC = self.gridCC
|
|
# if text:
|
|
# [ax.text(cc[0], cc[1],i) for i, cc in enumerate(gridCC)]
|
|
plt.plot(gridCC[:,0], gridCC[:,1], 'r.')
|
|
gridFx = self.gridEy
|
|
gridFy = self.gridEx
|
|
# if text:
|
|
# [ax.text(cc[0], cc[1],i) for i, cc in enumerate(np.vstack((gridFx,gridFy)))]
|
|
gridEx = self.gridEx
|
|
gridEy = self.gridEy
|
|
# if text:
|
|
# [ax.text(cc[0], cc[1],i) for i, cc in enumerate(np.vstack((gridEx,gridEy)))]
|
|
|
|
for E in self._edges:
|
|
if E[ACTIVE] == 0: continue
|
|
ex = N[E[[ENODE0,ENODE1]],1]
|
|
ey = N[E[[ENODE0,ENODE1]],2]
|
|
ax.plot(ex, ey, 'b-')
|
|
ax.text(ex.mean(), ey.mean(), E[NUM])
|
|
|
|
if showIt:
|
|
plt.show()
|
|
|
|
if __name__ == '__main__':
|
|
from SimPEG import Mesh, Utils
|
|
import matplotlib.pyplot as plt
|
|
|
|
tM = TreeMesh(np.ones(3),np.ones(2))
|
|
|
|
tM.refineFace(0)
|
|
tM.refineFace(9)
|
|
|
|
# print tM._faces
|
|
# print tM._edges[0,:]
|
|
# print tM.area
|
|
|
|
|
|
tM.number()
|
|
print tM._index('_edges',3)[1]
|
|
|
|
# print tM._edges[:,[0,1,3, 4,5 ]]
|
|
|
|
tM.plotGrid()
|
|
# plt.figure(2)
|
|
# plt.plot(SortByX0(tM.gridCC),'b.')
|
|
plt.show()
|
|
|
|
|
|
|