Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Korean Journal of Computational Design and Engineering
Journal Basic Information
Journal DOI :
Society of CAD/CAM Engineers
Editor in Chief :
Volume & Issues
Volume 3, Issue 4 - Dec 1998
Volume 3, Issue 3 - Sep 1998
Volume 3, Issue 2 - Jun 1998
Volume 3, Issue 1 - Mar 1998
Selecting the target year
Surface Design Using B-spline Skinning of Cross-Sectional Curves under Volume Constraint
Korean Journal of Computational Design and Engineering, volume 3, issue 2, 1998, Pages 87~102
Given a sequence of cross-sectional curves, the skinning method generates a freeform surface that interpolates the given curves in that sequence. This thesis presents a construction method of a B-spline skinning surface that is fair and satisfies volume constraints. The fairness metric is based on the parametric energy functional of a surface. The degrees of freedom in surface control are closely related lo control points in the skinning direction. The algorithm fur finding a skinning surface consists of two step. In the first step, an initial fair surface is generated without volume constraints and one coordinate of each control point is fixed. In the second step, a final surface that meets all constraints is constucted by rearranging the other coordinates of each control point that defines the initial surface A variational Lagrange optimization method produces a system of nonlinear equations, which can be solved numerically. Moreover, the reparametrization of given sectional curves is important for the construction of a reasonable skinning surface. This thesis also presents an intuitive metric for reparametrization and gives some examples that are optimized with respect to that metric.
Local Modification of a Surface and Multiple Knot Insertion by Using the Chebyshev Polynormial
Korean Journal of Computational Design and Engineering, volume 3, issue 2, 1998, Pages 103~112
In this paper insertion of numerous control points to be performed by using the Chebyshev polynomial root at the selection of knot vector. This method introduces a simple method of knot refinement and it is applied in a developed program. The Chebyshev roots exist densely in broth ends of the range and are proposed more effective knot refinement to modify a surface. Therefore, generated control points are relatively uniform in specified knot interval. In the surface generation, a local insertion of numerous control points are easily inserted by using the characteristic of Chebyshev polynomial roots at knot refinement. It is possible to create a complex surface with a single surface. The number of control point can be reduced by using the local insertion of control points in a required shape
Calculation of NURBS Curve Intersections using Bzier Clipping
Korean Journal of Computational Design and Engineering, volume 3, issue 2, 1998, Pages 113~120
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
Methods on Determination of Step Sizes and Detection of Tangential Points for SSI
Korean Journal of Computational Design and Engineering, volume 3, issue 2, 1998, Pages 121~126
It is one of important issues to find intersection curve? in representation of complex surfaces on a computer. Three typical methods, i.e. the tracing method, the subdivision method, and hybrid method, are often applied to find intersection curves between sculptured surfaces. In this paper two topics are dealt with for efficiency and robustness of the hybrid method. One tropic is about how to determine step sizes variably during tracing, the ethel is about how to find tangential points between surfaces. Tracing by variable step size finds intersections rapidly and requires less memory size. Some illustrations show tangential points between surfaces.
Computing Planar Curve Offset Based on Surface/Surface Intersection
Korean Journal of Computational Design and Engineering, volume 3, issue 2, 1998, Pages 127~134
This paper presents d new algorithm to compute the offlet curve of a given planar parametric curve. We reduce the problem of computing an offset curve to that of intersecting a surface to a paraboloid. Given an input curve C(t)=(x(t), y(t))∈R², the corresponding surface D/sub c(t)/ is constructed symbolically as the envelope surface of a one-parameter family of tangent planes of the paraboloid Q:z=x²+y²along a lifted curve C(t)=(x(t), y(t), x(t)²+y(t)²∈Q. Given an offset distance d∈R, the offset curve C/sub d/(t) is obtained by the projection of the intersection curve of D/sub c(t)/ and a paraboloid Q:z=x²+y²-d² into the xy-plane.
The Closed Form of Hodograph of Rational Bezier curves and Surfaces
Korean Journal of Computational Design and Engineering, volume 3, issue 2, 1998, Pages 135~139
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.
A New Metric for A Class of 2-D Parametric Curves
Wee, Nam-Sook ; Park, Joon-Young ;
Korean Journal of Computational Design and Engineering, volume 3, issue 2, 1998, Pages 140~144
We propose the area between a pair of non-self-intersecting 2-D parametric curves with same endpoints as an alternative distance metric between the curves. This metric is used when d curve is approximated with another in a simpler form to evaluate how good the approximation is. The traditional set-theoretic Hausdorff distance can he defined for any pair of curves but requires expensive calculations. Our proposed metric is not only intuitively appealing but also very easy to numerically compute. We present the numerical schemes and test it on some examples to show that our proposed metric converges in a few steps within a high accuracy.