G = (2, 4)
E = (2, 6)
getal2 = 1 (slider from 0 to getal1 / 2, step 0.1)
B = Point(Circle[E, getal2])
a = Segment(E, B)
getal3 = 1.5 (slider from 0 to (4.9 * a), step 0.1)
H = Point(Circle[G, ((Div[getal3, a] + 1) * a)])
getal1 = 3 (slider from 0.1 to 5, step 0.1)
l = Line(G, H)
C = (2, 5)
D_1 = Point(Circle[C, getal2])
g = Segment(C, D_1)
D = (2, 1)
G_1 = Point(Circle[D, getal3])
j = Segment(D, G_1)
K = (2, 2)
N = (2, -1)
M = (2, 0)
t_1 = Circle(E, getal1 - getal2)
b_1 = Line(B, E)
A_1, A = Intersect(t_1, b_1)
m_1 = Segment(G, H)
d_2 = Circle(G, a)
e_2 = Circle(G, (2 * a))
k_2 = Circle(G, (3 * a))
t_2 = Circle(G, (4 * a))
P_1 = Intersect(d_2, m_1, 1)
Q_1 = Intersect(e_2, m_1, 1)
R_1 = Intersect(k_2, m_1, 1)
S_1 = Intersect(t_2, m_1, 1)
f = Segment(E, A)
c = Circle(G, ((Div[getal3, a] + 1) * f))
F, I = Intersect(c, l)
h = Segment(G, F)
d = Circle(G, f)
e = Circle(G, (2 * f))
k = Circle(G, (3 * f))
p = Circle(G, (4 * f))
J = Intersect(d, h, 1)
L = Intersect(e, h, 1)
O = Intersect(k, h, 1)
P = Intersect(p, h, 1)
Q = Point(Circle[K, ((Div[getal3, a] + 1) * g)])
i = Segment(K, Q)
q = Circle(K, g)
r = Circle(K, (2 * g))
s = Circle(K, (3 * g))
t = Circle(K, (4 * g))
R = Intersect(t, i, 1)
S = Intersect(s, i, 1)
T = Intersect(r, i, 1)
U = Intersect(q, i, 1)
V = Point(Circle[M, (Div[h, getal3] * getal3)])
m = Segment(M, V)
W = Point(Circle[N, ((Div[h, getal3] + 1) * getal3)])
n = Segment(N, W)
c_1 = Circle(N, j)
d_1 = Circle(N, (2 * j))
e_1 = Circle(N, (3 * j))
f_1 = Circle(N, (4 * j))
Z = Intersect(c_1, n)
B_1 = Intersect(d_1, n)
C_1 = Intersect(e_1, n)
E_1 = Intersect(f_1, n)
g_1 = Circle(M, j)
h_1 = Circle(M, (2 * j))
k_1 = Circle(M, (3 * j))
p_1 = Circle(M, (4 * j))
F_1 = Intersect(g_1, m)
H_1 = Intersect(h_1, m)
I_1 = Intersect(k_1, m)
J_1 = Intersect(p_1, m)