@@ -888,7 +888,6 @@ def set_points_as_corners(self, points: Sequence[float]):
888888 :class:`VMobject`
889889 ``self``
890890 """
891- nppcc = self .n_points_per_cubic_curve
892891 points = np .asarray (points )
893892 start_anchors = points [:- 1 ]
894893 end_anchors = points [1 :]
@@ -1021,8 +1020,11 @@ def consider_points_equals(
10211020 ) -> bool | np .ndarray :
10221021 """Determine if two points are close enough to be considered equal.
10231022
1024- This function reimplements np.allclose, because repeated calling of
1025- np.allclose for only 2 points is inefficient.
1023+ This function reimplements ``numpy.allclose``, because repeated calling of
1024+ ``np.allclose`` for only 2 points is inefficient. The tolerance is governed
1025+ by the :attr:`.tolerance_for_point_equality` attribute.
1026+
1027+ Parameters
10261028 ----------
10271029 p0
10281030 first point
@@ -1261,7 +1263,10 @@ def get_subpaths(self) -> tuple:
12611263 return self .get_subpaths_from_points (self .points )
12621264
12631265 def get_subpath_split_indices_from_points (
1264- self , points : np .ndarray , n_dims : int = 3 , strip_null_end_curves : bool = False
1266+ self ,
1267+ points : np .ndarray ,
1268+ n_dims : int = 3 ,
1269+ strip_null_end_curves : bool = False ,
12651270 ) -> np .ndarray :
12661271 nppcc = self .n_points_per_cubic_curve
12671272 starts = points [::nppcc ]
@@ -1313,7 +1318,9 @@ def get_subpath_split_indices_from_points(
13131318 return split_indices
13141319
13151320 def get_subpath_split_indices (
1316- self , n_dims : int = 3 , strip_null_end_curves : bool = False
1321+ self ,
1322+ n_dims : int = 3 ,
1323+ strip_null_end_curves : bool = False ,
13171324 ) -> np .ndarray :
13181325 return self .get_subpath_split_indices_from_points (
13191326 self .points , n_dims , strip_null_end_curves
@@ -1349,7 +1356,7 @@ def _update_curve_memory(self, sample_points: int = 10):
13491356 n_curves = n_points // nppcc
13501357 n_points = n_points * nppcc
13511358
1352- # Check if any Bezier had its points changed to recalculate its length.
1359+ # Check if any Bézier curve had its points changed to recalculate its length.
13531360 neq = curr_points [:n_points ] != memo_points [:n_points ]
13541361 # Collapse every 3D point group into a single value per point.
13551362 neq = neq .reshape (- 1 , self .dim )
0 commit comments