Árbol de Steiner:
minimiza la suma de las distancias a los vértices

PROCESO FINALIZADO

A = (-6.45, 3.99)
D = (4.95, 6.31)
B = (-4.29, -3.01)
F: (-9, 2)
anima = 0.07 (slider from 0 to 1, step 0.01)
inc = 0.1 (slider from 0 to 0.1, step 0.01)
F0 = (-1.3883000000000134, 1.7239999999999993)
dif0 = 20
C = (7.81, -4.73)
G: (8, 2)
G0 = (-1.1354999999999866, -0.7272000000000001)
dif: abs(F - A) + abs(F - D) + abs(F - G) + abs(G - B) + abs(G - C)
αG = Angle(B, G, C)
αF = Angle(D, F, A)
βF = Angle(A, F, G)
γF = Angle(G, F, D)
βG = Angle(F, G, B)
γG = Angle(C, G, F)
f = Segment(A, F)
g = Segment(F, D)
h = Segment(F, G)
i = Segment(G, B)
j = Segment(G, C)
vel: 1
animación = false
regF: {(-9, 2)}
regG: {(8, 2)}
polF = PolyLine(regF)
polG = PolyLine(regG)