• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.4
• /
• pp.363-368
• /
• 2012

The result of the line simplification algorithm varies with the choice of algorithms, the change in tolerance and the selection of target objects. Three of the algorithms used in this study are Sleeve-fitting, Visvalingam-Whyatt, and Bend-simplify. They were applied to the three kinds of objects which were buildings, rivers, and roads with the five degrees of the tolerance. Through this experiments the vector displacement, the areal displacement, and the angular displacement were measured and the qualitative analysis was performed with the trend line of the errors. The experimental results show that errors were differ from tolerance values, and characteristics of line simplification algorithms based on changes of tolerance were understood.

• 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.

• 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 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.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2006.06a
• /
• pp.117-122
• /
• 2006

In the geophysical monitoring to understand the change of subsurface material properties with time, the time-invariant static subsurface model is commonly adopted to reconstruct a time-lapse image. This assumption of static model, however, can be invalid particularly when fluid migrates very quickly in highly permeable medium in the brine injection experiment. In such case, the resultant subsurface images may be severely distorted. In order to alleviate this problem, we develop a new least-squares inversion algorithm under the assumption that the subsurface model will change continuously in time. Instead of sampling a time-space model into numerous space models with a regular time interval, a few reference models in space domain at different times pre-selected are used to describe the subsurface structure continuously changing in time; the material property at a certain space coordinate are assumed to change linearly in time. Consequently, finding a space-time model can be simplified into obtaining several reference space models. In order to stabilize iterative inversion and to calculate meaningful subsurface images varying with time, the regularization along time axis is introduced assuming that the subsurface model will not change significantly during the data acquisition. The performance of the proposed algorithm is demonstrated by the numerical experiments using the synthetic data of crosshole dc resistivity tomography.