| 注册
首页|期刊导航|测绘科学技术学报|面状要素在六角格网中的一种编码方法

面状要素在六角格网中的一种编码方法

郭宏伟 魏海平 于靖宇 蔡亚峰 张良

测绘科学技术学报2025,Vol.41Issue(3):319-324,6.
测绘科学技术学报2025,Vol.41Issue(3):319-324,6.DOI:10.3969/j.issn.1673-6338.2025.03.014

面状要素在六角格网中的一种编码方法

A Coding Method of Polygon Features in Hexagonal Grids

郭宏伟 1魏海平 1于靖宇 1蔡亚峰 1张良2

作者信息

  • 1. 信息工程大学,河南 郑州 450001
  • 2. 信息工程大学,河南 郑州 450001||国防科技大学 信息通信学院,陕西 西安 710000
  • 折叠

摘要

Abstract

Compared with the regular quadrilateral grid,the hexagonal grid has the advantages of consistent neigh-borhood and isotropy.However,the quantification and coding of polygon features based on hexagonal grids is easy to increase the management difficulty of hexagonal grid cells due to the influence of the geographic range and geo-metric shape of the polygon features.In this paper,the quantization of polygon features in hexagonal grids is stud-ied,and the Hilbert curve,a typical regular quadrilateral grid filling curve,is extended to the coding and lossless compression of polygonal features in hexagonal grids.First,a hexagonal grid is constructed,and the polygon fea-tures are quantified by using a similar bounding rectangle.Then,the bidirectional mapping relationships between the Hilbert curve and the corresponding grid cells of the polygon features are established.The Hilbert value set of the polygon features is determined,and then its run-length encoding and lossless compression are realized.Finally,the experimental analysis is carried out in different resolutions,and the coding compression efficiency and cluste-ring characteristics are compared with those of other coding methods to verify the advantages of the method.

关键词

面状要素/六角格网/Hilbert曲线/游程编码/数据压缩

Key words

polygon features/hexagonal grids/Hilbert curve/run length coding/data compression

分类

天文与地球科学

引用本文复制引用

郭宏伟,魏海平,于靖宇,蔡亚峰,张良..面状要素在六角格网中的一种编码方法[J].测绘科学技术学报,2025,41(3):319-324,6.

测绘科学技术学报

1673-6338

访问量0
|
下载量0
段落导航相关论文