Utiliza la regla para medir. Se puede mover con el punto verde y girar con el rojo. 

¿Qué visita tiene el recorrido 
más largo?

La  \; escala \;   de \;  este \;  plano \;  es \;  : \;  \frac{ 1 }{10000 } 

Calcula la longitud real en km 
de cada visita.

G1 = (-1.0394779050277063, -5.431562353874855)
H1 = (1, 2)
I1 = (4.298853150114987, -0.8175628983240897)
J1 = (8.191343943442511, 4.25959900601616)
K1 = (12.47872510710761, 5.04937974669131)
L1 = (19.191861402846385, 3.2441666251481096)
r1 = Segment(G1, H1)
s1 = Segment(H1, I1)
t1 = Segment(I1, J1)
a2 = Segment(J1, K1)
b2 = Segment(K1, L1)
Q1 = (18.402080662171233, 8.546980169681259)
R1 = (16, 12)
S1 = (10.842750715709085, 8.659805989777709)
U1 = (8.022105213297836, 11.649690222333634)
V1 = (3.170594949150487, 7.644373608909659)
W1 = (0.40636235678746263, 3.9775344557750345)
Z1 = (-3.3733026164436115, 9.844477100790433)
e2 = Segment(Z1, W1)
f2 = Segment(V1, W1)
g2 = Segment(V1, U1)
h2 = Segment(U1, S1)
i2 = Segment(S1, R1)
j2 = Segment(R1, Q1)
A2 = (31, 15)
B2 = (29, 15)
C2 = (-5, 5)
D2 = (-2.799937088893477, 4.968915785443886)
a = OrthogonalLine(G1, e2)
A = (17.44306119135141, -8.038415384496888)
c = 25.29999999999999 (slider from -5 to 30, step 0.1)
d = Circle(A, c)
B = Point(d)
e = Segment(A, B)
f = OrthogonalLine(A, e)
g = 4.400000000000002 (slider from -5 to 5, step 0.1)
h = Circle(A, g)
C, D = Intersect(h, f)
E = (-12.869815033253563, -9.993685244128887)
b = Line(E, xAxis)
F = Point(b)