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

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; secon...

Full description

Saved in:
Bibliographic Details
Published inJournal of spatial science Vol. 68; no. 4; pp. 759 - 773
Main Authors Yang, Wei, Li, Qiaojun, Li, Xiaoning, Li, Shuxia, Feng, Xianju, Ren, YueMei, Wang, Ling
Format Journal Article
LanguageEnglish
Published Taylor & Francis 02.10.2023
Subjects
Common edge crack
grid index
topological inconsistency
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1449-8596
1836-5655
DOI:10.1080/14498596.2022.2150702