• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.10
• /
• pp.119-124
• /
• 2000

One of the main problems in 3D shape measuring systems that use the triangulation of line-shaped laser light is precise center line detection of line-shaped laser stripe. The intensity of a line-shaped laser light stripe on the CCD image varies following to the reflection angles, colors and shapes of objects. In this paper, a new center line detection algorithm to compensate the local intensity variation on a line-shaped laser light stripe is proposed. The 3-D surface shape measuring system using the proposed center line detection algorithm can measure 3-D surface shape with enhanced measurement resolution by using the dynamic shape reconstruction with adaptive pattern clustering of the line-shaped laser light. This proposed 3-D shape measuring system can be easily applied to practical situations of measuring 3-D surface by virtue of high speed measurement and compact hardware compositions.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.10 no.3
• /
• pp.113-122
• /
• 2007

The rapid growth of aerial survey and remote sensing technology has enabled the rapid acquisition of very large amounts of geographic data, which should be analyzed using real-time visualization technology. The level of detail(LOD) algorithm is one of the most important elements for realizing real-time visualization. We chose the triangulated irregular network (TIN) method to generate normalized digital elevation model(DEM) data. First, we generated TIN data using contour lines obtained from a two-dimensional(2D) digital map and created a 2D grid array fitting the size of the area. Then, we generated normalized DEM data by calculating the intersection points between the TIN data and the points on the 2D grid array. We used constrained Delaunay triangulation(CDT) and ray-triangle intersection algorithms to calculate the intersection points between the TIN data and the points on the 2D grid array in each step. In addition, we simulated a three-dimensional(3D) terrain model based on normalized DEM data with real-time visualization using a Microsoft Visual C++ 6.0 program in the DirectX API library and a quad-tree LOD algorithm.

• Korean Journal of Materials Research
• /
• v.7 no.11
• /
• pp.1007-1011
• /
• 1997

영활화혁발전소 보일러헤다 재질인 1Cr0.5Mo강의 파형에 따른 저주기 피로특성을 규명하고자 상온(298K) 및 고온(177K)의 삼각파와 사인파형 저주기 피로시험을 수행하였고 소성에너지법을 이용하여 파형에 따른 소성변형에너지와 피로수명과의 +관계를 분석하였다. 저주기 피로시 재료내부의 소성변형에너지를 히스테리시스루프의 면적으로 계산하여 구하였으며 이를통해 저주기 피로수명을 예측하였고 Coffin-Manson법 및 변형률분할법을 이용한 저주기 피로수명 결과와 서로 잘 일치하였다. 또한 상온 및 고온에서 피로반복수의 증가와 함께 재료가 반봅연화됨을 알 수 있었다.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.6
• /
• pp.64-73
• /
• 1997

솔리드 모델러, 자동요소분할 기법, 4면체 특이요소, 응력확대계수의 해석 기능을 통합하여, 3차원 균열의 응력확대계수를 효율적으로 해석할 수 있는 시스템을 개발하였다. 균열을 포함하는 기하모델을 CAD 시스템을 이용하여 정의하고, 경계조건과 재료 물성치 및 절점밀도 분포를 기하모델에 직접 지정함으로써, 퍼지이론 에 의한 절점발생과 데로우니 삼각화법에 의한 요소가 자동으로 생성된다. 특히, 균열 근방에는 4면체 2차 특이요소를 생성시켰으며, 유한요소 해석을 위한 입력 데이터가 자동으로 작성되어 해석코드에 의한 응력 해석이 수행된다. 해석 후, 출력되는 변위를 이용하여 변위외삽법에 의한 응력확대계수가 자동적으로 계산되어 진다. 본 시스템의 효용성을 확인하기 위해, 인장력을 받는 평판내의 표면균열에 대해 해석하여 보았다.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.3
• /
• pp.147-156
• /
• 2008

A new approach based on cone prism intersection method combined with sorting algorithm is proposed for the fast and robust signed distance field computation. In the method, the space bounding the geometric model composed of triangular net is divided into multiple smaller cells. For the efficient calculation of distance fields, valid points among the triangular net which will generate minimum distances with current cell are selected by checking the intersection between current cell and cone prism generated at each point. The method is simple to implement and able to achieve an order of magnitude improvement in the computation time as compared to earlier approaches. Further the method is robust in handling the traditional sign problems. The validity of the suggested method was demonstrated by providing numerous examples including Boolean operation, shape deformation and morphing of complex geometric models.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.12
• /
• pp.847-853
• /
• 1988

A method of three-demensional finite element mesh generation is presented in this paper. This method is based on the Delaunay's triangulation whose dual is Voronoi's diagram. A set of points is given on the boundary surface of the concerning domain and the initial tetrahedra are generated by the given set of points. Then, the quality of every tetrahedron is investigated and the interior points are generated near the tetrahedra which are inferior in quality and the tetrahedra of good quality can be controlled by the density of the initial boundary points. Regions with different material constant can be refined in tetrahedra respectively. To confirm the effectiveness of this algorithm,the total volume of tetrahedra was compared to the true volume and this mesh generator was applied to a three-dimensional electostatic problem.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.7
• /
• pp.181-188
• /
• 2000

The objective of this research is to develop an efficient reverse engineering method of 3-dimensional compound surfaces for raped prototyping process. As a first step, several image processing techniques were applied to the measured data obtained using laser scanner. And the boundary information of the compound surface were extracted to divide the surface into several separate regions. As a next step, the Delaunay triangulation method were applied to reconstruct the surface based on the measured data and the boundary information. Finally, the STL file were created for the rapid prototyping process. Required simulations and experiments were performed and the results were analyzed to show the effectiveness of the proposed methods.

• Proceedings of the KIEE Conference
• /
• 2004.10a
• /
• pp.55-59
• /
• 2004

유한요소법을 이용하여 전자장을 해석할 경우 전류원이 전 영역에 비해 극히 작은 영역이면, 요소분할 과정에서 소스부분을 세분하여야 하므로 결국 미지수의 증가를 가져오게 된다. 또한, 선전류 문제의 경우 2차원 유한 요소 해석이 용이하지 않다. 이를 보안하기 위해 본 논문에서는 소스가 선전류이고 관심 영역이 선전류원으로부터 떨어져 있는 경우, 소스 영역은 해석해를 적용하여 유한요소법과 결합하는 방법을 제시하였다. 해석적인 해는 원통좌표계에서 반정에 대한 멱함수와 회전각도에 대한 삼각함수의 곱의 형태로 표현된다. 이때 두 종류의 적분 상수가 있는데, 이는 경계상의 포텐셜값과 유한요소법의 경계 적분항을 푸리에급수로 전개한 계수로 표현된다. 제안한 알고리즘의 검증을 위하여 해석해가 존재하는 모델을 설정하여 해석적인 방법, 기존의 유한요소 법 및 결합 방법에 의한 해를 비교 검증하였다.

• Journal of Broadcast Engineering
• /
• v.23 no.2
• /
• pp.227-234
• /
• 2018

Recently, stitching techniques are used for obtaining wide FOV, e.g., panorama contents, from normal cameras. Despite many proposed algorithms, the no objective quality evaluation method is developed, so the comparison of algorithms are performed only in subjective way. The paper proposes a 'Delaunay-triangulation based objective assessment method' for evaluating the geometric and photometric distortions of stitched or warped images. The reference and target images are segmented by Delaunay-triangulation based on matched points between two images, the average Euclidian distance is used for geometric distortion measure, and the average or histogram of PSNR for photometric measure. We shows preliminary results with several test images and stitching methods for demonstrate the benefits and application.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.807-810
• /
• 2009

In this paper, we consider the shortest path problems in a simple polygon. The shortest path between two points inside a polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in cases without very large input size. In this paper, we present the customized shortest path algorithms for specific polygon classes such as star-shaped polygons, edge-visible polygons, and monotone polygons. These algorithms need not triangulating as preprocessing, so they are simple and run very fast in linear time.