THE HEAVY LUGGAGE METRIC

DOI10.1142/S0218195908002635zbMath1158.65012OpenAlexW2143037700MaRDI QIDQ3527436

Manuel Abellanas, Ferran Hurtado, Belén Palop

Publication date: 29 September 2008

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195908002635

zbMATH Keywords

algorithmsVoronoi diagramtransportation networktime metricheavy luggage metric

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Traffic problems in operations research (90B20)

Related Items (3)

A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments ⋮ Optimal location of transportation devices ⋮ Highway hull revisited

Cites Work

• Voronoi diagram for services neighboring a highway
• The transportation metric and related problems
• Concrete and abstract Voronoi diagrams
• Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean \(d\)-dimensional space
• FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
• Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
• Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry

This page was built for publication: THE HEAVY LUGGAGE METRIC