Vol. 3, Issue 12, Part A (2017)
Voronoi cell to find optimal paths for the transportation problem
Voronoi cell to find optimal paths for the transportation problem
Author(s)
S Lakshmi and P Jeevitha
Abstract
Transportation networks model facilities for fast movement on the plane. A transportation network, together with its underlying distance, induces a new distance. Previously, only the Euclidean and the L 1 distances have been considered as such underlying distances. However, this paper first considers distances induced by general distances and transportation networks, and present a unifying approach to compute Voronoi diagrams under such a general setting. With this approach, we show that an algorithm for convex distances can be easily obtained.
How to cite this article:
S Lakshmi, P Jeevitha. Voronoi cell to find optimal paths for the transportation problem. Int J Appl Res 2017;3(12):17-20.