-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathmod_cell_2D.f90
518 lines (453 loc) · 20.2 KB
/
mod_cell_2D.f90
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
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
module mod_cell_2D
use mod_read_gmsh
use mod_point_util
implicit none
type face
type(point) :: p1,p2
integer(4) :: bc_typ = 0
integer(4) :: idface = 0
real(8) :: area = 0.0d0
type(point) :: centroid
end type face
type cell_2D
integer(4) :: ident = 0
type(point) :: vertex(4)
type(face),dimension(4) :: faces
type(cell_2D),pointer :: neighbor1 => null()
type(cell_2D),pointer :: neighbor2 => null()
type(cell_2D),pointer :: neighbor3 => null()
type(cell_2D),pointer :: neighbor4 => null()
real(8) :: vol = 0.0d0
end type cell_2D
type list_cell_2D
type(cell_2D),pointer :: p
end type
type(list_cell_2D),dimension(:),allocatable :: cell
integer(4) :: nbfaces
private :: sort_vertex
contains
!----------------------------------------------------------------------
subroutine construct_cells
implicit none
integer(4) :: i,j
integer(4) :: idnode
integer(4) :: idnode1, idnode2
type(cell_2D), pointer :: pcell
type(node_ident_msh), pointer :: pmsh
allocate(cell(1:nbelm))
do i = 1, nbelm
allocate(cell(i)%p)
end do
! Assign vertexes of a cell
do i = 1, nbelm
cell(i)%p%ident = i
cell(i)%p%vertex(1)%ident = id_nodes(i)%pn%id_node(6)
idnode = cell(i)%p%vertex(1)%ident
do j = 1, nbnode
if (idnode == coord_nodes(j)%p%ident) then
cell(i)%p%vertex(1)%x = coord_nodes(j)%p%x
cell(i)%p%vertex(1)%y = coord_nodes(j)%p%y
end if
end do
cell(i)%p%vertex(2)%ident = id_nodes(i)%pn%id_node(7)
idnode = cell(i)%p%vertex(2)%ident
do j = 1, nbnode
if (idnode == coord_nodes(j)%p%ident) then
cell(i)%p%vertex(2)%x = coord_nodes(j)%p%x
cell(i)%p%vertex(2)%y = coord_nodes(j)%p%y
end if
end do
cell(i)%p%vertex(3)%ident = id_nodes(i)%pn%id_node(8)
idnode = cell(i)%p%vertex(3)%ident
do j = 1, nbnode
if (idnode == coord_nodes(j)%p%ident) then
cell(i)%p%vertex(3)%x = coord_nodes(j)%p%x
cell(i)%p%vertex(3)%y = coord_nodes(j)%p%y
end if
end do
cell(i)%p%vertex(4)%ident = id_nodes(i)%pn%id_node(9)
idnode = cell(i)%p%vertex(4)%ident
do j = 1, nbnode
if (idnode == coord_nodes(j)%p%ident) then
cell(i)%p%vertex(4)%x = coord_nodes(j)%p%x
cell(i)%p%vertex(4)%y = coord_nodes(j)%p%y
end if
end do
end do
! Sort vertexes for each cell
! sort_vertex failed
!do i = 1, nbelm
! call sort_vertex(cell(i)%p%vertex)
!enddo
! Assign faces for each cell
do i = 1, nbelm
cell(i)%p%faces(1)%p1%x = cell(i)%p%vertex(1)%x
cell(i)%p%faces(1)%p1%y = cell(i)%p%vertex(1)%y
cell(i)%p%faces(1)%p2%x = cell(i)%p%vertex(2)%x
cell(i)%p%faces(1)%p2%y = cell(i)%p%vertex(2)%y
cell(i)%p%faces(2)%p1%x = cell(i)%p%vertex(2)%x
cell(i)%p%faces(2)%p1%y = cell(i)%p%vertex(2)%y
cell(i)%p%faces(2)%p2%x = cell(i)%p%vertex(3)%x
cell(i)%p%faces(2)%p2%y = cell(i)%p%vertex(3)%y
cell(i)%p%faces(3)%p1%x = cell(i)%p%vertex(3)%x
cell(i)%p%faces(3)%p1%y = cell(i)%p%vertex(3)%y
cell(i)%p%faces(3)%p2%x = cell(i)%p%vertex(4)%x
cell(i)%p%faces(3)%p2%y = cell(i)%p%vertex(4)%y
cell(i)%p%faces(4)%p1%x = cell(i)%p%vertex(4)%x
cell(i)%p%faces(4)%p1%y = cell(i)%p%vertex(4)%y
cell(i)%p%faces(4)%p2%x = cell(i)%p%vertex(1)%x
cell(i)%p%faces(4)%p2%y = cell(i)%p%vertex(1)%y
end do
! Assign boundary condition for each face of a cell
do i = 1, nbelm
pcell => cell(i)%p
idnode1 = pcell%vertex(1)%ident
idnode2 = pcell%vertex(2)%ident
loop_msh1: do j = 1, nbel_msh
pmsh => id_nodes_msh(j)%pn
if (pmsh%elem_typ == 27) then ! I write a solver for NACA 0012 HIOCFD firstly
if (idnode1 == pmsh%id_node(6) .and. idnode2 == pmsh%id_node(7)) then
pcell%faces(1)%bc_typ = pmsh%tag1
cycle loop_msh1
else if (idnode1 == pmsh%id_node(7) .and. idnode2 == pmsh%id_node(6)) then
pcell%faces(1)%bc_typ = pmsh%tag1
cycle loop_msh1
endif
endif
enddo loop_msh1
idnode1 = pcell%vertex(2)%ident
idnode2 = pcell%vertex(3)%ident
loop_msh2: do j = 1, nbel_msh
pmsh => id_nodes_msh(j)%pn
if (pmsh%elem_typ == 27) then ! I write a solver for NACA 0012 HIOCFD firstly
if (idnode1 == pmsh%id_node(6) .and. idnode2 == pmsh%id_node(7)) then
pcell%faces(2)%bc_typ = pmsh%tag1
cycle loop_msh2
else if (idnode1 == pmsh%id_node(7) .and. idnode2 == pmsh%id_node(6)) then
pcell%faces(2)%bc_typ = pmsh%tag1
cycle loop_msh2
endif
endif
enddo loop_msh2
idnode1 = pcell%vertex(3)%ident
idnode2 = pcell%vertex(4)%ident
loop_msh3: do j = 1, nbel_msh
pmsh => id_nodes_msh(j)%pn
if (pmsh%elem_typ == 27) then ! I write a solver for NACA 0012 HIOCFD firstly
if (idnode1 == pmsh%id_node(6) .and. idnode2 == pmsh%id_node(7)) then
pcell%faces(3)%bc_typ = pmsh%tag1
cycle loop_msh3
else if (idnode1 == pmsh%id_node(7) .and. idnode2 == pmsh%id_node(6)) then
pcell%faces(3)%bc_typ = pmsh%tag1
cycle loop_msh3
endif
endif
enddo loop_msh3
idnode1 = pcell%vertex(4)%ident
idnode2 = pcell%vertex(1)%ident
loop_msh4: do j = 1, nbel_msh
pmsh => id_nodes_msh(j)%pn
if (pmsh%elem_typ == 27) then ! I write a solver for NACA 0012 HIOCFD firstly
if (idnode1 == pmsh%id_node(6) .and. idnode2 == pmsh%id_node(7)) then
pcell%faces(4)%bc_typ = pmsh%tag1
cycle loop_msh4
else if (idnode1 == pmsh%id_node(7) .and. idnode2 == pmsh%id_node(6)) then
pcell%faces(4)%bc_typ = pmsh%tag1
cycle loop_msh4
endif
endif
enddo loop_msh4
enddo
end subroutine
!----------------------------------------------------------------------
subroutine calcul_vol_cells
implicit none
integer :: i
type(cell_2D), pointer :: pc
real(8) :: vol, x1, x2, x3, x4, y1, y2, y3, y4
do i = 1, nbelm
pc => cell(i)%p
x1 = pc%vertex(1)%x
x2 = pc%vertex(2)%x
x3 = pc%vertex(3)%x
x4 = pc%vertex(4)%x
y1 = pc%vertex(1)%y
y2 = pc%vertex(2)%y
y3 = pc%vertex(3)%y
y4 = pc%vertex(4)%y
vol = 0.5d0 * ( (x1 - x3)*(y2 - y4) + (x4 - x2)*(y1 - y3) )
pc%vol = vol
enddo
end subroutine calcul_vol_cells
!----------------------------------------------------------------------
subroutine calcul_area_cent_faces
use mod_vector_algebra
implicit none
integer :: i, j
type(cell_2D), pointer :: pcel
type(face), pointer :: pfac
type(vector_t) :: vec
do i = 1, nbelm
pcel => cell(i)%p
do j = 1, 4
pfac => pcel%faces(j)
vec = vector_t( pfac%p1%x - pfac%p2%x, pfac%p1%y - pfac%p2%y, 0.0d0 )
pfac%area = .abs.(vec)
pfac%centroid%x = 0.5d0 * (pfac%p1%x + pfac%p2%x)
pfac%centroid%y = 0.5d0 * (pfac%p1%y + pfac%p2%y)
enddo
enddo
end subroutine calcul_area_cent_faces
!----------------------------------------------------------------------
subroutine assign_id_face
use mod_point_util
implicit none
integer :: i, j, k
type(cell_2D), pointer :: pc, pc2
type(face), pointer :: pfac, pfac2
nbfaces = 0
do i = 1, nbelm
pc => cell(i)%p
pfac => pc%faces(1)
if (pfac%idface == 0) then ! a face that has not been indexed yet
if (associated(pc%neighbor1)) then
pc2 => pc%neighbor1
if (associated(pc%neighbor1%neighbor3, pc)) then
if (pfac%bc_typ == 0) then ! normal face
pfac2 => pc2%faces(3)
if ((pfac%centroid .eq. pfac2%centroid) .and. abs(pfac%area - pfac2%area) <= 1.0d-9) then
if (pfac2%idface == 0) then
nbfaces = nbfaces + 1
pfac%idface = nbfaces
pfac2%idface = nbfaces
endif
endif
endif
endif
else if (.not. associated(pc%neighbor1)) then
if (pfac%bc_typ /= 0) then ! boundary face
nbfaces = nbfaces + 1
pfac%idface = nbfaces
endif
endif
endif
pfac => pc%faces(2)
if (pfac%idface == 0) then ! a face that has not been indexed yet
if (associated(pc%neighbor2)) then
pc2 => pc%neighbor2
if (associated(pc%neighbor2%neighbor4, pc)) then
if (pfac%bc_typ == 0) then ! normal face
pfac2 => pc2%faces(4)
if ((pfac%centroid .eq. pfac2%centroid) .and. abs(pfac%area - pfac2%area) <= 1.0d-9) then
if (pfac2%idface == 0) then
nbfaces = nbfaces + 1
pfac%idface = nbfaces
pfac2%idface = nbfaces
endif
endif
endif
endif
else if (.not. associated(pc%neighbor2)) then
if (pfac%bc_typ /= 0) then ! boundary face
nbfaces = nbfaces + 1
pfac%idface = nbfaces
endif
endif
endif
pfac => pc%faces(3)
if (pfac%idface == 0) then ! a face that has not been indexed yet
if (associated(pc%neighbor3)) then
pc2 => pc%neighbor3
if (associated(pc%neighbor3%neighbor1, pc)) then
if (pfac%bc_typ == 0) then ! normal face
pfac2 => pc2%faces(1)
if ((pfac%centroid .eq. pfac2%centroid) .and. abs(pfac%area - pfac2%area) <= 1.0d-9) then
if (pfac2%idface == 0) then
nbfaces = nbfaces + 1
pfac%idface = nbfaces
pfac2%idface = nbfaces
endif
endif
endif
endif
else if (.not. associated(pc%neighbor3)) then
if (pfac%bc_typ /= 0) then ! boundary face
nbfaces = nbfaces + 1
pfac%idface = nbfaces
endif
endif
endif
pfac => pc%faces(4)
if (pfac%idface == 0) then ! a face that has not been indexed yet
if (associated(pc%neighbor4)) then
pc2 => pc%neighbor4
if (associated(pc%neighbor4%neighbor2, pc)) then
if (pfac%bc_typ == 0) then ! normal face
pfac2 => pc2%faces(2)
if ((pfac%centroid .eq. pfac2%centroid) .and. abs(pfac%area - pfac2%area) <= 1.0d-9) then
if (pfac2%idface == 0) then
nbfaces = nbfaces + 1
pfac%idface = nbfaces
pfac2%idface = nbfaces
endif
endif
endif
endif
else if (.not. associated(pc%neighbor4)) then
if (pfac%bc_typ /= 0) then ! boundary face
nbfaces = nbfaces + 1
pfac%idface = nbfaces
endif
endif
endif
enddo
end subroutine assign_id_face
!----------------------------------------------------------------------
subroutine sort_vertex(vertices)
!Reference: http://pages.mtu.edu/~shene/COURSES/cs201/NOTES/chap08/sorting.f90
implicit none
type(point) :: vertices(:)
type(point) :: vertices_temp(4)
integer :: i, location
do i = 1, size(vertices) - 1
location = findminimum(i,size(vertices))
call swap_point(vertices(i),vertices(location))
enddo
vertices_temp = vertices
if (vertices_temp(1)%y < vertices_temp(2)%y) then
vertices(1) = vertices_temp(1)
vertices(4) = vertices_temp(2)
else if (vertices_temp(1)%y >= vertices_temp(2)%y) then
vertices(1) = vertices_temp(2)
vertices(4) = vertices_temp(1)
endif
if (vertices_temp(3)%y < vertices_temp(4)%y) then
vertices(2) = vertices_temp(3)
vertices(3) = vertices_temp(4)
else if (vertices_temp(3)%y >= vertices_temp(4)%y) then
vertices(2) = vertices_temp(4)
vertices(3) = vertices_temp(3)
endif
contains
integer function findminimum(start,endp)
implicit none
integer, intent(in) :: start, endp
integer :: location, i
type(point) :: minimum
minimum = vertices(start)
location = start
do i = start + 1, endp
if (vertices(i)%x < minimum%x) then
minimum = vertices(i)
location = i
endif
enddo
findminimum = location
end function findminimum
end subroutine sort_vertex
!----------------------------------------------------------------------
subroutine assign_id_face_v2
use mod_point_util
implicit none
integer :: i, j, k
type(cell_2D), pointer :: pc, pc2
type(face), pointer :: pfac, pfac2
nbfaces = 0
do i = 1, nbelm
pc => cell(i)%p
do j = 1, 4
pfac => pc%faces(j)
if (pfac%idface == 0) then ! a face that has not been indexed yet
pc2 => pc%neighbor1
if (associated(pc%neighbor1)) then
do k = 1, 4
pfac2 => pc2%faces(k)
if ((pfac%centroid .eq. pfac2%centroid) .and. abs(pfac%area - pfac2%area) <= 1.0d-9) then
if (pfac2%idface == 0) then
nbfaces = nbfaces + 1
pfac%idface = nbfaces
pfac2%idface = nbfaces
endif
endif
enddo
else if (.not. associated(pc%neighbor1)) then
if (pfac%bc_typ /= 0) then ! boundary face
if (pfac%idface > 0) cycle
nbfaces = nbfaces + 1
pfac%idface = nbfaces
endif
endif
pc2 => pc%neighbor2
if (associated(pc%neighbor2)) then
do k = 1, 4
pfac2 => pc2%faces(k)
if ((pfac%centroid .eq. pfac2%centroid) .and. abs(pfac%area - pfac2%area) <= 1.0d-9) then
if (pfac2%idface == 0) then
nbfaces = nbfaces + 1
pfac%idface = nbfaces
pfac2%idface = nbfaces
endif
endif
enddo
else if (.not. associated(pc%neighbor2)) then
if (pfac%bc_typ /= 0) then ! boundary face
if (pfac%idface > 0) cycle
nbfaces = nbfaces + 1
pfac%idface = nbfaces
endif
endif
pc2 => pc%neighbor3
if (associated(pc%neighbor3)) then
do k = 1, 4
pfac2 => pc2%faces(k)
if ((pfac%centroid .eq. pfac2%centroid) .and. abs(pfac%area - pfac2%area) <= 1.0d-9) then
if (pfac2%idface == 0) then
nbfaces = nbfaces + 1
pfac%idface = nbfaces
pfac2%idface = nbfaces
endif
endif
enddo
else if (.not. associated(pc%neighbor3)) then
if (pfac%bc_typ /= 0) then ! boundary face
if (pfac%idface > 0) cycle
nbfaces = nbfaces + 1
pfac%idface = nbfaces
endif
endif
pc2 => pc%neighbor4
if (associated(pc%neighbor4)) then
do k = 1, 4
pfac2 => pc2%faces(k)
if ((pfac%centroid .eq. pfac2%centroid) .and. abs(pfac%area - pfac2%area) <= 1.0d-9) then
if (pfac2%idface == 0) then
nbfaces = nbfaces + 1
pfac%idface = nbfaces
pfac2%idface = nbfaces
endif
endif
enddo
else if (.not. associated(pc%neighbor4)) then
if (pfac%bc_typ /= 0) then ! boundary face
if (pfac%idface > 0) cycle
nbfaces = nbfaces + 1
pfac%idface = nbfaces
endif
endif
endif
enddo
enddo
!begin debug
!do i = 1, nbelm
! pc => cell(i)%p
! do j = 1, 4
! pfac => pc%faces(j)
! if (pfac%idface == 4409) then
! print*,'check cell', i
! endif
! enddo
!enddo
!end debug
end subroutine assign_id_face_v2
!----------------------------------------------------------------------
end module