Network nearest neighbor distance methods for lines or polygons and development of a tool of the methods
暂无分享,去创建一个
The purposes of this paper are: to propose the network nearest neighbor distance methods(N-NNDs) which analyze the distribution of points in relations to lines and polygons on a network; and to develop a GIS-based tool for performing these methods. First, the paper formulates the line N-NND method and the polygon N-NND method. Second, the paper develops computation tools for those methods. Third, the paper implements these computation methods as a GIS-based tool. Last, the paper tests applicability of the proposed methods to actual data analysis using the tool.
[1] M. Erwig. The graph Voronoi diagram with applications , 2000 .
[2] Atsuyuki Okabe,et al. The Statistical Analysis of a Distribution of Activity Points in Relation to Surface-Like Elements , 1988 .
[3] Atsuyuki Okabe,et al. A Conditional Nearest-Neighbor Spatial-Association Measure for the Analysis of Conditional Locational Interdependence , 1984 .