• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1996.06a
• /
• pp.703-706
• /
• 1996

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1996.06a
• /
• pp.712-715
• /
• 1996

• Journal of computational fluids engineering
• /
• v.9 no.4
• /
• pp.7-12
• /
• 2004

In the present study a semi-automatic mesh generation program has been developed by using DXF file containing contour line data. The program consists of DXF file reader and mapping algorithm. Pre-generated 2-D planar mesh points are to be mapped one by one onto triangular surface whose three vertices are three nearest contour points surrounding the mapping point. The present program has been successfully tested for mesh generations for the road tunnel ventilation analysis and analysis of lava movement in mountain area.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.5
• /
• pp.180-185
• /
• 2000

An interface V-notched crack problem can be formulated as a eigenvalue problem. there are the eigenvalues which give stress singularities at the V-notched crack tip. The RWCIM is a method of calculating the eigenvector coefficients associated with eigenvalues for a V-notched crack problem. Obtaining the stress intensity factors for an interface crack in dissimilar materials is examined by the RWCIM. The results of stress intensity factors for an interface crack are compared with those of the displacement extrapolation method by the BEM

• Proceedings of the KSME Conference
• /
• 2000.04a
• /
• pp.115-120
• /
• 2000

This paper examines that it is possible to apply RWCIM for determining eigenvector coefficients associated with eigenvalues for V-notched cracks in anisotropic dissimilar materials using the complex stress function. To verify the RWCIM algorithm, two tests will be shown. First it is performed to ascertain whether predicted coefficients associated with eigenvectors is obtained exactly. Second, it makes an examination of the state of stress for FEM and RWCIM according to a number of eigenvectors at a location far away from the V-notched crack tip.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.647-649
• /
• 1998

본 논문에서는 다각 근사화 방법과 래스터 기반 연산 알고리즘을 이용하여 평면 지도상에 나타난 등고선을 3차원 가시화(Visualization)하여 보여준다. 다각 근사화 방법은 입력한 등고선에 대한 특징을 반영할 수 있는 최소한의 선형구분 오차 임계값을 이용하여 등고선에 근사화 시킨 것으로 저장 데이터의 양을 축소할 수 있다. 래스터 기반 알고리즘은 이웃한 두 개의 등고선 내부점의 높이 값을 그 점에서 두 등고선까지의 최단거리 및 등고선의 높이값을 변수로 하는 선형보간식으로 정의하고, 거리변환 연산을 도입하여 계산하는 알고리즘으로 구현이 용이하며, 간단한 계산만을 수행하기 때문에 처리 방법이 간단하다는 장점을 갖는다. 본 논문에서는 래스터 방법만을 이용한 복원보다 자료의 양이 감소함을 보였고, 전체 처리과정의 간단함과, 3차원 가시화된 등고선을 그래프 좌표상의 X, Y, Z축으로 원하는 각도만큼씩 회전시키며 관찰 할 수 있도록 하였다. 본 연구를 통해 지형의 특징을 원형 등고선과 유사하게 유지하면서, 데이터 양을 축소하고 계산식을 간략화된 효과적인 지형정보 시각화를 보여주었다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.558-568
• /
• 2000

In the paper, we propose the automatic generation method of digital elevation map based on contour map. The proposed method classifies contour data and non-contour data by thinning and labelling process of the contour line and then connects smoothly broken contour line by Bezier curve. Finally, the digital devation map is generated by the interpolation using the height data of the contour line. The proposed method can reduce vest effort, time and expense which is spend to make digital elevation map.

• Korean Journal of Remote Sensing
• /
• v.14 no.2
• /
• pp.129-136
• /
• 1998

This paper deals with a problem encountered in the course of constructing digital elevation model from a contour map. Deficiencies of widely used linear interpolation method is described, and an interpolation method for internal points of a single closed contour is proposed. Control points not on a plane are searched and interpolated. The method is applied to an artificial contour lines and real contour lines. The result shows natural and accurate reconstruction.

• Journal of Digital Convergence
• /
• v.10 no.6
• /
• pp.289-296
• /
• 2012

Due to the topographical and climatic features of Korea, there is a strong possibility of a landslide. Recently, many landslides, caused by the improper land development, frequently occured at the mountain area every summer. Cheonan has been recognized to be relatively safe against landslide, but with the increased risk factors, systematic analysis of the landslide is required. In this paper, the topographical features of Mt. Seonggo in Cheonan City were extracted using contour maps, and water courses and basin areas in heavy rain were computed using the results. Conclusively, Mt. Seonggo areas were relatively safe in the view points of the length of water courses and rain-inflow, but in case of some narrow areas, sustainedly observation was required. Meanwhile, a contour map is proper to analyze the risk of landslide in the 1'st level in that it is more cost effective than other types of digital map.

• The KIPS Transactions:PartB
• /
• v.14B no.6
• /
• pp.413-422
• /
• 2007

This paper addresses a new technique for constructing surface model from a set of wire-frame contours. The most difficult problem of this technique, called contour triangulation, arises when there are many branches on the surface, and causes lots of ambiguities in surface definition process. In this paper, the branching problem is reduced as the surface reconstruction from a set of virtual belts and virtual canyons. To tile the virtual belts, a divide-and-conquer strategy based tiling technique, called the BPA algorithm, is adopted. The virtual canyons are covered naturally by an iterative convex removal algorithm with addition of a center vertex for each branching surface. Compared with most of the previous works reducing the multiple branching problem into a set of tiling problems between contours, our method can handle the problem more easily by transforming it into more simple topology, the virtual belt and the virtual canyon. Furthermore, the proposed method does not involve any set of complicated criteria, and provides a simple and robust algorithm for surface triangulation. The result shows that our method works well even though there are many complicated branches in the object.