/**
* Given a Triangulation and an optional Mapping, create a vector of smooth
* curves that interpolate the connected parts of the boundary vertices of
- * the Triangulation and return them as a vector of TopoDS_Edge.
+ * the Triangulation and return them as a vector of TopoDS_Edge objects.
+ *
+ * This function constructs closed Bspline curve objects passing through all
+ * vertices of the boundary of the triangulation, with $C^2$ Continuity on
+ * each vertex except the first, where only $C^1$ continuity is guaranteed.
*
* The returned curves are ordered with respect to the indices of the faces
* that make up the triangulation boundary, i.e., the first curve is the one
* extracted starting from the face with the lowest index, and so on.
*
- * @param[input] triangulation Input triangulation
- * @param[input] mapping Optional input mapping
+ * @param[in] triangulation Input triangulation
+ * @param[in] mapping Optional input mapping
* @return An std::vector of TopoDS_Edge objects representing the smooth
* interpolation of the boundary of the `triangulation`
*
{
// get global face and vertex indices
face_index = cell->face(f)->index();
- unsigned int v0 = cell->face(f)->vertex_index(0);
- unsigned int v1 = cell->face(f)->vertex_index(1);
+ const unsigned int v0 = cell->face(f)->vertex_index(0);
+ const unsigned int v1 = cell->face(f)->vertex_index(1);
face_to_verts[face_index].first = v0;
face_to_verts[face_index].second = v1;
visited_faces[face_index] = false;
while (point_index != start_point_index);
interpolation_curves.push_back(interpolation_curve(pointlist, Tensor<1,3>(), true));
- pointlist.clear();
finished = true;
for (const auto &f : visited_faces)