InterpolatePy 3.2.1__tar.gz → 3.2.2__tar.gz

{interpolatepy-3.2.1 → interpolatepy-3.2.2}/InterpolatePy.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: InterpolatePy
-Version: 3.2.1
+Version: 3.2.2
 Summary: A comprehensive Python library for generating smooth trajectories and curves with precise control over position, velocity, acceleration, and jerk profiles
 Author-email: Giorgio Medico <giorgio.medico11@gmail.com>
 Maintainer-email: Giorgio Medico <giorgio.medico11@gmail.com>

{interpolatepy-3.2.1 → interpolatepy-3.2.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: InterpolatePy
-Version: 3.2.1
+Version: 3.2.2
 Summary: A comprehensive Python library for generating smooth trajectories and curves with precise control over position, velocity, acceleration, and jerk profiles
 Author-email: Giorgio Medico <giorgio.medico11@gmail.com>
 Maintainer-email: Giorgio Medico <giorgio.medico11@gmail.com>

{interpolatepy-3.2.1 → interpolatepy-3.2.2}/interpolatepy/b_spline_cubic.py

@@ -400,25 +400,23 @@ class CubicBSplineInterpolation(BSpline):
             b3_k1 = basis_vals[1]
             b3_k2 = basis_vals[2]
 
-            # Fill the tridiagonal matrix
+            # A known neighbour (p₁, pₙ₊₁) moves to the right-hand side, an unknown
+            # one gets an off-diagonal. Independent tests, not if/elif: at n == 2
+            # the only row is both first and last and needs both subtractions.
+            main_diagonal[k - 1] = b3_k1
+            rhs_k = np.asarray(self.interpolation_points[k], dtype=np.float64).copy()
+
             if k == 1:
-                # First row
-                main_diagonal[0] = b3_k1
-                upper_diagonal[0] = b3_k2
-                right_hand_side[0] = self.interpolation_points[k] - b3_k * control_points[1]
-            elif k == n - 1:
-                # Last row
-                lower_diagonal[k - 2] = b3_k
-                main_diagonal[k - 1] = b3_k1
-                right_hand_side[k - 1] = (
-                    self.interpolation_points[k] - b3_k2 * control_points[n + 1]
-                )
+                rhs_k -= b3_k * control_points[1]
             else:
-                # Middle rows
                 lower_diagonal[k - 2] = b3_k
-                main_diagonal[k - 1] = b3_k1
+
+            if k == n - 1:
+                rhs_k -= b3_k2 * control_points[n + 1]
+            else:
                 upper_diagonal[k - 1] = b3_k2
-                right_hand_side[k - 1] = self.interpolation_points[k]
+
+            right_hand_side[k - 1] = rhs_k
 
         # Solve the tridiagonal system for each dimension
         for d in range(dimension):

{interpolatepy-3.2.1 → interpolatepy-3.2.2}/interpolatepy/version.py

@@ -2,4 +2,4 @@
 __version__ file.
 """
 
-__version__ = "3.2.1"
+__version__ = "3.2.2"

{interpolatepy-3.2.1 → interpolatepy-3.2.2}/tests/test_b_spline_variants.py

@@ -352,6 +352,29 @@ class TestCubicBSplineInterpolation:
         assert isinstance(spline, CubicBSplineInterpolation)
 
 
+    @pytest.mark.parametrize("n_points", [2, 3, 4, 5, 6, 7, 8])
+    def test_curve_passes_through_every_point(self, n_points: int) -> None:
+        """The curve must pass through each point at that point's own u_bar.
+
+        Guards n == 2 (three points), where the single tridiagonal row is both
+        the first and the last: an if/elif chain there keeps only the left
+        term, drops b3_k2 * p[n+1] and displaces the middle control point.
+        Two points return before the solve and four or more have distinct
+        rows, so three is the only count that hits it -- hence the sweep.
+        """
+        rng = np.random.default_rng(0)
+        for _ in range(20):
+            points = rng.uniform(-0.5, 0.5, (n_points, 3))
+            spline = CubicBSplineInterpolation(
+                points=points, v0=np.zeros(3), vn=np.zeros(3), method="chord_length"
+            )
+            for i, u_bar in enumerate(np.asarray(spline.u_bars)):
+                evaluated = np.asarray(spline.evaluate(float(u_bar)))
+                assert np.linalg.norm(evaluated - points[i]) == pytest.approx(
+                    0.0, abs=1e-9
+                )
+
+
 class TestApproximationBSpline:
     """Test suite for ApproximationBSpline class."""