A fast two-level grid index algorithm for common edge extraction in vector data compression

ABSTRACT

In this paper, a fast common edge extraction method based on a two-level grid indexing strategy was proposed for eliminating the common edge ‘cracks’. A coarse-grained first-level grid index was firstly built which maps each polygon with its intersecting polygons in the graphics set; secondly, a fine-grained second-level grid index is established linking each grid cell with the vertices falling into the cell, which can be used to quickly find the common points shared by intersecting polygons. The common edge ‘cracks’ problem can be solved if the deleted common points are consistent on two adjacent graphics during compression.

KEYWORDS:

• Common edge crack
• topological inconsistency
• grid index

Disclosure statement

No potential conflict of interest was reported by the authors.

Correction Statement

This article has been republished with minor changes. These changes do not impact the academic content of the article.

Additional information

Funding

This work is jointly funded by Science and Technology Key Project of Henan Province of China (grant no. 202102311007), the Project of Science and Technology of the Henan province in China (grant no. 212102310086)