* the vertices with indices in @p considered_vertices are tested for
* equality. This speeds up the algorithm, which is quadratic and thus quite
* slow to begin with. However, if you wish to consider all vertices, simply
- * pass an empty vector.
+ * pass an empty vector. In that case, the function fills
+ * @p considered_vertices with all vertices.
*
* Two vertices are considered equal if their difference in each coordinate
* direction is less than @p tol.
}
// throw out duplicated vertices
- // since GridTools::delete_duplicated_vertices can only consider
- // one duplications at once, we have to call the function one time less
- // than the number of Triangulation objects to be merged.
- for (unsigned int i = 0; i < triangulations.size(); ++i)
- {
- std::vector<unsigned int> considered_vertices;
- GridTools::delete_duplicated_vertices(vertices,
- cells,
- subcell_data,
- considered_vertices,
- duplicated_vertex_tolerance);
- }
+ std::vector<unsigned int> considered_vertices;
+ GridTools::delete_duplicated_vertices(vertices,
+ cells,
+ subcell_data,
+ considered_vertices,
+ duplicated_vertex_tolerance);
// reorder the cells to ensure that they satisfy the convention for
// edge and face directions
{
new_vertex_numbers[considered_vertices[j]] =
considered_vertices[i];
- // we do not suppose, that there might be another duplicate
- // vertex, so break here
- break;
}
}
}