Mountain Climbing Problem
Versandkostenfrei!
Versandfertig in 6-10 Tagen
26,99 €
inkl. MwSt.
PAYBACK Punkte
13 °P sammeln!
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, the mountain climbing problem is a problem of finding conditions 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 reach to the top while always staying at the same height. This problem was named and posed in this form by James V. Whittaker in 1966, but its history goes back to Tatsuo Homma, who solved a version ...
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, the mountain climbing problem is a problem of finding conditions 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 reach to the top while always staying at the same height. This problem was named and posed in this form by James V. Whittaker in 1966, but its history goes back to Tatsuo Homma, who solved a version of it in 1952. The problem has been repeatedly rediscovered and solved independently in different context by a number of people (see the references). In the past two decades the problem was shown to be connected to the weak Fréchet distance of curves in the plane (see Buchin et al.), various planar motion planning problems in computational geometry (see Goodman et al.), the square peg problem (see Pak), semigroup of polynomials (see Baird and Magill), etc.
