检查一条线是否以任何方式穿过多边形

simplepoint = tuple[int, int]def getpolygonsinway(start: simplepoint, end: simplepoint, polygons: list[polygon]) -> list[polygon]:    line = linestring([start, end])    polygonsinway = [polygon for polygon in polygons if line.crosses(polygon)]  # make sure line.crosses() doesnt return true if the starting point is on the polygon    return polygonsinwaydef getpaths(start: simplepoint, end: simplepoint, polygons: list[polygon], prev_points: list[simplepoint] = []) -> list[list[simplepoint]]:    polygonsinway = getpolygonsinway(start, end, polygons)    if not polygonsinway:        return [[start, end]]    closestpolygon = closestpolygontopoint(start, polygons)    xyvalsold = closestpolygon.exterior.xy    xyvals = []    for i in range(len(xyvalsold[0])):        xyvals.append((xyvalsold[0][i], xyvalsold[1][i]))    xyvals = list(set(xyvals)) # remove duplicates    polxvals = [val[0] for val in xyvals]    polyvals = [val[1] for val in xyvals]    okpoints = []    for i in range(len(polxvals)):        if start == (polxvals[i], polyvals[i]):            continue        if int(polxvals[i]) != polxvals[i] or int(polyvals[i]) != polyvals[i]:            continue        if (int(polxvals[i]), int(polyvals[i])) in prev_points:            continue        if closestpolygon not in getpolygonsinway(start, (polxvals[i], polyvals[i]), polygons): #and closestpolygon not in getpolygonsinway((polxvals[i], polyvals[i]), end, polygons):            okpoints.append((int(polxvals[i]), int(polyvals[i])))    paths = [[start] for _ in range(len(okpoints))]    for i in range(len(okpoints)):        point = (okpoints[i][0], okpoints[i][1])        paths[i].extend(getshortestpath(getpaths(point, end, polygons, prev_points + [point]), point, end))    return paths

polygon = Polygon([[411, 182], [411, 335], [210, 335], [210, 182]])start = (440, 35)end = (90, 600)