pull/1548/head
Andreas 2021-11-19 19:42:28 +01:00 zatwierdzone przez Kaalleen
rodzic e15bce1401
commit 8966fa1919
2 zmienionych plików z 8 dodań i 8 usunięć

Wyświetl plik

@ -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.

Wyświetl plik

@ -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