@@ -88,7 +88,8 @@ def buffer_info(self):
88
88
89
89
def _append_paths_slow (ctx , paths , transforms , clip = None ):
90
90
for path , transform in zip (paths , transforms ):
91
- for points , code in path .iter_segments (transform , clip = clip ):
91
+ for points , code in path .iter_segments (
92
+ transform , remove_nans = True , clip = clip ):
92
93
if code == Path .MOVETO :
93
94
ctx .move_to (* points )
94
95
elif code == Path .CLOSEPOLY :
@@ -116,7 +117,7 @@ def _append_paths_fast(ctx, paths, transforms, clip=None):
116
117
# Convert curves to segment, so that 1. we don't have to handle
117
118
# variable-sized CURVE-n codes, and 2. we don't have to implement degree
118
119
# elevation for quadratic Beziers.
119
- cleaneds = [path .cleaned (transform = transform , clip = clip , curves = False )
120
+ cleaneds = [path .cleaned (transform , remove_nans = True , clip = clip )
120
121
for path , transform in zip (paths , transforms )]
121
122
vertices = np .concatenate ([cleaned .vertices for cleaned in cleaneds ])
122
123
codes = np .concatenate ([cleaned .codes for cleaned in cleaneds ])
0 commit comments