多边形(计算机图形学)
一般化
光栅图形
平方(代数)
数学
光栅数据
算法
六角形瓷砖
六方晶系
立方体(代数)
联营
点在多边形内
计算机科学
组合数学
人工智能
多边形网格
几何学
网格
数学分析
电信
化学
帧(网络)
结晶学
作者
Lu Wang,Tinghua Ai,Dirk Burghardt,Yilang Shen,Min Yang
标识
DOI:10.1080/13658816.2022.2108036
摘要
Numerous methods based on square rasters have been proposed for polygon generalization. However, these methods ignore the inconsistent distance measurement among neighborhoods of squares, which may result in an imbalanced generalization in different directions. As an alternative raster, a hexagon has consistent connectivity and isotropic neighborhoods. This study proposed a hexagon-based method for polygon generalization using morphological operators. First, we defined three generalization operators: aggregation, elimination, and line simplification, based on hexagonal morphological operations. We then used corrective operations with selection, skeleton, and exaggeration to detect, classify, and correct the unreasonably reduced narrow parts of the polygons. To assess the effectiveness of the proposed method, we conducted experiments comparing the hexagonal raster to square raster and vector data. Unlike vector-based methods in which various algorithms simplified either areal objects or exterior boundaries, the hexagon-based method performed both simplifications simultaneously. Compared to the square-based method, the results of the hexagon-based method were more balanced in all neighborhood directions, matched better with the original polygons, and had smoother simplified boundaries. Moreover, it performed with shorter running time than the square-based method, where the minimal time difference was less than 1 min, and the maximal time difference reached more than 50 mins.
科研通智能强力驱动
Strongly Powered by AbleSci AI