A = (0.14, 3.82)
B = (5.76, 4.66)
C = (7.92, 3.62)
D = (5.46, 1.84)
E = (3, 3.4)
F = (1.68, 2.32)
G = (1.04, 4.26)
H = (0.58, 1.66)
I = (3.46, 0.9)
J = (4.74, 2.74)
K = (3.16, 5.08)
L = (-1.08, 2.34)
list1: {A, B, C, D, E, F, G, H, I, J, K, L}
loc1 = Voronoi(list1)
n = 5 (slider from 1 to 6, step 1)
loc2 = DelauneyTriangulation(list1)
loc3 = ConvexHull(list1)
loc4 = TravelingSalesman(list1)
a = Segment(L, H)
b = Segment(L, A)
c = Segment(A, G)
d = Segment(G, F)
e = Segment(F, E)
f = Segment(E, K)
g = Segment(K, G)
h = Segment(K, B)
i = Segment(B, E)
j = Segment(E, J)
k = Segment(J, B)
l = Segment(B, C)
m = Segment(C, J)
p = Segment(J, D)
q = Segment(D, C)
r = Segment(D, I)
s = Segment(J, I)
t = Segment(I, E)
a_1 = Segment(F, I)
b_1 = Segment(F, H)
c_1 = Segment(L, F)
list2: {list1, a, b, c, d, e, f, g, h, i, j, k, l, m, p, q, r, s, t, a_1, b_1, c_1}
loc5 = ShortestDistance(list2, C, L, true)
loc6 = MinimumSpanningTree(list1)