• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1991.10a
• /
• pp.96-96
• /
• 1991

• 한국전산유체공학회:학술대회논문집
• /
• 2007.04a
• /
• pp.108-111
• /
• 2007

A fast and robust method of grid generation to multiple functions has been developed for flow analysis in three dimensional space. It is based on the Non-Uniform Rational B-Spline of an approximation method. The grid generation method, details of numerical implementation. examples of application, and potential extensions of the current method are illustrated in this paper.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.12
• /
• pp.1532-1540
• /
• 1988

Shape from shading problem, such as other most early visions, is ill-posed problems, which can be solved by the use of regularization methods. This paper proposes the three kinds of stabilizer for the regularization. These are integrability constraints and spline functionals. Parallel iterative schemes are derived in the form of the finite difference approximation. Experimental results, show that the average error in surface orientation is less than 5%.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.36 no.3
• /
• pp.195-201
• /
• 2016

Eddy current testing (ECT) is commonly applied for the inspection of automated production lines of metallic products, because it has a high inspection speed and a reasonable price. When ECT is applied for the inspection of a metallic object having an uneven target surface, such as the spline gear of a spline shaft, it is difficult to distinguish between the original signal obtained from the sensor and the signal generated by a defect because of the relatively large surface signals having similar frequency distributions. To facilitate the detection of defect signals from the spline gear, implementation of high-order filters is essential, so that the fault signals can be distinguished from the surrounding noise signals, and simultaneously, the pass-band of the filter can be adjusted according to the status of each production line and the object to be inspected. We will examine the infinite impulse filters (IIR filters) available for implementing an advanced filter for ECT, and attempt to detect the flaw signals through optimization of system design parameters for detecting the signals at the system level.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.10
• /
• pp.168-177
• /
• 2001

Reverse engineering has been widely used for the shape reconstruction of an object without CAD data and the measurement of clay or wood models fur the development of new products. To generate a surface from measured points by a laser scanner, typical steps include the scanning of a clay or wood model, the generation of compatible input curves, the generation of a surface and manufacturing data like G code or STL file. A laser scanner has a great potential to get geometrical data of a model for its frost measuring speed and higher precision. The data from a laser scanner are composed of many line stripes of points including small spikes and noise. A new approach using automated surface generating algorithm is introduced to deal with problems during reverse engineering process. And the input data and the generated surface are represented in IGES format, thus can be supplied to other CAD/CAM software without any data manipulation.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.21-28
• /
• 2009

In the present work, an attempt has been made to construct branching surface from 2-D contours, which are given at different layers and may have branches. If a layer having more than one contour and corresponds to contour at adjacent layers, then it is termed as branching problem and approximated by adding additional points in between the layers. Firstly, the branching problem is converted to single contour case in which there is no branching at any layer and the final branching surface is obtained by skinning. Contours are constructed from the given input points at different layers by energy-based B-Spline approximation. 3-D curves are constructed after adding additional points into the contour points for all the layers having branching problem by using energy-based B-Spline formulation. Final 3-D surface is obtained by skinning 3-D curves and 2-D contours. There are three types of branching problems: (a) One-to-one, (b) One-to-many and (c) Many-to-many. Oneto-one problem has been done by plethora of researchers based on minimizations of twist and curvature and different tiling techniques. One-to-many problem is the one in which at least one plane must have more than one contour and have correspondence with the contour at adjacent layers. Many-to-many problem is stated as m contours at i-th layer and n contours at (i+1)th layer. This problem can be solved by combining one-to-many branching methodology. Branching problem is very important in CAD, medical imaging and geographical information system(GIS).

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.12 no.2
• /
• pp.79-85
• /
• 2003

An algorithm for fitting with Least Square is a traditional and an effective method in processing with experimental data. Due to the lack of definite representation, it is difficult to fit measured data with free curves or surfaces. B-Spline is usefully utilized to express free curves and surfaces with a few parameters. This paper presents the combination of these two techniques to process the point data measured from CMM and other similar instruments. This research shows tests and comparison of the simulation results from two techniques.

• International Journal of CAD/CAM
• /
• v.12 no.1
• /
• pp.9-19
• /
• 2012

Generation of optimum planar B-spline curve in terms of minimum deviation and required fairness to approximate a target shape defined by a strip-shaped unorganized 2D point cloud is studied. It is proposed to use the location of control points as variables within the geometric optimization framework of point distance minimization. An adaptive simulated annealing heuristic optimization algorithm is developed to iteratively update an initial approximate curve towards the target shape. The new implementation comprises an adaptive cooling procedure in which the temperature change is adaptively dependent on the objective function evolution. It is shown that the proposed method results in an improved convergence speed when compared to the standard simulated annealing method. A couple of examples are included to show the applicability of the proposed method in the surface model reconstruction directly from point cloud data.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.10a
• /
• pp.62-69
• /
• 2002

With the development of CUP speed and graphic technology, real-time simulation of deformable object is embossed as an essential issue in engineering field. Recently, it has been applied to the surgical training and game animation with haptic force feedback. But real time simulation of deformable objects is not easy because of the conflicting demands of speed and low latency and physical accuracy. In this study, we present the implementation of boundary element method(BEM) which is combined with the nonuniform B-spline surface. It is working together with the real-time simulation technique and the geometry data is altered by handling control points without preprocessing routine.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.53 no.8
• /
• pp.469-476
• /
• 2004

In this paper, a 3D shape optimization algorithm which guarantees a smooth optimal shape is presented using parameterized sensitivity analysis. The design surface is parameterized using Bezier spline and B-spline, and the control points of the spline are taken as the design variables. The parameterized sensitivity for the control points are found from that for nodal points. The design sensitivity and adjoint variable formulae are also derived for the 3D non-linear problems. Through an application to the shape optimization of 3D electromagnet to get a uniform magnetic field, the effectiveness of the proposed algorithm is shown.