| Meno: | Martin
|
|---|
| Priezvisko: | Kolínek
|
|---|
| Názov: | Computation of Isochrones
|
|---|
| Vedúci: | RNDr. Richard Ostertág, PhD.
|
|---|
| Rok: | 2014
|
|---|
| Blok: | INF
|
|---|
| Kµúčové slová: | isochrone, road network, spatial network, reachability
|
|---|
| Abstrakt: | Isochrones are parts of a map which can be reached from a given starting point within given time limit. Several authors have studied them. They have som uses in urban planning, or navigation. We study isochrones for two modes of transportation. One of them is constrained to a road network. The other one is slower, but is not constrained.
In this thesis, we deal with the ways isochrones can be computed. There have been recent advances in route planning algorithms. Because finding isochrones is a related problem to route planning, we tried to find ways to speed up isochrone search using the techniques from route planning algorithms.
|
|---|