©
Minimum distance "within an angle"
  Calculates a minimum distance within the sides of an angle, showing the solution image.
2024.Apr.20 08:10:55
γ (driven to 0 ≤ γ < 90°) Angle (see Figure).
x2 (x1 = 1;  x2 ≥ 0) Abscissa of B (end point), not < 0 for easier graph.

Calculates the minimum distance "within (the sides of) an angle" (see Figure), D = d1 + d2, to go from A, with (fixed) x1 = 1, to B, with x2, both on the x axis, passing by P, to be determined, on the half-line s, given the angle γ and x2. [γ := |MOD(γ, 90)| °.]

Point P = (x, y), with radial coordinate ρ, is found by differentiation (D' = 0), with solution x for x−1 = ½ (x1−1 + x2−1) sec²γ. In polar coordinates, it is ρ = 2 R cos γ  (R below) and θγ. Counterintuitively, as γ → 0, x tends to the harmonic (not the arithmetic) mean.

The extreme values for x and y are, thus: 0 ≤ x ≤ 2 x1 cos² γ ≤ 2 x1; and 0 ≤ yx1 sin 2γ x1. [Thus, the graph would not need to exceed (0, 0) to (2, 1).] As γ varies, P describes a circle with radius R centred at (R, 0), R = x1x2 ⁄ (x1 + x2).

A graph is made as the one in the Figure.

Fig
References: Plate: angdistRemote

• Casquilho, M., J. Buescu, 2011, "A minimum distance: arithmetic and harmonic means in a geometric dispute", International Journal of Mathematical Education in Science and Technology, 142(3), 399–405 (doi:10.1080/0020739X.2010.526253) (250 kB).

• Weisstein, Eric W., "Minimum", from MathWorld —a Wolfram Web Resource (2008-01-01).

• 1867-11-03: Kutta, Martin Wilhelm (1944-12-25).

 
 
Valid HTML 4.01! FCUL http://webpages.fc.ul.pt/~macasquilho/compute/Fx-angdistRemote.php
Created: 2012-11-03 — Last modified: 2014-10-04