FIX: update arc to do better rounding and allow wrap

jklymak · jklymak · commit ffdd0cff9645 · 2025-04-24T07:48:54.000-07:00
diff --git a/lib/matplotlib/path.py b/lib/matplotlib/path.py
@@ -949,36 +949,70 @@ def unit_circle_righthalf(cls):
         return cls._unit_circle_righthalf
 
     @classmethod
-    def arc(cls, theta1, theta2, n=None, is_wedge=False):
+    def arc(cls, theta1, theta2, n=None, is_wedge=False, wrap=True):
         """
         Return a `Path` for the unit circle arc from angles *theta1* to
         *theta2* (in degrees).
 
-        *theta2* is unwrapped to produce the shortest arc within 360 degrees.
-        That is, if *theta2* > *theta1* + 360, the arc will be from *theta1* to
-        *theta2* - 360 and not a full circle plus some extra overlap.
-
-        If *n* is provided, it is the number of spline segments to make.
-        If *n* is not provided, the number of spline segments is
-        determined based on the delta between *theta1* and *theta2*.
+        Parameters
+        ----------
+        theta1, theta2 : float
+            The angles (in degrees) of the start and end of the arc.  If the
+            arc is greater than 360 degrees, then the arc will be wrapped to
+            fit between theta1 and theta1 + 360, if *wrap* is True.
+
+        n : int, optional
+            The number of spline segments to make.  If not provided, the number
+            of spline segments is determined based on the delta between
+            *theta1* and *theta2*.
+
+        is_wedge : bool, default: False
+            If True, the arc is a wedge.  The first vertex is the center of the
+            wedge, the second vertex is the start of the arc, and the last
+            vertex is the end of the arc.  The wedge is closed with a line
+            segment to the center of the wedge.  If False, the arc is a
+            polyline.  The first vertex is the start of the arc, and the last
+            vertex is the end of the arc.  The arc is closed with a line
+            segment to the start of the arc.  The wedge is not closed with a
+            line segment to the start of the arc.
+
+        wrap : bool, default: True
+            If True, the arc is wrapped to fit between *theta1* and *theta1* +
+            360 degrees.  If False, the arc is not wrapped.  The arc will be
+            drawn from *theta1* to *theta2*.
 
-           Masionobe, L.  2003.  `Drawing an elliptical arc using
-           polylines, quadratic or cubic Bezier curves
+        Notes
+        -----
+           The arc is approximated using cubic Bézier curves, as described in
+           Masionobe, L.  2003.  `Drawing an elliptical arc using polylines,
+           quadratic or cubic Bezier curves
            <https://web.archive.org/web/20190318044212/http://www.spaceroots.org/documents/ellipse/index.html>`_.
         """
-        halfpi = np.pi * 0.5
 
         eta1 = theta1
-        eta2 = theta2 - 360 * np.floor((theta2 - theta1) / 360)
-        # Ensure 2pi range is not flattened to 0 due to floating-point errors,
-        # but don't try to expand existing 0 range.
-        if theta2 != theta1 and eta2 <= eta1:
-            eta2 += 360
+        if wrap:
+            # Wrap theta2 to 0-360 degrees from theta1.
+            eta2 = np.mod(theta2 - theta1, 360.0) + theta1
+            print('Eta1, Eta20', eta1, eta2)
+            # Ensure 360-deg range is not flattened to 0 due to floating-point
+            # errors, but don't try to expand existing 0 range.
+            if theta2 != theta1 and eta2 <= eta1:
+                eta2 += 360
+            print('Eta1, Eta2', eta1, eta2)
+        else:
+            eta2 = theta2
         eta1, eta2 = np.deg2rad([eta1, eta2])
 
         # number of curve segments to make
         if n is None:
-            n = int(2 ** np.ceil((eta2 - eta1) / halfpi))
+            if np.abs(eta2 - eta1) <= 2.2 * np.pi:
+                # this doesn't need to grow exponentially, but we have left
+                # this way for back compatibility
+                n = int(2 ** np.ceil(2 * np.abs(eta2 - eta1) / np.pi))
+                print('Here')
+            else:
+                # this will not grow exponentially if we allow wrapping arcs:
+                n = int(2 * np.ceil(2 * np.abs(eta2 - eta1) / np.pi))
         if n < 1:
             raise ValueError("n must be >= 1 or None")
 
@@ -1028,22 +1062,29 @@ def arc(cls, theta1, theta2, n=None, is_wedge=False):
         return cls(vertices, codes, readonly=True)
 
     @classmethod
-    def wedge(cls, theta1, theta2, n=None):
+    def wedge(cls, theta1, theta2, n=None, wrap=True):
         """
         Return a `Path` for the unit circle wedge from angles *theta1* to
         *theta2* (in degrees).
 
-        *theta2* is unwrapped to produce the shortest wedge within 360 degrees.
-        That is, if *theta2* > *theta1* + 360, the wedge will be from *theta1*
-        to *theta2* - 360 and not a full circle plus some extra overlap.
-
-        If *n* is provided, it is the number of spline segments to make.
-        If *n* is not provided, the number of spline segments is
-        determined based on the delta between *theta1* and *theta2*.
-
-        See `Path.arc` for the reference on the approximation used.
-        """
-        return cls.arc(theta1, theta2, n, True)
+        Parameters
+        ----------
+        theta1, theta2 : float
+            The angles (in degrees) of the start and end of the arc.  If the
+            arc is greater than 360 degrees, then the arc will be wrapped to
+            fit between theta1 and theta1 + 360, if *wrap* is True.
+
+        n : int, optional
+            The number of spline segments to make.  If not provided, the number
+            of spline segments is determined based on the delta between
+            *theta1* and *theta2*.
+
+        wrap : bool, default: True
+            If True, the arc is wrapped to fit between *theta1* and *theta1* +
+            360 degrees.  If False, the arc is not wrapped.  The arc will be
+            drawn from *theta1* to *theta2*.
+        """
+        return cls.arc(theta1, theta2, n, wedge=True, wrap=wrap)
 
     @staticmethod
     @lru_cache(8)
diff --git a/lib/matplotlib/path.pyi b/lib/matplotlib/path.pyi
@@ -119,10 +119,14 @@ class Path:
     def unit_circle_righthalf(cls) -> Path: ...
     @classmethod
     def arc(
-        cls, theta1: float, theta2: float, n: int | None = ..., is_wedge: bool = ...
+        cls, theta1: float, theta2: float, n: int | None = ...,
+        is_wedge: bool = ..., wrap: bool = ...
     ) -> Path: ...
     @classmethod
-    def wedge(cls, theta1: float, theta2: float, n: int | None = ...) -> Path: ...
+    def wedge(
+        cls, theta1: float, theta2: float, n: int | None = ...,
+        wrap: bool = ...
+    ) -> Path: ...
     @overload
     @staticmethod
     def hatch(hatchpattern: str, density: float = ...) -> Path: ...
diff --git a/lib/matplotlib/tests/baseline_images/test_path/arc_close360.png b/lib/matplotlib/tests/baseline_images/test_path/arc_close360.png
diff --git a/lib/matplotlib/tests/test_path.py b/lib/matplotlib/tests/test_path.py
@@ -471,12 +471,29 @@ def test_full_arc(offset):
     high = 360 + offset
 
     path = Path.arc(low, high)
+    print(path.vertices)
     mins = np.min(path.vertices, axis=0)
     maxs = np.max(path.vertices, axis=0)
     np.testing.assert_allclose(mins, -1)
     np.testing.assert_allclose(maxs, 1)
 
 
+@image_comparison(['arc_close360'], style='default', remove_text=True,
+                  extensions=['png'])
+def test_arc_close360():
+    fig, ax = plt.subplots(ncols=3)
+    ax[0].add_patch(patches.PathPatch(Path.arc(theta1=-90 - 1e-14, theta2=270)))
+    #ax[0].set_title("arc(-90-1e-14, 270), should be a circle")
+    ax[1].add_patch(patches.PathPatch(Path.arc(theta1=-90, theta2=270)))
+    #ax[1].set_title("arc(-90, 270), is a circle")
+    ax[2].add_patch(patches.PathPatch(Path.arc(theta1=-90 - 1e-14, theta2=-90)))
+    #ax[2].set_title("arc(-90, -90-1e-14), should not be a circle")
+    for a in ax:
+        a.set_xlim(-1, 1)
+        a.set_ylim(-1, 1)
+        a.set_aspect("equal")
+
+
 def test_disjoint_zero_length_segment():
     this_path = Path(
         np.array([
