• Journal of the Korea Computer Graphics Society
• /
• v.12 no.4
• /
• pp.1-5
• /
• 2006

This paper introduces the surface detailed painterly rendering using heightfield map. To do this, we implement painterly rendering using normal mapping and displacement mapping method by heightfield map. The suggested method can apply to the 3D visualization program and game engine for representing the surface detailed realtime rendering using GPU Programming.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.187-191
• /
• 2008

In the mobile environments for the vector map services, a map simplification work through the map generalization steps helps improve the readability of the map on a large scale. The generalization operations are various such as selection, aggregation, simplification, displacement, and so on, the formal operation algorithms have not been built yet. Because the algorithms require deep special knowledge and heuristic, which make it hard to automate the processes. This thesis proposes some map generalization algorithms specialized in mobile vector map services, based on previous works. This thesis will show the detail to adapt the approaches on the mobile environment, to display complex spatial objects efficiently on the mobile devices which have restriction on the resources.

• Journal of the Korea Computer Graphics Society
• /
• v.14 no.3
• /
• pp.11-17
• /
• 2008

Many methods which represent complex surfaces using height map without a number of vertex have been researched. However, a single layer height map cannot present more complex objects because it has only one height value on each position. In this paper, we introduce the new approach to render more complex objects, which are not generated by single layer height map, using multi layer height map. We store height values of the scene to each texture channel by the ascending order. A pair of ordered height values composes a geometry block and we use this property. For accurate ray search, we store the highest value in odd channels and the lowest value in even channels to generate quad tree height map. Our ray search algorithm shows accurate intersections between viewing ray and height values using quad tree height map. We solve aliasing problems on grazing angles occurred in previous methods and render the result scene on real-time.

• Smart Structures and Systems
• /
• v.29 no.4
• /
• pp.599-616
• /
• 2022

Bridge displacement contains vital information for bridge condition and performance. Due to the limits of direct displacement measurement methods, the indirect displacement reconstruction methods based on the strain or acceleration data are also developed in engineering applications. There are still some deficiencies of the displacement reconstruction methods based on strain or acceleration in practice. This paper proposed a novel method based on long short-term memory (LSTM) networks to reconstruct the bridge dynamic displacements with the strain and acceleration data source. The LSTM networks with three hidden layers are utilized to map the relationships between the measured responses and the bridge displacement. To achieve the data fusion, the input strain and acceleration data need to be preprocessed by normalization and then the corresponding dynamic displacement responses can be reconstructed by the LSTM networks. In the numerical simulation, the errors of the displacement reconstruction are below 9% for different load cases, and the proposed method is robust when the input strain and acceleration data contains additive noise. The hyper-parameter effect is analyzed and the displacement reconstruction accuracies of different machine learning methods are compared. For experimental verification, the errors are below 6% for the simply supported beam and continuous beam cases. Both the numerical and experimental results indicate that the proposed data fusion method can accurately reconstruct the displacement.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.2
• /
• pp.1-9
• /
• 2011

In recent researches, several LOD techniques are used for real-time visualization of large sized terrain data. However, during mesh simplification, geometry popping may occur in consecutive frames, because of the geometric error. We propose an efficient method for reducing the geometry popping using roughness map and bias map. A roughness map and a bias map are used to move vertices of the terrain mesh to appropriate position where they minimize the geometry errors. A roughness map and a bias map are represented as a texture suitable for GPU processing. Moving vertices using bias map is processed on the GPU, so the high-speed visualization can be possible.

• Journal of Navigation and Port Research
• /
• v.35 no.1
• /
• pp.51-56
• /
• 2011

In this paper, we presents an algorithm which restores lost data or increases resolution of a DTM(Digital terrain model) using fractal theory. Terrain information(fractal dimension and standard deviation) around the patch to be restored is extracted and then with this information and original data, the elevations of cells are interpolated using the random midpoint displacement method. The results of the proposed algorithm are compared with those of the bilinear and bicubic methods on a fractal terrain map.

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

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

Spatial conflict problem can be solved by computing the space in which a new input object can be located avoiding conflict, and displacing it in the computed space. In this study, we propose a optimal method to displace an input object to given space.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.14 no.3
• /
• pp.8-15
• /
• 2005

A new measuring method for tool deflection has been developed when sculptured surface is processed in ball-end milling. Since the vibration due to cutting forces has low frequencies, an electromagnetic sensor is used for measuring the exact vibration displacement. The amplitude and direction of vibration displacement during the cutting process is presented as orbital plot. In this study, it assumes that the vibration displacement is proportional to the length of cutting chip. Therefore, tool deflection is calculated by summing up the vibration displacement of unit chip length for engaged chip length. In addition, computer programs has been developed to predict the deflection of tools when machining sculptured surface. This developed program predicts the tool deflection per block of NC data, so that it can easily identify the parts which have the possibility of machining errors.

• Smart Structures and Systems
• /
• v.15 no.3
• /
• pp.645-663
• /
• 2015

Recently, an indirect displacement estimation method using data fusion of acceleration and strain (i.e., acceleration-strain-based method) has been developed. Though the method showed good performance on beam-like structures, it has inherent limitation in applying to more general types of bridges that may have complex shapes, because it uses assumed analytical (sinusoidal) mode shapes to map the measured strain into displacement. This paper proposes an improved displacement estimation method that can be applied to more general types of bridges by building the mapping using the finite element model of the structure rather than using the assumed sinusoidal mode shapes. The performance of the proposed method is evaluated by numerical simulations on a deck arch bridge model and a three-span truss bridge model whose mode shapes are difficult to express as analytical functions. The displacements are estimated by acceleration-based method, strain-based method, acceleration-strain-based method, and the improved method. Then the results are compared with the exact displacement. An experimental validation is also carried out on a prestressed concrete girder bridge. The proposed method is found to provide the best estimate for dynamic displacements in the comparison, showing good agreement with the measurements as well.