y=x

y=x+1

(n,n)

(n-1,n+1)

如果非法径 过 红线，则在第一个过红线的点开始，做原路径关于红线的
对称路径，原路径最终到达(n,n),则新路径最终节点是(n-1,n+1)

A = Intersect(xAxis, yAxis)
B = Point(xAxis)
f = Segment(A, B)
C = (3, 5)
g = Segment(C, B)
D = (8, 5)
h = Segment(C, D)
E = (8, 8)
i = Segment(E, D)
F = (10.212296189346672, 10.174154591863031)
j = Segment(A, F)
G = Point(yAxis)
H = (10, 11)
k = Segment(G, H)
I = Intersect(g, k)
J = Point(j)
l = Segment(I, J)
K = (4, 9)
m = Segment(K, J)
M = (7, 9)
n = Segment(K, M)