• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.2
• /
• pp.117-128
• /
• 1999

A Simple tree-structured line simplification method, which exactly follows the Douglas-Peucker algorithm, has a strength for its simplification index to be involved into the hierarchical data structures. However, the hierarchy of simplification index, which is the core in a simple tree method, may not be always guaranteed. It is validated that the local property of line features in such global approaches as Douglas-Peucker algorithm is apt to be neglected and the construction of hierarchy with no thought of locality may entangle the hierarchy. This study designed a new approach, CALS(Convex hull Applied Line Simplification), a) to search critical points of line feature with convex hull search technique, b) to construct the hierarchical data structure based on these critical points, c) to simplify the line feature using multiple trees. CALS improved the spatial accuracy as compared with a simple tree method. Especially CALS was excellent in case of line features having the great extent of sinuosity.

• Journal of Korea Multimedia Society
• /
• v.18 no.3
• /
• pp.298-311
• /
• 2015

Vector data represents a map by its coordinate and Raster data represents a map by its pixel. Since these data types have very large data size, data compression procedure is a compulsory process. This paper compare the results from three different methodologies; GIS (Geographic Information System) vector map data compression using DP(Douglas-Peucker) Simplification algorithm, vector data compression based on Bin classification and the combination between two previous methods. The results shows that the combination between the two methods have the best performance among the three tested methods. The proposed method can achieve 4-9% compression ratio while the other methods show a lower performance.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.1
• /
• pp.39-51
• /
• 2004

This study aims to suggest new algorithm, named as Simoo, in order to improve spatial conflicts and vector displacement between linear features in generalization of the linear features. Main principles of Simoo algorithm is adoption of simplification and smoothening methods. Tolerance conditions used in Simoo are perpendicular length, external angle, and average vertex length. Main characteristics of Simoo are the application of scale, cartographic refinement, minimization of logical errors, and maintenance of geographical properties. The Simoo was applied through comparison to existing Douglas-Peucker algorithm. Resultantly, maintenance ratios of line such as coastal line and stream network were over 97% in both algorithms. The elimination ratio of vertex points may be more effective in Douglas-Peucker than in Simoo. Spatial conflicts between linear features may be more minimized in Simoo. The curvature and smoothening of lines become decreased in scale in application of Simoo. Finally, Simoo algorithm may be more effective than Douglas-Peucker for cartographic generalization.

• Journal of Korean Society for Geospatial Information Science
• /
• v.16 no.3
• /
• pp.35-41
• /
• 2008

Recently needs for the convergence of CAD and GIS data are increasing, and many studies on converting two systems to each other are being carried out. In this study, to revise and update the building data of digital map using CAD data for construction, the outline of building is abstracted from the CAD data and the outline is generalized to the same level of detail with the building data of digital map. Several line simplification algorithms to generalize the outline are adopted and compared, especially at the view of satisfaction to the drawing rule for digital map. Douglas-Peucker algorithm, Lang's algorithm, Reumann-Witkam algorithm, and Opheim algorithm are applied as the line simplification method. To evaluate the results of these algorithms, visual assessment and variation ratio of the number of points, total length of lines, the area of polygon, and satisfaction ratio to the drawing rule of digital map are analyzed. The result of Lang algorithm and Douglas-Peucker algorithm show superior satisfaction ratio. But general satisfaction ratio is 50~60% for all algorithm. Therefore there seems to be a limit to use these algorithms for the simplification method to update the building data in digital map and it is necessary to develop line simplification algorithm which satisfy the drawing rule well.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1562-1578
• /
• 2020

Vector data compression algorithm can meet requirements of different levels and scales by reducing the data amount of vector graphics, so as to reduce the transmission, processing time and storage overhead of data. In view of the fact that large threshold leading to comparatively large error in Douglas-Peucker vector data compression algorithm, which has difficulty in maintaining the uncertainty of shape features and threshold selection, a segmented Douglas-Peucker algorithm based on node importance is proposed. Firstly, the algorithm uses the vertical chord ratio as the main feature to detect and extract the critical points with large contribution to the shape of the curve, so as to ensure its basic shape. Then, combined with the radial distance constraint, it selects the maximum point as the critical point, and introduces the threshold related to the scale to merge and adjust the critical points, so as to realize local feature extraction between two critical points to meet the requirements in accuracy. Finally, through a large number of different vector data sets, the improved algorithm is analyzed and evaluated from qualitative and quantitative aspects. Experimental results indicate that the improved vector data compression algorithm is better than Douglas-Peucker algorithm in shape retention, compression error, results simplification and time efficiency.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.19 no.2
• /
• pp.199-208
• /
• 2001

The digital map in Korea has been producted and utilized independently according to scales such as 1:1,000, 1:5,000, and 1:25,000. Therefore, whenever we need to obtain the spatial data of other scales, we have to product the digital maps over and over again which it is time-consuming and ineconomic. To solve these problems, it has been accomplished many researches on map generalization to make digital maps in small scale from the master data of large scale. This paper aims to analyze the conversion characteristics of the large scale to the small scale by simplification of map generalization. For this purpose, it is proposed the algorithm for the simplification process of digital map and it is investigated the simplification characteristic of digital map through the experiment on the conversion of 1:5,000 scale into 1:25.000 scale. The results show that Area-Preservation algorithm indicates the good agreement with the original data in terms of the area and features of building layer compared to Douglas-Peucker algorithm and Reumann-Witkam algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.269-275
• /
• 2013

Recently, importance of pedestrian road network is getting emphasized as it is possible to provide mobile device users with both route guidance services and surrounding spatial information. However, it costs a tremendous amount of budget for generating and renovating pedestrian road network nationally, which hinder further advances of these services. Hence, algorithms extracting pedestrian road network automatically based on raster data are needed. On the other hand, road dataset generated from raster data usually has unnecessary vertices which lead to maintenance disutility such as excessive turns and increase in data memory. Therefore, this study proposed a method of selecting a proper threshold automatically for separate road entity using not only Douglas-Peucker algorithm but also road attribute data of digital map in order to remove redundant vertices, which maximizes line simplification efficiency and minimizes distortion of shape of roads simultaneously. As a result of the test, proposed method was suitable for automatic line simplification in terms of reduction ratio of vertices and accuracy of position.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.27 no.1
• /
• pp.657-666
• /
• 2009

In GIS area, many line simplification algorithms are studied among generalization methods used for making the building data in the form of digital map from the original line data. On the other hand, there are few studies on the simplification algorithm considering the drawing rules of the digital map in Korea. In this paper, the line simplification algorithm based on the drawing rules is proposed as the methodology to create or update the building data of digital map by extracting the building outline from the CAD data used in construction. To confirm the usefulness of the algorithm, this algorithm and four other effective and general line simplification algorithms (e.g., Douglas-Peucker algorithm) are applied to the same building outlines. Then, the five algorithms are compared on five criteria, the satisfaction degree of the drawing rules, shape similarity, the change rate of the number of points, total length of lines, and the area of polygon. As a result, the proposed algorithm shows the 100% of satisfaction degree to the drawing rules. Also, there is little loss in four other mentioned criteria. Thus, the proposed algorithm in this paper is judged to be effective in updating the building data in digital map with construction drawings.

• Ecology and Resilient Infrastructure
• /
• v.8 no.4
• /
• pp.266-272
• /
• 2021

Water friendly space refers to a place designated to plan and manage spaces for residents Water friendly activities. Efficient management of river Water friendly parks requires automated GIS data and DB construction of the water friendly facilities. Object-based classification using drone images or aerial images is attracting attention as an efficient means to acquire 3D spatial information in the country. To remove the miscellaneous image included in the extracted outline, a linear simplification of the outline is required, and it is difficult to apply manually, so various automation methods have been developed to overcome this, and among them, the most widely studied and utilized is the linear simplification method. In this study, the suitability of linear simplification algorithms such as Douglas-Peucker, Visvalingam-Whyatt, and Bend-simplify algorithms for the geometric shape of hydrophilic facilities was determined.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2008.10a
• /
• pp.264-265
• /
• 2008

본 연구에서는 건물공사에 사용되는 CAD 도면자료를 공간데이터로 변환하기 위한 과정의 일환으로 수치지도 작성내규에 근거한 선형단순화 기법을 제안하였다. 이 기법은 외곽선의 절점들이 수치지도 작성내규의 곡선데이터 점간거리 규정에 만족할 때까지 반복적으로 절점의 구간을 늘려나가는 방식이다. 제안된 기법의 단순화효과를 비교하기 위하여 Douglas-Peucker 알고리듬 등 가장 흔히 사용되는 4개의 선형 단순화기법을 동일한 건물 외곽선에 적용하여 수치지도작성 내규 만족도, 절점수, 선길이, 면적에 대해 비교, 분석하였다. 분석결과 제안된 알고리듬의 경우 수치지도 내규 만족도 면에서 100%에 가까운 만족도를 보였으며 절점수를 효율적으로 줄이면서, 선길이, 면적의 측면에서도 다른 알고리듬들에 비해 거의 손실이 발생하지 않아 추후 건설도면의 변환에 유용하게 사용될 가능성이 높을 것으로 판단된다.