[Home ] [Archive]   [ فارسی ]  
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
Main Menu
Home::
Journal Information::
Articles archive::
For Authors::
For Reviewers::
Registration::
Contact us::
Site Facilities::
::
Search in website

Advanced Search
..
Receive site information
Enter your Email in the following box to receive the site news and information.
..
:: Volume 12, Issue 3 (12-2024) ::
jgit 2024, 12(3): 85-104 Back to browse issues page
A new approach in implementing geometric simplification algorithms of linear features with the aim of controlling the degree of simplification
Amir Gholami , Abolfazl Ghanbari * , Neda Kaffash Charandabi
university of Tabriz
Abstract:   (522 Views)
Geographers and cartographers have been interested in the geometric simplification of linear features since the early 1900s. Its relevance has grown with time and the rise in data creation volume. Most of the algorithms described by different researchers work on the basis of the threshold limit and have no special control on the amount of geometric simplification. Thus, in this study, a technique was proposed for determining the percentage or number of reductions in the beginning points of the linear features without using trial and error. This methodology was used to the Douglas-Poker (DP) and Visvalingam-Whyatt (VW) algorithms to identify optimal nodes for an arbitrary quantity (n), and the results were assessed using three distinct datasets.
which demonstrated that, while cadastering agricultural land, each of the suggested algorithms can accurately choose 80% of the spots chosen by an expert surveyor, with a 98.68% accuracy rate in computing the area and a 95 cm error rate in determining the location.
The results of checking the quality of simplification by the proposed algorithms based on DP and VW, based on three different indicators, show that the average error by sliver polygons, average curvature similarity percentage, and angle sharpness similarity percentage for 10%, 30%, 50%, 70%, and 90% simplification on the fourteen recorded trajectories, was 0.50, 72.30, and 71.85 for the DP-based algorithm and 0.45, 70.34, and 69.84 for the VW-based approach.
It has also been demonstrated that, even after optimizing the threshold value of DP and VW algorithms using the genetic optimization algorithm, their relative error in selecting the best points for a given number, as an average for 14 trajectories collected, is 38.212% and 40.228% higher than the algorithms proposed by the research in the same processing time.
Keywords: geometric simplification, linear features, satellite receivers.
Full-Text [PDF 1436 kb]   (67 Downloads)    
Type of Study: Research | Subject: GIS
Received: 2024/07/26 | Accepted: 2024/11/13 | ePublished ahead of print: 2024/12/2 | Published: 2025/02/2
Send email to the article author



XML   Persian Abstract   Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Gholami A, Ghanbari A, Kaffash Charandabi N. A new approach in implementing geometric simplification algorithms of linear features with the aim of controlling the degree of simplification. jgit 2024; 12 (3) :85-104
URL: http://jgit.kntu.ac.ir/article-1-955-en.html


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 12, Issue 3 (12-2024) Back to browse issues page
نشریه علمی-پژوهشی مهندسی فناوری اطلاعات مکانی Engineering Journal of Geospatial Information Technology
Persian site map - English site map - Created in 0.06 seconds with 36 queries by YEKTAWEB 4700