• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.276-284
• /
• 2000

Usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in a power form is done by either a knot refinement followed by basis conversions or applying a Taylor expansion on the B-spline curve for each knot span. Presented in this paper is a new algorithm, called a direct expansion algorithm, for the problem. The algorithm first locates the coefficients of all the linear terms that make up the basis functions in a knot span, and then the algorithm directly obtains the power form representation of basis functions by expanding the summation of products of appropriate linear terms. Then, a polynomial segment of a knot span can be easily obtained by the summation of products of the basis functions within the knot span with corresponding control points. Repeating this operation for each knot span, all of the polynomials of the B-spline curve can be transformed into a power form. The algorithm has been applied to both static and dynamic curves. It turns out that the proposed algorithm outperforms the existing algorithms for the conversion for both types of curves. Especially, the proposed algorithm shows significantly fast performance for the dynamic curves.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.474-479
• /
• 2003

This paper addresses the problem of B-spline surface interpolation to serial contours, where the number of points varies from contour to contour. A traditional lofting approach creates a set of B-spline curves via B-spline curve interpolation to each contour, makes them compatible via degree elevation and knot insertion, and performs B-spline surface lofting to get a B-spline surface interpolating them. The approach tends to result in an astonishing number of control points in the resulting B-spline surface. This situation arises mainly from the inevitable process of progressively merging different knot vectors to make the B-spline curves compatible. This paper presents a new approach for avoiding this troublesome situation. The approach includes a novel process of getting a set of compatible B-spline curves from the given contours. The process is based on the universal parameterization [1,2] allowing the knots to be selected freely but leading to a more stable linear system for B-spline curve interpolation. Since the number of control points in each compatible B-spline curve is equal to the highest number of contour points, the proposed approach can realize efficient data reduction and provide a compact representation of a B-spline surface while keeping the desired surface shape. Some experimental results demonstrate its usefulness and quality.

• Journal of Korea Multimedia Society
• /
• v.13 no.9
• /
• pp.1373-1381
• /
• 2010

Current flight maneuver diagram used by pilots is based on 2D spatial presentation, so it has limitation on display 3D flight information and hard to understand it instinctively. Flight animation authoring tools for this diagram are complex to use and lack useful features like non-linear editing of flight path and real-time interactivity on multiple aircrafts. This research focuses on 3D flight path generation method in the animation system for flight maneuver education. This research combines initial sketch input on 2D diagram with the thrust of an aircraft to generate 3D linear spline as close as to real flight. Using suggested linear spline creation method, the flight path can be visualized, edited, and animated in real-time at the flight maneuver briefing and debriefing.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.12
• /
• pp.99-105
• /
• 1996

Increasing demands on precision machining of free-form surfaces have necessitated the tool to move not only with position error as small as possible, but also with smoothly varying feedrates. In this paper, linear, circular and spline interpolators were developed in reference-pulse type using PC. M-SAM and M-DAM were designed by the comparison and analysis of previous interpolation methods. Spline interpolator was designed to follow the free-form curves. To apply to the real cutting process, constant feedrate compensation and acceleration-deceleration compensation were conceived. Finally, its performance was tested using retrofitted milling machine. As a result, new interpolation algorithm is favorable in precision machining of free-form curves.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.113-120
• /
• 1998

Calculation of intersection points by two curves is fundamental to computer aided geometric design. Bezier clipping is one of the well-known curve intersection algorithms. However, this algorithm is only applicable to Bezier curve representation. Therefore, the NURBS curves that can represent free from curves and conics must be decomposed into constituent Bezier curves to find the intersections using Bezier clipping. And the respective pairs of decomposed Bezier curves are considered to find the intersection points so that the computational overhead increases very sharply. In this study, extended Bezier clipping which uses the linear precision of B-spline curve and Grevill's abscissa can find the intersection points of two NURBS curves without initial decomposition. Especially the extended algorithm is more efficient than Bezier clipping when the number of intersection points is small and the curves are composed of many Bezier curve segments.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.203-216
• /
• 1999

In this paper a rational cubic interpolant spline with linear denominator has been constructed and it is used to constrain interpolation curves to be bounded in the given region. Necessary and sufficient conditions for the interpolant to satisfy the constraint have been developed. The existence conditions are computationally efficient and easy to apply. Finally the approximation properties have been studied.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.27-29
• /
• 2006

In this paper, we propose a new method of automatic white balance which is one of the image signal processing techniques. Our method is conceptually based on gray world assumption. However, while previous methods generate linear results as multiplying pixel values by a gain, our method generates non-linear results using the feature of B-Spline curves. The two merits of deriving non-linear results are preventing AWB failure from transforming strong color of high level into wrong color and well preserving original contrast of an input image.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.517-525
• /
• 2000

A constrained rational cubic spline with linear denominator was constructed in [1]. In the present paper, the sufficient condition for convex interpolation and some properties in error estimation are given.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.2
• /
• pp.135-144
• /
• 2009

In this present work, spline FEA for the trimmed NURBS surface of the 2D linear elasticity problem is presented. The main benefit of the proposed method is that no additional efforts for modeling of trimmed NURBS surfaces are needed and the information of the trimming curves and trimmed surfaces exported from the CAD system can be directly used for analysis. For this, trimmed elements are searched by using NURBS projection scheme. The integration of the trimmed elements is performed by using the NURBS-enhanced integration scheme. The formulation of constructing stiffness matrix of trimmed elements is presented. In this formulation, the information of the trimming curve is used for calculating the Jacobian as well as for obtaining integration points. The robustness and effectiveness of the proposed method are investigated through various numerical examples.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1334-1339
• /
• 2003

An efficient method is developed for the shape optimization of 2-D structures. The sequential linear programming is used for minimization problems. Selected set of master nodes are employed as design variables and assigned to move towards the normal direction. After adapting the nodes on the design boundary, the B-spline curves and mesh smoothing schemes are used to maintain the finite element in good quality. Finally, a numerical implementation of optimum design of an automobile torque converter piston subjected to pressure and centrifugal loads is presented. The results shows additional weight up to 13% may be saved after the shape optimization.