A cell-based algorithm for evaluating directional distances in GIS

• Published in: International journal of geographical information science : IJGIS Vol. 24; no. 4; pp. 577 - 590
• Main Authors: Yang, S., Yong, J. H., Sun, J. G., Gu, H. J., Paul, J. C.
• Format: Journal Article
• Language: English
• Published: Taylor & Francis 01.04.2010
• Subjects: directional distance; fetch length; Indexing in process; point-in-polygon; Q1; uniform subdivision
• ISSN: 1365-8816; 1362-3087
• DOI: 10.1080/13658810902988419

Directional distance is commonly used in geographical information systems as a measure of openness. In previous works, the sweep line method and the interval tree method have been employed to evaluate the directional distances on vector maps. Both methods require rotating original maps and study points in every direction of interest. In this article, we propose a cell-based algorithm that pre-processes a map only once; that is, it subdivides the map into a group of uniform-sized cells and records each borderline of the map into the cells traversed by its corresponding line segment. Based on the pre-processing result, the neighbouring borderlines of a study point can be directly obtained through the neighbouring cells of the point, and the borderlines in a definite direction can be simply acquired through the cells traversed by the half line as well. As a result, the processing step does not need to enumerate all the borderlines of the map when determining whether a point is on a borderline or finding the nearest intersection between a half line and the borderlines. Furthermore, we implement the algorithm for determining fetch length in coastal environment. Once the pre-processing is done, the algorithm can work in a complex archipelago environment such as to calculate the fetch lengths in multiple directions, to determine the inclusion property of a point, and to deal with the singularity of a study point on a borderline.