Development of a tool of directed network Voronoi diagrams

Abstract

The purpose of this study is to propose the directed network Voronoi diagram (NVD) and to develop a tool for generating directed NVD. First, the paper defines two types of the directed NVD which are called outward NVD and inward NVD. Next, the paper shows roundtrip shortest path region is constructed by the above directed NVDs. Third, the paper shows the outlines of the tool of the directed NVDs and the algorithm of this tool. Forth, the paper shows examples of the applications of these NVDs. Last, the paper shows the difference between the non-directed NVD and the directed NVD.