Tham khảo tài liệu 'applied computational fluid dynamics techniques - wiley episode 1 part 2', kỹ thuật - công nghệ, cơ khí - chế tạo máy phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | 10 APPLIED COMPUTATIONAL FLUID DYNAMICS TECHNIQUES Element Pass 1 Count the number of elements connected to each point Initialize esup2 1 npoin 1 0 do ielem 1 nelem Loop over the elements do inode 1 nnode Loop over nodes of the element Update storage counter storing ahead ipoi1 inpoel inode ielem 1 esup2 ipoi1 esup2 ipoi1 1 enddo enddo Storage reshuffling pass 1 do ipoin 2 npoin 1 Loop over the points Update storage counter and store esup2 ipoin esup2 ipoin esup2 ipoin-1 enddo Element pass 2 Store the elements in esup1 do ielem 1 nelem Loop over the elements do inode 1 nnode Loop over nodes of the element Update storage counter storing in esup1 ipoin inpoel inode ielem istor esup2 ipoin 1 esup2 ipoin istor esup1 istor ielem enddo enddo Storage reshuffling pass 2 do ipoin npoin 1 2 -1 Loop over points in reverse order esup2 ipoin esup2 ipoin-1 enddo esup2 1 0 . POINTS SURROUNDING POINTS As with the number of elements that can surround a point the number of immediate neighbours or points surrounding a point can vary greatly for an unstructured mesh. The best way to store this information is in a linked list. This list will be denoted by psup1 1 mpsup psup2 1 npoin 1 where as before psup1 stores the points and the ordering is such that the points surroundingpoint ipoin are stored in locations psup2 ipoin 1 to psup2 ipoin 1 . DATA STRUCTURES AND ALGORITHMS 11 The construction of psupl psup2 makes use of the element-surrounding-point information stored in esupl esup2. For each point we can find the elements that surround it from esupl esup2. The points belonging to these elements are the points we are required to store. In order to avoid the repetitive storage of the same point from neighbouring elements a help-array of the form lpoin 1 npoin is introduced. As will become evident in subsequent sections help-arrays such as Ipoin play a fundamental role in the fast construction of derived data structures. As the points are being stored in psupl and psup2 their entry
