AN EFFICIENT ALGORITHM FOR MERGING NODE-MATCHED FRAGMENTS OF SURFACE GRIDS
V. V. Lazarev
VANT. Ser.: Mat. Mod. Fiz. Proc 2020. Вып.4. С. 62-71.
A new algorithm is proposed for merging node-matched fragments of surface grids constructed based on a geometric model in the B-REP representation. As opposed to classical merging algorithms, this algorithm: 1) considers groups of nodes rather than each individual node; 2) identifies matching nodes based on the connections between grid fragments, which are stored in geometric model representation structures, rather than based on the distance function and its minimum value; 3) instead of storing the result of merging in arrays, represents it in the form of functions, which calculate the node address in the grid fragment based on the node index and the node indexes in a cell, based on the cell index. The processor time and the memory consumed by the algorithm are negligibly small. They depend only on the number of grid fragments and do not depend on the number of nodes or cells in the fragments.Keywords: composite grid, surface grid merging algorithm, global indexing, functional representation of a set, boundary representation of a geometric model (B-REP).
|
English
