Optimal Running Path Around a Triangular House

The Optimal Running Path Around a Triangular House is the problem of minimizing the total distance traveled by a runner who, starting from some point, must touch each of the three straight walls of a triangular building and (in most versions) return to the start. The central mathematical tool is reflection: by reflecting the start (or the path) across each wall, the broken running path is "unfolded" into a straight line, and the shortest path between two points is a straight segment. This matters because it is the cleanest elementary example of how a hard-looking minimization over a path reduces to ordinary straight-line geometry. The surprising fact: when the path must touch all three sides and the triangle is acute, the shortest inscribed triangle path is the orthic triangle — formed by the feet of the three altitudes — discovered via a brilliant reflection argument by Fejér.

The Core Insight

A path that bounces off a wall obeys the law of reflection (angle in = angle out) precisely when it is shortest. Equivalently, reflecting the start point across a wall turns "go to the wall then continue" into "go straight to the mirror image." Chain these reflections and the optimal multi-touch path becomes a single straight segment in an unfolded copy of the plane.

Formal Statement

The Triangular House Running Problem

Let triangle $△ABC$ represent the house, with side lengths $a=BC$, $b=CA$, $c=AB$. A runner located at point $P$ must touch a sequence of walls and return to $P$. We measure the total path length $L$ and seek its minimum.

Two canonical versions exist:

• (V1) Fixed start, return to start, touch one wall: Touch line $\ell$ once and come back; minimize $L=|PX|+|X{P}^{\prime }|$-type sums.
• (V2) Inscribed triangle / full lap: Choose one point on each side, $X\in BC$, $Y\in CA$, $Z\in AB$, and run the closed loop $X\to Y\to Z\to X$. Minimize the perimeter

Reflection of a Point Across a Line

Given a point $P$ and a line $\ell$, the reflection $P^{\prime }$ satisfies: $\ell$ is the perpendicular bisector of segment $P{P}^{\prime }$. The key distance-preserving property is, for any point $X$ on $\ell$,

Reflection Principle for Shortest Touch-Path

For version (V1), the runner starting at $P$, touching line $\ell$ at point $X$, and continuing to a target $Q$, minimizes total distance $|PX|+|XQ|$ when

achieved exactly when $X$ lies on the straight segment $P^{\prime }Q$, where $P^{\prime }$ is the reflection of $P$ across $\ell$. The optimal $X$ obeys the law of reflection: the incoming and outgoing rays make equal angles with $\ell$.

Fagnano–Fejér: Minimal Inscribed Triangle

For an acute triangle $△ABC$, version (V2)'s minimum-perimeter inscribed triangle is the orthic triangle $△X_0{Y}_0{Z}_0$, whose vertices are the feet of the three altitudes. Its perimeter is

equivalently expressible as $L_{\min }=(a\cos A+b\cos B+c\cos C)$, and the orthic triangle's sides satisfy a reflection (equal-angle) condition at each touch point.

Why It Holds / Derivation

Reflection gives the shortest single-wall touch (V1)

Fejér's reflection argument for the orthic minimum (V2, acute case)

The orthic-triangle result holds only for acute triangles. If $△ABC$ is right or obtuse, the minimum "inscribed triangle" degenerates: the infimum perimeter approaches $2h$ (twice the shortest altitude) but is not attained by a genuine triangle. Always check the triangle is acute before invoking equation [4].

Reflection unfolding: the bounce path straightens into a line

Heron of Alexandria | c. 10–70 AD

Heron first proved that light reflecting off a mirror takes the shortest path, establishing the equal-angle law via a geometric (reflection) argument — the exact tool that solves the running-around-the-house problem. His insight predated the modern variational principle by over 1500 years and reframed an optics fact as a pure minimization, the conceptual seed of every "billiard path" result here.

Building Intuition

Imagine standing at $P$ inside a mirrored room; you throw a ball that must bounce off one wall and reach a friend at $Q$. The ball "wants" the straightest route. Through the mirror, the friend's image $Q$ (or your image $P^{\prime }$) appears behind the wall, and the straight line of sight to that image marks where the ball must strike. Running around a triangular house is the same trick chained three times: each wall is a mirror, and "unfolding" the triangle by repeated reflection turns the zigzag lap into one straight ruler-line. The optimal touch points are simply where that ruler-line crosses each wall.

Worked Examples

Single-wall touch with numbers

Orthic-triangle lap of an acute house

Common Misconceptions

Obtuse house breaks the formula

Take $△ABC$ with $A=120^{\circ }$, $B=40^{\circ }$, $C=20^{\circ }$. Here $\cos A=\cos 120^{\circ }=-0.5<0$, so equation [4] would yield a negative contribution from the $a\cos A$ term — a sign that no genuine minimal inscribed triangle exists. Geometrically, the altitude foot from the obtuse vertex lands outside the triangle, so the orthic "triangle" is not inscribed. The infimum perimeter slides toward $2h_{\min }$ (twice the shortest altitude) but is never realized; the optimal "path" degenerates to a back-and-forth along that altitude.

Connections

This problem is the elementary face of Billiard Dynamics: a frictionless ball in a triangular table follows exactly the equal-angle reflections derived here, and the orthic triangle is the unique closed billiard orbit of period 3 in an acute triangle. It rests on the Triangle Inequality (the engine of every shortest-path argument) and on Reflections and Isometries. The minimization-by-unfolding is the discrete cousin of Fermat's Principle of Least Time in optics and a baby version of the Calculus of Variations. The altitude feet tie it to The Orthocenter and Altitudes.

Real-World Applications

• Sports facility planning: A coach designing a sprint-and-touch drill around a triangular field minimizes athlete fatigue by placing touch markers at altitude feet.
• Optical resonators (laser cavities): Multi-mirror cavities exploit the same reflection-unfolding to compute closed light paths; triangular ring resonators use period-3 orbits.
• Robotics patrol routing: A guard robot tasked to inspect all three perimeter walls of a triangular compound and return uses the reflection principle to minimize battery use.
• Pipeline/cable routing to a wall: Connecting two facilities while touching a shared boundary (a river or property line) is the textbook V1 reflection problem.
• Acoustics: Sound-focusing in triangular halls follows billiard reflection; designers use orthic-orbit analysis to predict echo paths.
• Computer graphics ray tracing: Mirror-reflection rendering is literally the reflection principle applied repeatedly across surfaces.
• GPS-free surveying drills: Orienteering courses set "control points" on field edges; the shortest legal route uses the same straightening trick.

Historical Development

• c. 60 AD — Heron of Alexandria proves the equal-angle reflection law as a minimization, founding the shortest-bounce idea.
• 1657 — Pierre de Fermat formulates the principle of least time, generalizing Heron to refraction and giving variational legitimacy to reflection paths.
• 1775 — Giovanni Fagnano poses and solves (via calculus) the inscribed-triangle minimal-perimeter problem, identifying the orthic triangle for acute triangles.
• 1900s — Lipót Fejér supplies the celebrated elementary double-reflection proof (reproduced above), removing the calculus and revealing the geometry.
• 1924 — George Birkhoff develops the theory of dynamical billiards, placing triangular reflection orbits in a rigorous dynamical-systems frame.
• 1940s — Richard Courant & Herbert Robbins popularize the reflection/orthic argument in What Is Mathematics?, making it a standard expository gem.
• 1960s–70s — Billiard research (Sinai and others) connects period-3 orbits and the orthic triangle to ergodic theory.
• Present — The triangular-billiard problem remains a live test case for periodic-orbit existence in non-acute and irrational-angle triangles.

Subtleties & Limits

The acute case is fully solved, but the general triangular billiard problem is famously hard: it is unknown whether every obtuse (and in particular every irrational-angle) triangle admits a closed billiard orbit at all. While right and obtuse triangles defeat the orthic-triangle minimizer, the existence of any periodic running path that touches the walls and returns is open for large classes of obtuse triangles — a striking gap given how elementary the acute case appears. The "shortest lap" thus transitions from a clean high-school exercise to an unresolved frontier of dynamical systems the moment the largest angle exceeds $90^{\circ }$.

See Also