|
[Sponsors] |
Fast Search adjacent cells in an unstructured grid |
|
LinkBack | Thread Tools | Search this Thread | Display Modes |
November 1, 2015, 18:40 |
Fast Search adjacent cells in an unstructured grid
|
#1 |
New Member
Join Date: Oct 2015
Posts: 1
Rep Power: 0 |
Hello!
I write my own solver. I use a grid format .NEU - gambit file format. This format as the other I know has the following structure fo tetrahedron mesh: Matrix points. Each row are 3 numbers - the coordinates of the point. Мatrix cells. Each row is 4 numbers - the points that form this cell. I need the following matrix: 1 22 33 44 56 2 21 45 67 89 . . Each row is 4 number - cells with which this cell contacts through its surface. For example, cell 2 is in contact with the cells 21 45 67 89. In the case of the .NEU file format, I have to do a nested loop that for each cell goes through all cells. I Get N * N "IF" comparisons. It is too long. My question1. Is there a file format in which the matrix that I need is contained explicitly? My question2. Is there a file format in which the matrix that I need I can get a faster way. |
|
|
|
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
[snappyHexMesh] snappyHexMesh sticking point | natty_king | OpenFOAM Meshing & Mesh Conversion | 11 | February 20, 2024 10:12 |
[ICEM] Error in mesh writing | helios | ANSYS Meshing & Geometry | 21 | August 19, 2021 15:18 |
unstructured mesh | phoenics user | Phoenics | 26 | March 22, 2012 13:17 |
[Netgen] Import netgen mesh to OpenFOAM | hsieh | OpenFOAM Meshing & Mesh Conversion | 32 | September 13, 2011 06:50 |
unstructured mesh grid independence for Fluent | Shane Schouten | FLUENT | 0 | October 11, 2006 17:50 |