Improving and evaluating boundary algebra filling for identifying polygon intersections
- 52 Downloads
Polygon intersection is important for data processing in geographic information systems. For large datasets, spatial indexing methods such as R-tree allow the identification of polygon intersections, but often retrieve inaccurate results. An improved boundary algebra filling (iBAF) method was preliminarily proposed as an alternative to R-tree. However, its applicability, performance, and accuracy require optimization, and its application conditions remain to be unveiled. This study develops version iBAF 2.0 for a more efficient identification and evaluates performance for different computational intensities and applications. Both intersecting polygons and raster zones within intersections can be rapidly grouped in the rasterized cells of input polygons. The resulting polygons can then be generated by configuring the polygon groups or converting the zones into vectors. We use complexity ratio CR, which is defined as the sum of the number of polygons in each actually intersecting group divided by the total number of polygons, to represent the computational intensity. Two land-use datasets containing 4295 and 741,562 polygons are considered, and we establish test cases containing the same polygons with varying CR. Experimental results show that iBAF 2.0 outperforms R-tree when applied to topology verification; however, its performance is conditional for polygon overlay and area calculation between two layers. Specifically, iBAF 2.0 exhibits higher-efficiency grouping of polygons and raster zones when CR exceeds specific thresholds. In addition, better scalability is achieved compared to R-tree when polygons with complex shapes and additional layers are considered.
KeywordsGeographic information systems Polygon intersection Polygon rasterization Boundary algebra filling R-tree
This work was supported by the National Key R&D Program of China (Grant number 2017YFB0504205).
Compliance with ethical standards
Conflict of interest
No potential conflict of interest was reported by the authors.
- Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pp 322–331. https://doi.org/10.1145/93597.98741
- Belciu AV, Olaru S (2010) Optimizing Spatial Databases. Inform Econ J 14(2):61–71Google Scholar
- Chang KT (2008) Introduction to geographic information systems. McGraw-Hill, New YorkGoogle Scholar
- Dong H, Cheng ZL, Fang JY (2009) One rasterization approach algorithm for high performance map overlay. In: proceedings of 17th international conference on Geoinformatics. https://doi.org/10.1109/GEOINFORMATICS.2009.5293561
- Gao Y, Wu B, Luo JX, Qiu HP (2017) GPU-based arbitrary polygon intersection area algorithm. In: Proceedings of 3rd international symposium on mechatronics and industrial informatics (ISMII 2017), pp 99–105. https://doi.org/10.12783/dtetr/ismii2017/16652
- Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of DataGoogle Scholar
- Longley PA, Goodchild MF, Maguire DJ, Rhind DW (2015) Geographic information science and systems. John Wiley & Sons, New YorkGoogle Scholar
- Puri S, Prasad SK (2014) Output-sensitive parallel algorithm for polygon clipping. In: Proceedings of IEEE International Conference on Parallel Processing, pp 241–250. https://doi.org/10.1109/ICPP.2014.33
- Puri S, Prasad SK (2015) A parallel algorithm for clipping polygons with improved bounds and a distributed overlay processing system using MPI. In: Proceedings of IEEE/ ACM International Symposium on Cluster, Cloud and Grid Computing, pp 576–585. https://doi.org/10.1109/CCGrid.2015.43
- Puri S, Agarwal D, He X, Prasad SK (2013) MapReduce algorithms for GIS polygonal overlay processing. In: Proceedings of IEEE 27th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), pp 1009–1016. https://doi.org/10.1109/IPDPSW.2013.254
- Ren FH (1989) Theory, method and application of geographical information system. Peking University, DissertationGoogle Scholar
- Sellis T, Roussopoulos N, Faloutsos C (1987) The R+-tree: a dynamic index for multi-dimensional objects. In: proceedings of the 13th international conference on very large data. Bases:507–518Google Scholar
- Shi X (2012) System and Methods for Parallelizing Polygon Overlay Computation in Multiprocessing Environment. US 20120320087 A1Google Scholar
- Weiler K, Atherton P (1977) Hidden surface removal using polygon area sorting. In: Proceedings of the 4th Annual Conference on Computer Graphics and Interactive Techniques, pp 214–222. https://doi.org/10.1145/563858.563896