Shortest Gently Descending Paths (Q3605485): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 02:40, 29 June 2024

scientific article

Language	Label	Description	Also known as
English	Shortest Gently Descending Paths	scientific article

Statements

scholarly article

0 references

Shortest Gently Descending Paths (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-00202-1_6

0 references

0 references

0 references

Anil Maheshwari

0 references

WALCOM: Algorithms and Computation

0 references

publication date

24 February 2009

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-00202-1_6

0 references

0 references

Approximation algorithms for shortest descending paths in terrains

0 references

Shortest descending paths through given faces

0 references

SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM

0 references

Determining approximate shortest paths on weighted polyhedral surfaces

0 references

Querying approximate shortest paths in anisotropic regions

0 references

Trekking in the alps without freezing or getting tired

0 references

0 references

The weighted region problem

0 references

Shortest monotone descent path problem in polyhedral terrain

0 references

On discretization methods for approximating optimal paths in regions with direction-dependent costs

0 references

0 references

On finding approximate optimal paths in weighted regions

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3605485

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3605485&oldid=35094483"