In this paper we consider a new time metric called the Heavy Luggage Metric. This metric models the behavior of a traveller in a city wishing to walk as little as possible, maybe carrying some very heavy luggage. A transportation network allows the traveller to move between any pair of stations at cost zero, while walking has a cost proportional to the length of the walked path. We propose efficient algorithms for computing the closest and farthest Voronoi Diagrams for a set of points with respect to this metric.
['Manuel Abellanas', 'Ferran Hurtado', 'Belén Palop']
THE HEAVY LUGGAGE METRIC