diff options
| -rw-r--r-- | lib/stitches/StitchPattern.py | 4 | ||||
| -rw-r--r-- | lib/stitches/auto_fill.py | 12 |
2 files changed, 8 insertions, 8 deletions
diff --git a/lib/stitches/StitchPattern.py b/lib/stitches/StitchPattern.py index 1fc5e389..1edfd452 100644 --- a/lib/stitches/StitchPattern.py +++ b/lib/stitches/StitchPattern.py @@ -123,11 +123,11 @@ def make_tree_uniform_ccw(root): class StitchingStrategy(IntEnum): CLOSEST_POINT = 0 INNER_TO_OUTER = 1 + SPIRAL = 2 def offset_poly( - poly, offset, join_style, stitch_distance, offset_by_half, strategy, starting_point -): + poly, offset, join_style, stitch_distance, offset_by_half, strategy, starting_point): """ Takes a polygon (which can have holes) as input and creates offsetted versions until the polygon is filled with these smaller offsets. diff --git a/lib/stitches/auto_fill.py b/lib/stitches/auto_fill.py index 95cc9103..b63f4be1 100644 --- a/lib/stitches/auto_fill.py +++ b/lib/stitches/auto_fill.py @@ -165,10 +165,10 @@ def build_fill_stitch_graph(shape, line, angle, row_spacing, end_row_spacing, st for i in range(len(rows_of_segments)): for segment in rows_of_segments[i]: - if abs(segment[0][0]-396.5081896849414) < 0.01: - print("HIER") - if segment[0][0] == segment[-1][0] and segment[0][1] == segment[-1][1]: - print("FEHLER HIER!") + # if abs(segment[0][0]-396.5081896849414) < 0.01: + # print("HIER") + # if segment[0][0] == segment[-1][0] and segment[0][1] == segment[-1][1]: + # print("FEHLER HIER!") # First, add the grating segments as edges. We'll use the coordinates # of the endpoints as nodes, which networkx will add automatically. @@ -688,8 +688,8 @@ def stitch_line(stitches, stitching_direction, geometry, projected_points, max_s else: stitches.append( Stitch(*geometry.coords[0], tags=('fill_row_end',))) - if stitches[-1].x == stitches[-2].x and stitches[-1].y == stitches[-2].y: - print("FEHLER") + # if stitches[-1].x == stitches[-2].x and stitches[-1].y == stitches[-2].y: + # print("FEHLER") @debug.time |