• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.159-169
• /
• 2005

An algorithmic approach to degree reduction of rational Bezier curves is presented. The algorithms are based on the degree reduction of polynomial Bezier curves. The method is introduced with the following steps: (a) convert the rational Bezier curve to polynomial Bezier curve by using homogenous coordinates, (b) reduce the degree of polynomial Bezier curve, (c) determine weights of degree reduced curve, (d) convert the Bezier curve obtained through step (b) to rational Bezier curve with weights in step (c).

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

The hodograph, which are usually defined as the derivative of parametric curve or surface, is useful far various geometric operations. It is known that the hodographs of Bezier curves and surfaces can be represented in the closed form. However, the counterparts of rational Bezier curves and surface have not been discussed yet. In this paper, the equations are derived, which are the closed form of rational Bezier curves and surfaces. The hodograph of rational Bezier curves of degree n can be represented in another rational Bezier curve of degree 2n. The hodograph of a rational Hazier surface of degree m×n with respect to a parameter can be also represented in rational Bezier surface of degree 2m×2n. The control points and corresponding weight of the hodographs are directly computed using the control points and weights of the given rational curves or surfaces.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.4
• /
• pp.312-317
• /
• 1999

An inflection point on a curve is a point where the curvature vanishes. An inflection point is useful for various geometric operations such as the approximation of curves and intersection points between curves or curve approximations. An inflection point on planar Bezier curves can be easily detected using a hodograph and a derivative of hodograph, since the closed from of hodograph is known. In the case of rational Bezier curves, for the detection of inflection point, it is needed to use the first and the second derivatives have higher degree and are more complex than those of non-rational Bezier curvet. This paper presents three methods to detect inflection points of rational Bezier curves. Since the algorithms avoid explicit derivations of the first and the second derivatives of rational Bezier curve to generate polynomial of relatively lower degree, they turn out to be rather efficient. Presented also in this paper is the theoretical analysis of the performances of the algorithms as well as the experimental result.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.151-165
• /
• 2002

An a1gorithmic approach to degree elevation of NURBS curves is presented. The new algorithms are based on the weighted blossoming process and its matrix representation. The elevation method is introduced that consists of the following steps: (1) decompose the NURBS curve into piecewise rational Bezier curves, (b) elevate the degree of each rational Bezier piece, and (c) compose the piecewise rational Bezier curves into NURBS curve.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.4
• /
• pp.350-354
• /
• 1999

The problem of the computation of derivatives arises in various applications of rational Bezier curves. These applications sometimes require the computation of derivative on numerous points. Therefore, many researches have dealt with the representation for the computation of derivatives with the small computation error. This paper compares the performances of the representations for the derivative of rational Bezier curves in the performances. The performance is measured as computation requirements at the pre-processing stage and at the computation stage based on the theoretical derivation of computational bound as well as the experimental verification. Based on this measurement, this paper discusses which representation is preferable in different situations.

• Proceedings of the IEEK Conference
• /
• 2002.06c
• /
• pp.17-20
• /
• 2002

This paper proposes a new 75 fuzzy model approximation method which reduces error in nonlinear fuzzy model approximation over the V-type decision rules. Employing rational Bezier curves used in computer graphics to represent curves or surfaces, the proposed method approximates the decision rule by constructing a tractable linear equation in the highly non-linear fuzzy rule interval. This algorithm is applied to the self-adjusting air cushion for spinal cord injury patients to automatically distribute the patient's weight evenly and balanced to prevent decubitus. The simulation results indicate that the performance of the proposed method is bettor than that of the conventional TS Fuzzy model in terms of error and stability.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.1
• /
• pp.31-39
• /
• 2001

Presented in this paper are algorithms to compute the positions of vertices and equations of edges of the Voronoi diagram of a circle set. The circles are located in a Euclidean plane, the radii of the circles are not necessarily equal and the circles are not necessarily disjoint. The algorithms correctly and efficiently work when the correct topology of the Voronoi diagram was given. Given three circle generators, the position of the Voronoi vertex is computed by treating the plane as a complex plane, the Z-plane, and transforming it into another complex plane, the W-plane, via the Mobius transformation. Then, the problem is formulated as a simple point location problem in regions defined by two lines and two circles in the W-plane. And the center of the inverse-transformed circle in Z-plane from the line in the W-plane becomes the position of the Voronoi vertex. After the correct topology is constructed with the geometry of the vertices, the equations of edge are computed in a rational quadratic Bezier curve farm.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.183-191
• /
• 1998

There are many available algorithms based on the different approaches to solve the intersection problems between two curves. Among them, the implicitization method is frequently used since it computes precise solutions fast and is robust in lower degrees. However, once the degrees of curves to be intersected are higher than cubics, its computation time increases rapidly and the numerical stability gets worse. From this observation, it is natural to transform the original problem into a set of easier ones. Therefore, curves are subdivided appropriately depending on their geometric behavior and approximated by a set of rational quadratic Bezier cures. Then, the implicitization method is applied to compute the intersections between approximated ones. Since the solutions of the implicitization method are intersections between approximated curves, a numerical process such as Newton-Raphson iteration should be employed to find true intersection points. As the seeds of numerical process are close to a true solution through the mix-and-match process, the experimental results illustrates that the proposed algorithm is superior to other algorithms.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.774-778
• /
• 1996

Developed in this research is a surface modeling kernel for various CAD/CAM applications. Its internal surface representations are rational parametric polynomials, which are generalizations of nonrational Bezier, Ferguson, Coons and NURBS surface, and are very fast in evaluation. The kernel is designed under the OOP concepts and coded in C++ on PCs. The present implementation of the kernel supports surface construction methods, such as point data interpolation, skinning, sweeping and blending. It also has NURBS conversion routines and offers the IGES and ZES format for geometric information exchange. It includes some geometric processing routines, such as surface/surface intersection, curve/surface intersection, curve projection and so forth. We are continuing to work with the kernel and eventually develop a B-Rep based solid modeler.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.7
• /
• pp.729-736
• /
• 2011

The technique for order preference by similarity to ideal solution (TOPSIS) is regarded as a classical method of multiple attribute decision making (MADM), often used to solve various decision-making or selection problems. It is based on the concept that the chosen alternative should have the shortest distance from the positive ideal solution and the farthest distance from the negative ideal solution. The TOPSIS can be applied to a design process for carrying out multi-objective shape optimization wherein the best and worst alternatives are to be decided. In this paper, multi-objective shape optimization using the TOPSIS and Rational Bezier curve was applied to the funnel of a cathode-ray tube (CRT). In order to minimize the weight and first principal stress, a new multi-objective shape optimization methodology is proposed, wherein the relative-closeness coefficients of the TOPSIS are defined as the performance indices of a multi-objective function and evaluated by response surface models. This methodology enables the designer to decide on the best solution from a number of design specification groups by examining the various conflicts between the weight and the first principal stress.