• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.10 no.2
• /
• pp.63-71
• /
• 1992

The digital map database is often produced for multiple purposes, including mapping at multiple scales; it is increasingly rare that a base map is digitized for mapping at a single scale. The most important problems in process of line simplification in map generalization and multiple representation is that tolerance value selected for simplifying base map information must be modified as feature geometry varies within the digital file to ensure both accuracy and recognizability of graphic details on a generalized map. In this study, we explored various algorithms regarding to line simplication at many scales from a single digital file, and presents a rule by which to determine those scale at which line feature geometry might be expected to change in map representation. By applying two measured of displacement between a digitized line and its simplification, five algorithms have been evaluated. The results indicate that, of the five, the Douglas-Peucker routine produced less displacement between a line and its simplification. The research has proved to automating map simplification, incorporating numeric guidelines into digital environment about what magnitude and variation in geometric detail should be preserved as the digital data is simplified for representation at reduced map scales.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.935-942
• /
• 2000

In this paper we introduce a fast simplification algorithm for terrain height fields to produce a triangulated irregular network, based on the greedy insertion algorithm in [1,4,5]. Our algorithm partitions a terrain height data into rectangular blocks with the same size ad simplifies blocks one by one with the greedy insertion algorithm. Our algorithm references only to the points and the triangles withing each current block for adding a point into the triangulation. Therefore, the algorithm runs faster than the greedy insertion algorithm, which references all input points and triangles in the terrain. Our experiment shows that partitioning method runs from 4 to more than 20 times faster, and it approximates test height fields as accurately as the greedy insertion algorithms. Most greedy insertion algorithms suffer from elongated triangles that usually appear near the boundaries. However, we insert the four corner points into each block to produce the base triangulation of the block before the point addition step begins so that elongated triangles could not appear in th simplified terrain.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.288-296
• /
• 2004

This paper proposes a new mesh simplification algorithm using differential error metric. Many simplification algorithms make use of a distance error metric, but it is hard to measure an accurate geometric error for the high-curvature region even though it has a small distance error measured in distance error metric. This paper proposes a new differential error metric that results in unifying a distance metric and its first and second order differentials, which become tangent vector and curvature metric. Since discrete surfaces may be considered as piecewise linear approximation of unknown smooth surfaces, theses differentials can be estimated and we can construct new concept of differential error metric for discrete surfaces with them. For our simplification algorithm based on iterative edge collapses, this differential error metric can assign the new vertex position maintaining the geometry of an original appearance. In this paper, we clearly show that our simplified results have better quality and smaller geometry error than others.

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

• Journal of Korean Society of Water and Wastewater
• /
• v.12 no.1
• /
• pp.70-80
• /
• 1998

Many algorithms to find a minimum cost design of water distribution network (WDN) have been developed during the last decades. Most of them have tried to optimize cost only while satisfying other constraining conditions. For this, a certain degree of simplification is required in their calculation process which inevitably limits the real application of the algorithms, especially, to large networks. In this paper, an optimum design method using the Genetic Algorithms (GA) is developed which is designed to increase the applicability, especially for the real world large WDN. The increased to applicability is due to the inherent characteristics of GA consisting of selection, reproduction, crossover and mutation. Just for illustration, the GA method is applied to find an optimal solution of the New York City water supply tunnel. For the calculation, the parameter of population size and generation number is fixed to 100 and the probability of crossover is 0.7, the probability of mutation is 0.01. The yielded optimal design is found to be superior to the least cost design obtained from the Linear Program method by $4.276 million.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.12
• /
• pp.1514-1519
• /
• 1999

This paper presents two flexible alternatives to the decoupled load flow(DCL) method. The proposed load flow methods can improve the convergence profiles of the DCL by reflecting in part the effects of the off-diagonal terms in the Jacobian at minimal costs. They can improve the convergence characteristics especially when the power system operating states deviate from the conditions required for stable convergence of the DCL and the P-Q coupling becomes significant. Two algorithms are obtained from the expression of the full Newton-Raphson load flow (NRL) method by successively diminishing the effects of the off-diagonal submatrices in the Jacobian. In the process of simplification, the Neuman series expansion is utilized. Test results show promising performances of the proposed algorithms in their convergence characteristics both in number of iterations and overall convergence speeds. Proposed algorithms are expected to provide flexible alternatives to the NRL when the DCL experiences convergence problems.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.5-6
• /
• 2010

Needs for the methodology of segmentation of linear feature according to the shape characteristics of line feature are increasing in cartographic linear generalization. In this study, the line segmentation method using expansible moving window is presented. This method analyzes the generalization effect of line simplification algorithms depend on the line characters of linear feature and extracts the sections which show exclusively low positional error due to a specific algorithm. The description measurements of these segments are calculated and the target line data are segmented based on the measurements. For segmenting the linear feature to a homogeneous section, expansible moving window is applied. This segmentation method is expected to be used in the cartographic map generalization considering the shape characteristics of linear feature.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.297-304
• /
• 2004

In this paper, a mesh simplification algorithm based on wavelet transform and 2D planar sampling is proposed for efficient handling of 3D objects in computer applications. Since 3D vertices are directly transformed with wavelets in conventional mesh compression and simplification algorithms, it is difficult to solve tiling optimization problems which reconnect vertices into faces in the synthesis stage highly demanding vertex connectivities. However, a 3D mesh is sampled onto 2D planes and 2D polygons on the planes are independently simplified in the proposed algorithm. Accordingly, the transform of 2D polygons is very tractable and their connection information Is replaced with a sequence of vertices. The vertex sequence of the 2D polygons on each plane is analyzed with wavelets and the transformed data are simplified by removing small wavelet coefficients which are not dominant in the subjective quality of its shape. Therefore, the proposed algorithm is able to change the mesh level-of-detail simply by controlling the distance of 2D sampling planes and the selective removal of wavelet coefficients. Experimental results show that the proposed algorithm is a simple and efficient simplification technique with less external distortion.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.59-62
• /
• 2001

This paper discusses a data mining technique for time series analysis of traffic data, which provides useful knowledge for network configuration management. Commonly, a network designer must employ a combination of heuristic algorithms and analysis in an interactive manner until satisfactory solutions are obtained. The problem of heuristic algorithms is that it is difficult to deal with large networks and simplification or assumptions have to be made to make them solvable. Various data mining techniques are studied to gain valuable knowledge in large and complex telecommunication networks. In this paper, we propose a traffic pattern association technique among network nodes, which produces association rules of traffic fluctuation patterns among network nodes. Discovered rules can be utilized for improving network topologies and dynamic routing performance.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.19-21
• /
• 2010

In this study, regarding to the generalization of the map, we analyze how the different tolerances influence on the performances of linear generalization operators. For the analysis, we apply the generalization operators, especially two simplification algorithms provided in the commercial GIS software, to 1:1000 digital topographic map for analyzing the aspect of the changes in positional error depending on the tolerances. And we evaluate the changes in positional error with the quantitative assessments. The results show that the analysis can be used as the criteria for determining proper tolerance in linear generalization.