An Entity of Type: disease, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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 contexts by a number of people (see references below).

Property Value
dbo:abstract
  • 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 contexts by a number of people (see references below). Since the 1990s, 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. (en)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 20589034 (xsd:integer)
dbo:wikiPageLength
  • 11476 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1089577445 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • 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 contexts by a number of people (see references below). (en)
rdfs:label
  • Mountain climbing problem (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License
  NODES
Association 2
Project 1