Local edge matching for seamless adjacent spatial datasets with sequence alignment

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

This study proposes a local edge matching method with a sequence alignment technique for adjacent spatial datasets. By assuming that the common boundary edges of the datasets are point strings, the proposed method obtains the sequence for point edit operations to align the edges by using the string matching algorithm with the following operations: (1) snapping two points from each string to their average position, (2) removing a point from one string and (3) removing a point from the other string. The costs for these operations are derived from the deformation of the involved line segments in terms of the angle and length changes. The corresponding point pairs are then considered point pairs for which the snapping operation is chosen in a sequence. Based on these pairs, a border area of adjacent spatial datasets can be partitioned into sub-border areas where distinctive matching and alignment processes can be performed.

Cite

CITATION STYLE

APA

Huh, Y. (2015). Local edge matching for seamless adjacent spatial datasets with sequence alignment. ISPRS International Journal of Geo-Information, 4(4), 2061–2077. https://doi.org/10.3390/ijgi4042061

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free