2021International Journal of Geographical Information SystemsRequires access

Computation of the distance between a polygon and a point in spatial analysis

Wangshu Mu, Daoqin Tong

Open publisher page 5 citations

Abstract

Distance is one of the most important concepts in geography and spatial analysis. Since distance calculation is straightforward for points, measuring distances for non-point objects often involves abstracting them into their representative points. For example, a polygon is often abstracted into its centroid, and the distance from/to the polygon is then measured using the centroid. Despite the wide use of representative points to measure distances of non-point objects, a recent study has shown that such a practice might be problematic and lead to biased coefficient estimates in regression analysis. The study proposed a new polygon-to-point distance metric, along with two computation algorithms. However, the efficiency of these distance calculation algorithms is low. This research provides three new methods, including the random point-based method, polygon partitioning method, and axis-aligned minimum areal bounding box-based (MABB-based) method, to compute the new distance metric. Tests are provided to compare the accuracy and computational efficiency of the new algorithms. The test results show that each of the three new methods has its advantages: the random point-based method is easy to implement, the polygon partitioning method is most accurate, and the MABB-based method is computationally efficient.

About this research paper

What this paper is about

Distance is one of the most important concepts in geography and spatial analysis. Since distance calculation is straightforward for points, measuring distances for non-point objects often involves abstracting them into their representative points. For example, a polygon is often abstracted into its centroid, and the distance from/to the polygon is then measured using the centroid. Despite the wide use of representative points to measure distances of non-point objects, a recent study has shown that such a practice might be problematic and lead to biased coefficient estimates in regression analysis. The study proposed a new polygon-to-point distance metric, along with two computation algorithms. However, the efficiency of these distance calculation algorithms is low. This research provides three new methods, including the random point-based method, polygon partitioning method, and axis-aligned minimum areal bounding box-based (MABB-based) method, to compute the new distance metric. Tests are provided to compare the accuracy and computational efficiency of the new algorithms. The test results show that each of the three new methods has its advantages: the random point-based method is easy to implement, the polygon partitioning method is most accurate, and the MABB-based method is computationally efficient.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Distance is one of the most important concepts in geography and spatial analysis. Since distance calculation is straightforward for points, measuring distances for non-point objects often involves abstracting them into their representative points. For example, a polygon is often abstracted into its centroid, and the distance from/to the polygon is then measured using the centroid. Despite the wide use of representative points to measure distances of non-point objects, a recent study has shown that such a practice might be problematic and lead to biased coefficient estimates in regression analysis. The study proposed a new polygon-to-point distance metric, along with two computation algorithms. However, the efficiency of these distance calculation algorithms is low. This research provides three new methods, including the random point-based method, polygon partitioning method, and axis-aligned minimum areal bounding box-based (MABB-based) method, to compute the new distance metric. Tests are provided to compare the accuracy and computational efficiency of the new algorithms. The test results show that each of the three new methods has its advantages: the random point-based method is easy to implement, the polygon partitioning method is most accurate, and the MABB-based method is computationally efficient.

Key concepts: Polygon (computer graphics), Point in polygon, Point (geometry), Metric (unit), Computation, Centroid, Bounding overwatch, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Computation of the distance between a polygon and a point in spatial analysis — Research Paper | ScholarLens