-// GetMeshDS()->RemoveFreeElement( *elem, subMesh, /*fromGroups=*/false );
-
- // rnc : don't delete the elem here because it results in a mesh with a free
- // ID at the beginning of the ID list. The first tetra is then inserted in O(1)
- // but the second one is inserted in O(n), then the whole procedure has almost a O(n^2)
- // complexity. If all elements to remove are stored and removed after tetra creation
- // we get a O(n) complexity for the whole procedure.
- // The memory cost is at worst a 6*n*constant memory occupation (where n is the number of elements)
- // before deletion of the hexas and then 5*n*constant instead of a maximum of 5*n*constant.
- // So there is a transient 1/5*(memory occupation) additional cost.
-
- // Store the elements to delete
- TElemToDelete elemToDelete(*elem, subMesh);
- elem_to_delete.push_back(elemToDelete);