• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.203-204
• /
• 2007

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.961-963
• /
• 2005

We answer a question raised by P. Brass on the number of maximally repeated sub-patterns in a set of n points in $\mathbb{R}^{d}$. We show that is number, which was conjectured to be polynomial, is in fact $\Theta(2^{\frac{n}{2}})$ in the worst case, regardless of the dimension d.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06a
• /
• pp.329-334
• /
• 2010

구들의 집합이 주어졌을 때, 주어진 구들이 모두 서로 겹치지 않은 경우 이들 모두와 교집합을 가지는 가장 작은 구(SIBB)를 계산하는 문제에 대해 연구한다. 먼저, 점집합에 대한 Welzl의 무작위 알고리즘을 구집합에 적용하였을 때, 계산된 결과가 조건을 만족하는 최소 크기의 구가 아닐 수 있다는 사실을 증명한다. 이와 함께, 선형 기대시간에 SIBB를 계산하는 새로운 무작위 알고리즘을 제시한다. 제시된 알고리즘은 구조가 간단하며 구현이 용이하여 실용적으로 사용될 수 있다.

• Journal of the Korea Computer Graphics Society
• /
• v.13 no.4
• /
• pp.21-27
• /
• 2007

The 3D Delaunay triangulation is the most widely used method for the mesh creation via the triangulation of a 3D point cloud. However, the method involves a heavy computational cost and, hence, in many interactive applications, it is not appropriate for surface triangulation. In this paper, we propose an efficient triangulation method to create a surface mesh from a 3D point cloud. We divide a set of object points into multiple subsets and apply the 2D Delaunay triangulation to each subset. A given 3D point cloud is cut into slices with respect to the OBB(Oriented Bounding Box) of the point set. The 2D Delaunay triangulation is applied to each subset producing a partial triangulation. The sum of the partial triangulations constitutes the global mesh. As a postprocessing process, we eliminate false edges introduced in the split steps of the triangulation and improve the results. The proposed method can be effectively applied to various image-based modeling applications.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.22 no.3
• /
• pp.569-578
• /
• 1998

The mode I and II stress intensity factors have been calculated theoretically for the cracked plate reinforced with a plate by symmetric spot welding under remote mixed mode loading. This is the extension of authors' previous work for the reinforced cracked plate under remote normal stress. Regardless of loading types, the reinforcement effect gets better as one joining spot is closer to the crack tip and the others are closer to the crack surface, and optimum number of the joining spots can be existed. For the present model, the remote loading parallel to crack surface produces the mode I stress intensity factor.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.4
• /
• pp.67-71
• /
• 1998

초음파 선형트랜스듀서에서 제한회절음장은 영상깊이에서 다른 방향으로 진행하는 평면파들의 선형적인 중첩으로부터 구한다. 제한회절음장을 구현하기 위한 송신음장은 영상 깊이를 지나가는 평면파들의 공간적인 확장으로부터 구해지는데 실제의 하드웨어로 구현하 기 어렵다. 본 논문은 진행방향이 다른 pulsed mode 평면파를 각각 송신한 후, 얻어진 데이 터로부터 합성집속 방법에 의하여 제한회절빔을 구현하였다. 제안한 방법은 모든 송신소자 에서 발사되는 음장의 크기가 동일하므로 송신전력이 증가하여 신호대잡음비와 명암비를 증 가시키며 간단한 하드웨어로 구현이 가능하다. 시뮬레이션 결과는 송신은 한점집속, 수신은 동적집속을 사용하는 기존의 방법과 비교하여 주엽(mainlobe)의 폭과 부엽(sidelobe)의 크기 관점에서 우수함을 증명하였다.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.5
• /
• pp.330-343
• /
• 2007

In this paper, we present a new surface content completion system that can effectively repair both shape and appearance from scanned, incomplete point set inputs. First, geometric holes can be robustly identified from noisy and defective data sets without the need for any normal or orientation information. The geometry and texture information of the holes can then be determined either automatically from the models' context, or manually from users' selection. After identifying the patch that most resembles each hole region, the geometry and texture information can be completed by warping the candidate region and gluing it onto the hole area. The displacement vector field for the exact alignment process is computed by solving a Poisson equation with boundary conditions. Out experiments show that the unified framework, founded upon the techniques of deformable models and PDE modeling, can provide a robust and elegant solution for content completion of defective, complex point surfaces.

• Korean Management Science Review
• /
• v.23 no.1
• /
• pp.75-85
• /
• 2006

The rectilinear Steiner tree problem (RSTP) is to find a minimum-length rectilinear interconnection of a set of terminals in the plane. It is well known that the solution to this problem will be the minimal spanning tree(MST) on some set Steiner points. The RSTP is known to be NP-complete. The RSTP has received a lot of attention in the literature and heuristic and optimal algorithms have been proposed. A key performance measure of the algorithm for the RSTP is the reduction rate that is achieved by the difference between the objective value of the RSTP and that of the MST without Steiner points. A hybrid evolutionary strategy on RSTP based upon nodes set is presented. The computational results show that the hybrid evolutionary strategy is better than the previously proposed other heuristic. The average reduction rate of solutions from the evolutionary strategy is about 11.14%, which is almost similar to that of optimal solutions.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.12 no.2
• /
• pp.7-13
• /
• 1992

In this study, we examine the characteristics of beam and the effect of these characteristics on the flaw detection by using different type of two transducers, which are PZT and PVDF film transducer. Consequently, the detection of infinitesimal flaw is more possible than PZT, since it has beam width at focus of $60%{\sim}65%$ in contrast with PZT's. Moreover we can know PVDF transducer has superiority in detecting ability for sub-surface flaw detection in view of its acoustic impedance is near to water's and its focusing range is narrower than PZT's as $65{\sim}85%$ because it has spherical surface.

• Journal of Broadcast Engineering
• /
• v.14 no.1
• /
• pp.81-84
• /
• 2009

This paper explores the possibility of describing objects from the change in the shape according to the change in viewpoint. Specifically, we sample the shapes from various viewpoints of a 3-D model, and apply dimension reduction by locally linear embedding. A low dimensional distribution of points are constructed, and characteristics of the object are described from this distribution. Also, we propose two 3-D retrieval methods by applying the iterative closest point algorithm, and by applying Fourier transform and measuring similarity by modified Housdorff distance, and present experimental results. The proposed method shows that the change of shape according to the change in viewpoint can describe the characteristics of an object.