{"title":"Handling arbitrary polygon query based on the boolean overlay on a geographical information system","authors":"I. Suwardi, D. Lestari, Dicky Prima Satya","doi":"10.1109/ICAICTA.2015.7335376","DOIUrl":null,"url":null,"abstract":"Current Geographical Information System (GIS) has been applied the classical point-in-polygon algorithm such as the ray casting algorithm and winding algorithm to conduct spatial analysis. These algorithms have linear complexity with the number of points available in the map. In this paper, we introduce an efficient algorithm to handle arbitrary polygonal queries on a GIS based on the boolean overlay. The algorithm is able to find whether a point is inside, outside, or on the boundary of a given polygon by utilizing a very simple boolean overlay mechanisms in a GIS. Experimental results show that the algorithm works very accurate with 100% accuracy and works very fast.","PeriodicalId":319020,"journal":{"name":"2015 2nd International Conference on Advanced Informatics: Concepts, Theory and Applications (ICAICTA)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 2nd International Conference on Advanced Informatics: Concepts, Theory and Applications (ICAICTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAICTA.2015.7335376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Current Geographical Information System (GIS) has been applied the classical point-in-polygon algorithm such as the ray casting algorithm and winding algorithm to conduct spatial analysis. These algorithms have linear complexity with the number of points available in the map. In this paper, we introduce an efficient algorithm to handle arbitrary polygonal queries on a GIS based on the boolean overlay. The algorithm is able to find whether a point is inside, outside, or on the boundary of a given polygon by utilizing a very simple boolean overlay mechanisms in a GIS. Experimental results show that the algorithm works very accurate with 100% accuracy and works very fast.
目前的地理信息系统(geographic Information System, GIS)已经采用经典的多边形点算法，如光线投射算法和缠绕算法进行空间分析。这些算法与地图中可用点的数量呈线性关系。本文介绍了一种基于布尔叠加的高效处理GIS上任意多边形查询的算法。该算法通过利用GIS中非常简单的布尔叠加机制，能够找到一个点是在给定多边形的内部，外部还是在边界上。实验结果表明，该算法的准确率达到100%，并且速度很快。
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
