Merge pull request #265 from arvigj/internal_angles-fix [skip ci]

Add missing bindings functions

Author: alecjacobson

priority.txt

@@ -7,13 +7,11 @@ euler_characteristic.cpp
 grad_intrinsic.cpp
 hessian.cpp
 hessian_energy.cpp
-internal_angles.cpp
 is_delaunay.cpp
 is_intrinsic_delaunay.cpp
 is_irregular_vertex.cpp
 iterative_closest_point.cpp
 lbs_matrix.cpp
-map_vertices_to_circle.cpp
 marching_tets.cpp
 mvc.cpp
 offset_surface.cpp
@@ -35,7 +33,6 @@ sparse_voxel_grid.cpp
 tet_tet_adjacency.cpp
 
 active_set.cpp
-all_pairs_distances.cpp
 ambient_occlusion.cpp
 arap_linear_block.cpp
 arap_rhs.cpp

src/all_pairs_distances.cpp

@@ -0,0 +1,37 @@
+#include "default_types.h"
+#include <igl/all_pairs_distances.h>
+#include <nanobind/nanobind.h>
+#include <nanobind/ndarray.h>
+#include <nanobind/eigen/dense.h>
+
+namespace nb = nanobind;
+using namespace nb::literals;
+namespace pyigl
+{
+  auto all_pairs_distances(
+      const Eigen::MatrixXd &V,
+      const Eigen::MatrixXd &U,
+      const bool squared)
+  {
+    Eigen::MatrixXd D;
+    igl::all_pairs_distances(V, U, squared, D);
+    return D;
+  }
+}
+
+void bind_all_pairs_distances(nb::module_ &m)
+{
+  m.def("all_pairs_distances", &pyigl::all_pairs_distances,
+        "V"_a,
+        "U"_a,
+        "squared"_a,
+        R"(Compute distances between each point i in V and point j in U
+    D = all_pairs_distances(V,U)
+@tparam matrix class like MatrixXd
+@param[in] V  #V by dim list of points
+@param[in] U  #U by dim list of points
+@param[in] squared  whether to return squared distances
+@param[out] D  #V by #U matrix of distances, where D(i,j) gives the distance or
+    squareed distance between V(i,:) and U(j,:)
+)");
+}

src/internal_angles.cpp

@@ -0,0 +1,31 @@
+#include "default_types.h"
+#include <igl/internal_angles.h>
+#include <nanobind/nanobind.h>
+#include <nanobind/ndarray.h>
+#include <nanobind/eigen/dense.h>
+
+namespace nb = nanobind;
+using namespace nb::literals;
+namespace pyigl
+{
+  auto internal_angles(
+      const nb::DRef<const Eigen::MatrixXN> &V,
+      const nb::DRef<const Eigen::MatrixXI> &F)
+  {
+    Eigen::MatrixXN K;
+    igl::internal_angles(V, F, K);
+    return K;
+  }
+}
+
+void bind_internal_angles(nb::module_ &m)
+{
+  m.def("internal_angles", &pyigl::internal_angles,
+        "V"_a,
+        "F"_a,
+        R"(Compute internal angles for all tets of a given tet mesh (V,T).
+@param[in] V  #V by dim eigen Matrix of mesh vertex nD positions
+@param[in] T  #F by poly-size eigen Matrix of face (triangle) indices
+@param[out] K  #F by poly-size eigen Matrix of internal angles
+    for triangles, columns correspond to edges [1,2],[2,0],[0,1])");
+}

src/map_vertices_to_circle.cpp

@@ -0,0 +1,33 @@
+#include "default_types.h"
+#include <igl/map_vertices_to_circle.h>
+#include <nanobind/nanobind.h>
+#include <nanobind/ndarray.h>
+#include <nanobind/eigen/dense.h>
+#include <nanobind/stl/vector.h>
+
+namespace nb = nanobind;
+using namespace nb::literals;
+namespace pyigl
+{
+  auto map_vertices_to_circle(
+      const Eigen::MatrixXd &V,
+      const Eigen::VectorXi &bnd)
+  {
+    Eigen::MatrixXd UV;
+    igl::map_vertices_to_circle(V, bnd, UV);
+    return UV;
+  }
+}
+
+void bind_map_vertices_to_circle(nb::module_ &m)
+{
+  m.def("map_vertices_to_circle", &pyigl::map_vertices_to_circle,
+        "V"_a,
+        "bnd"_a,
+        R"(Map the vertices whose indices are in a given boundary loop (bnd) on the
+unit circle with spacing proportional to the original boundary edge
+lengths.
+@param[in] V  #V by dim list of mesh vertex positions
+@param[in] b  #W list of vertex ids
+@param[out] UV   #W by 2 list of 2D position on the unit circle for the vertices in b)");
+}