Copyright ACM, 2000
next up previous


Muhammad Abaidullah ANWAR and Takaichi YOSHIDA,
Kyushu Institute of Technology,
680-4 Kawazu, Iizuka, 820-8502 JAPAN
{takaichi, anwar}


Travelling is a part of human beings day-to-day life. The huge and complicated road network in a country makes it difficult to find a shortest (best) route for travelling from one place to another. Many shorts route finding algorithms have been designed. Since route finding involves a massive and complicated road network data therefore, it is necessary to arrange the data in such a way that it's retrieval, especially a part of the road or road sub-network in a specific part of the country, should be efficient and unnecessary data processing is avoided. This paper presents an object-oriented road network data model in which we divide the road into road segments and road network into road sub-networks, into levels in which a country is divided administratively, i.e. prefectures, cities, etc. We have implemented the model for shortest route finding.


GIS, Dijkstra's Algorithm, Road Segmentation, Object-oriented Database.

next up previous
M.Abaidullah ANWAR

Copyright 2000 ACM

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and or fee.
SAC 2000 March 19-21 Como, Italy
(c) 2000 ACM 1-58113-239-5/00/003>...>$5.00