mirror of
https://git.salome-platform.org/gitpub/modules/smesh.git
synced 2025-04-07 16:17:28 +05:00
3f3beb8b95
The whole procedure performance was almost O(n^2) due to insertion of for example 5 elements in a mesh with a free ID at the beginning. The second element is then inserted with a O(n) complexity. The hexas are now removed after all tetra insertions, which guarantees a O(n) complexity for the whole procedure at a limited memory cost (transient additional cost of 1/5 of total memory occupation at the end).
The file is empty.