@@ -83,13 +83,14 @@ int feenox_mesh_write_vtk_cells(mesh_t *mesh, FILE *file, int with_size) {
8383 switch (element -> type -> id ) {
8484 case ELEMENT_TYPE_HEXAHEDRON27 :
8585 for (int j = 0 ; j < 27 ; ++ j ) {
86- fprintf (file , " %ld" , tag_index_map_lookup (mesh -> index2tag , element -> node [hexa27fromgmsh [j ]]-> tag ));
86+ // fprintf(file, " %ld", tag_index_map_lookup(mesh->index2tag, element->node[hexa27fromgmsh[j]]->tag));
87+ fprintf (file , " %ld" , mesh -> tag2index_from_tag_min [element -> node [hexa27fromgmsh [j ]]-> tag ]);
8788 }
8889 fprintf (file , "\n" );
8990 break ;
9091 case ELEMENT_TYPE_HEXAHEDRON20 :
9192 for (int j = 0 ; j < 20 ; ++ j ) {
92- fprintf (file , " %ld" , tag_index_map_lookup ( mesh -> index2tag , element -> node [hexa20fromgmsh [j ]]-> tag ) );
93+ fprintf (file , " %ld" , mesh -> tag2index_from_tag_min [ element -> node [hexa20fromgmsh [j ]]-> tag ] );
9394 }
9495 fprintf (file , "\n" );
9596 break ;
@@ -99,12 +100,12 @@ int feenox_mesh_write_vtk_cells(mesh_t *mesh, FILE *file, int with_size) {
99100 // tet10 has nodes 8 & 9 swapped
100101 if (is_tet10 && (j == 8 || j == 9 )) {
101102 if (j == 8 ) {
102- fprintf (file , " %ld" , tag_index_map_lookup ( mesh -> index2tag , element -> node [9 ]-> tag ) );
103+ fprintf (file , " %ld" , mesh -> tag2index_from_tag_min [ element -> node [9 ]-> tag ] );
103104 } else if (j == 9 ) {
104- fprintf (file , " %ld" , tag_index_map_lookup ( mesh -> index2tag , element -> node [8 ]-> tag ) );
105+ fprintf (file , " %ld" , mesh -> tag2index_from_tag_min [ element -> node [8 ]-> tag ] );
105106 }
106107 } else {
107- fprintf (file , " %ld" , tag_index_map_lookup ( mesh -> index2tag , element -> node [j ]-> tag ) );
108+ fprintf (file , " %ld" , mesh -> tag2index_from_tag_min [ element -> node [j ]-> tag ] );
108109 }
109110 }
110111 fprintf (file , "\n" );
@@ -135,10 +136,11 @@ int feenox_mesh_write_mesh_vtk(mesh_t *this, FILE *file, int dummy) {
135136 fprintf (file , "DATASET UNSTRUCTURED_GRID\n" );
136137 fprintf (file , "POINTS %ld double\n" , this -> n_nodes );
137138
139+ /*
138140 if (this->sparse && this->tag2index == NULL) {
139141 feenox_call(feenox_mesh_create_index2tag(this));
140142 }
141-
143+ */
142144 for (size_t j = 0 ; j < this -> n_nodes ; j ++ ) {
143145 fprintf (file , "%g %g %g\n" , this -> node [j ].x [0 ], this -> node [j ].x [1 ], this -> node [j ].x [2 ]);
144146 }
0 commit comments