boundary_vertices_sorted --> boundary_loop

Former-commit-id: 7bb46dbbb639e1398de94e059db962237cb9fc69

include/igl/boundary_vertices_sorted.cpp → include/igl/boundary_loop.cpp

@@ -5,12 +5,12 @@
 // This Source Code Form is subject to the terms of the Mozilla Public License
 // v. 2.0. If a copy of the MPL was not distributed with this file, You can
 // obtain one at http://mozilla.org/MPL/2.0/.
-#include "boundary_vertices_sorted.h"
+#include "boundary_loop.h"
 
 #include "triangle_triangle_adjacency.h"
 #include "vertex_triangle_adjacency.h"
 
-IGL_INLINE void igl::boundary_vertices_sorted(
+IGL_INLINE void igl::boundary_loop(
     const Eigen::MatrixXd& V,
     const Eigen::MatrixXi& F,
     Eigen::VectorXi& b)

include/igl/boundary_vertices_sorted.h → include/igl/boundary_loop.h

@@ -23,14 +23,14 @@ namespace igl
   //   F  #V by dim list of mesh faces
   // Outputs:
   //   bnd   sorted list of boundary vertex indices
-  IGL_INLINE void boundary_vertices_sorted(
+  IGL_INLINE void boundary_loop(
   	const Eigen::MatrixXd& V, 
   	const Eigen::MatrixXi& F, 
     Eigen::VectorXi& bnd);
 }
 
 #ifndef IGL_STATIC_LIBRARY
-#  include "boundary_vertices_sorted.cpp"
+#  include "boundary_loop.cpp"
 #endif
 
 #endif

include/igl/map_vertices_to_circle.cpp

@@ -8,7 +8,7 @@
 
 #include "map_vertices_to_circle.h"
 
-#include "boundary_vertices_sorted.h"
+#include "boundary_loop.h"
 
 IGL_INLINE void igl::map_vertices_to_circle(
   const Eigen::MatrixXd& V,

include/igl/vector_area_matrix.cpp

@@ -12,7 +12,7 @@
 #include <iostream>
 #include <unsupported/Eigen/SparseExtra>
 
-//#include <igl/boundary_vertices_sorted.h>
+//#include <igl/boundary_loop.h>
 #include <igl/boundary_facets.h>
 
 template <typename DerivedF, typename Scalar>

tutorial/501_HarmonicParam/main.cpp

@@ -1,6 +1,6 @@
 #include <igl/readOFF.h>
 #include <igl/viewer/Viewer.h>
-#include <igl/boundary_vertices_sorted.h>
+#include <igl/boundary_loop.h>
 #include <igl/map_vertices_to_circle.h>
 #include <igl/harmonic.h>
 
@@ -29,7 +29,7 @@ int main(int argc, char *argv[])
 
   // Find the open boundary
   Eigen::VectorXi bnd;
-  igl::boundary_vertices_sorted(V,F,bnd);
+  igl::boundary_loop(V,F,bnd);
 
   // Map the boundary to a circle, preserving edge proportions
   Eigen::MatrixXd bnd_uv;

tutorial/502_LSCMParam/main.cpp

@@ -1,6 +1,6 @@
 #include <igl/readOFF.h>
 #include <igl/viewer/Viewer.h>
-#include <igl/boundary_vertices_sorted.h>
+#include <igl/boundary_loop.h>
 
 #include <igl/lscm.h>
 
@@ -33,7 +33,7 @@ int main(int argc, char *argv[])
 
   // Fix two points on the boundary
   VectorXi bnd,b(2,1);
-  igl::boundary_vertices_sorted(V,F,bnd);
+  igl::boundary_loop(V,F,bnd);
   b(0) = bnd(0);
   b(1) = bnd(round(bnd.size()/2));
   MatrixXd bc(2,2);

tutorial/503_ARAPParam/main.cpp

@@ -1,6 +1,6 @@
 #include <igl/readOFF.h>
 #include <igl/viewer/Viewer.h>
-#include <igl/boundary_vertices_sorted.h>
+#include <igl/boundary_loop.h>
 #include <igl/map_vertices_to_circle.h>
 #include <igl/harmonic.h>
 #include <igl/svd3x3/arap.h>
@@ -40,7 +40,7 @@ int main(int argc, char *argv[])
 
   // Compute the initial solution for ARAP (harmonic parametrization)
   Eigen::VectorXi bnd;
-  igl::boundary_vertices_sorted(V,F,bnd);
+  igl::boundary_loop(V,F,bnd);
   Eigen::MatrixXd bnd_uv;
   igl::map_vertices_to_circle(V,bnd,bnd_uv);