Author: Daniel Mentrard

a

a

a

a

a

b

c

a

a

a

c

b

A

B

C

A

B

C

D

 P = a + b +c

P = 4 x a

Perímetro de un triángulo

Perímetro del cuadrado

Ver

O = (2.836228399699475, 3.4510743801652897)
g = 0 (slider from 0 to 2.5, step 0.1)
a = 2.5 (slider from -5 to 5, step 0.1)
c1 = Circle(O, a / 1.5)
R = Point(c1)
Q = Point(c1)
P = Point(c1)
α = Angle(P, R, Q)
Q' = Rotate(Q, -(g / 2.5) * (3.141592653589793 - α), R)
P' = Rotate(P, -(g / 2.5) * (3.141592653589793 - α), R)
β = Angle(R, Q, P)
A = (4, 0)
c = Circle(A, a)
B = Point(c)
b = Segment(B, A)
d = OrthogonalLine(B, b)
e = OrthogonalLine(A, b)
C, D = Intersect(c, e)
f = Line(C, b)
E = Intersect(f, d)
poly1, b_1, e_1, c_1, a_1 = Polygon(B, E, C, A)
C' = Rotate(C, g, C)
A' = If(g < 1.57, Rotate[A, -(g), C], Mirror[E, C])
h = Segment(C', A')
A'_1 = If(g < 1.57, Rotate[A, -(g), C], Mirror[E, C])
F = Mirror(E, C)
i = OrthogonalLine(A'_1, h)
k = Circle(A'_1, b)
G, H = Intersect(k, i)
j = OrthogonalLine(H, i)
p = Circle(H, b)
I, J = Intersect(p, j)
l = Segment(H, A'_1)
m = Segment(H, J)
K = Mirror(C, F)
H' = If(g < 1.57, Rotate[H, -(g), A'], Mirror[C, F])
A'_1' = Rotate(A'_1, -(g), A')
n = Segment(H', A'_1')
q = OrthogonalLine(H', n)
r = Circle(H', b)
L, M = Intersect(r, q)
s = Segment(L, H')
N = Mirror(F, K)
L' = If(g < 1.57, Rotate[L, -(g), H'], Mirror[F, K])
H'' = Rotate(H', -(g), H')
t = Segment(L', H'')
poly2, r_1, p_1, q_1 = Polygon(P, Q, R)
R' = Rotate(R, -(g), R)
R'_1 = Rotate(R, -(g), R)
poly2', r'_1, p', q' = Polygon(P', Q', R'_1)
R'_1' = Rotate(R'_1, -(g), P')
a1 = Segment(R, P')
Q'' = Rotate(Q', -(g / 2.5) * (α + β), P')
b1 = Segment(P', Q'')
S = Midpoint(A', H')
T = Midpoint(H', L')
U = Midpoint(p_1)
V = Midpoint(a1)
W = Midpoint(b1)
Z = Midpoint(e_1)
A1 = Midpoint(h)
B1 = Midpoint(B, E)
C1 = Midpoint(B, A)
D1 = Midpoint(P, R)
E1 = Midpoint(P, Q)
F1 = Midpoint(A, C)