Mountain Climbing Problem

(Discrete Geometry)

Logo of Mountain climbing problem
Discrete Geometry
Link to Dbpedia

What is Mountain climbing problem?

In mathematics, the mountain climbing problem is a problem of finding the conditions that two functions forming profiles of a two-dimensional mountain must satisfy, so that two climbers can start on the bottom on the opposite sides of the mountain and coordinate their movements to meet (possibly at the top) while always staying at the same height. This problem was named and posed in this form by James V. Whittaker , but its history goes back to Tatsuo Homma , who solved a version of it. The problem has been repeatedly rediscovered and solved independently in different context by a number of people (see references below). In the past two decades the problem was shown to be connected to the weak Fréchet distance of curves in the plane, various planar motion planning problems in computational geometry, the inscribed square problem, semigroup of polynomials, etc. The problem was popularized in the article by , which received the Mathematical Association of America's Lester R. Ford Award in 1990.

Technology Types

conditiondifficultydiscrete geometrymathematical problemproblemrecreational mathematic


Mountain climbers' problem

Tech Info

Source: [object Object]
 — Date merged: 11/6/2021, 1:32:42 PM
 — Date scraped: 5/20/2021, 5:50:50 PM