• Title/Summary/Keyword: spline curve

Search Result 205, Processing Time 0.023 seconds

A Study on the Synthesis of Four-Bur Linkage Generating Automatic Path by Using B-Spline Interpolation (B-스플라인 보간법에 의한 자동 경로 생성이 가능한 4절링크의 합성에 관한 연구)

  • Kim, Jin-Su;Yang, Hyun-Ik
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.10
    • /
    • pp.126-131
    • /
    • 1999
  • Up until now, it is said that no satisfactory computer solutions have been found for synthesizing four-bar linkage based on the prescribed coupler link curve. In our study, an algorithm has been developed to improve the design synthesis of four-bar linkage automatically generating prescribed path by using B-spline interpolation. The suggested algorithm generates the desired coupler curve by using B-spline interpolation, and hence the generated curve approximates as closely as to the desired curve representing coupler link trajectory. Also, when comparing each generated polygon with the control polygon, rapid comparison by applying convex hull concept. finally, optimization process using ADS is incorporated into the algorithm based on the 5 precision point method to reduce the total optimization process time. As for examples, three different four-bar linkages were tested and the results showed the effectiveness of the algorithm.

  • PDF

Investigation on the Description Method of Extrusion Die Surface using B-Spline Surface Scheme (B-스플라인 곡면기법을 이용한 압출금형 곡면의 표현방법에 관한 연구)

  • 유동진;임종훈
    • Transactions of Materials Processing
    • /
    • v.12 no.2
    • /
    • pp.142-150
    • /
    • 2003
  • To construct the extrusion die surface, a B-Spline surface scheme based on the cubic B-Spline curve interpolation method is proposed in the present work. The inlet and outlet profiles are described with B-Spline curves by using the centripetal method for uniform parameterization. The interior control points of surface are generated using the derivative characteristics of B-Spline curve. A complete B-Spline surface is constructed by using appropriate coordinate transformation and knot deletion. In the present study, a quantitative measure for the control of surface is suggested by introducing the tangential vector and inclination angles at the inlet and outlet sections. To verify the validity of the proposed method, automatic surface generation is carried out for the various types of extrusion die surface.

A graph-based method for fitting planar B-spline curves with intersections

  • Bon, Pengbo;Luo, Gongning;Wang, Kuanquan
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.1
    • /
    • pp.14-23
    • /
    • 2016
  • The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.

GEOMETRIC CONIC SPLINE APPROXIMATION IN CAGD

  • Ahn, Young-Joon
    • Communications of the Korean Mathematical Society
    • /
    • v.17 no.2
    • /
    • pp.331-347
    • /
    • 2002
  • We characterize the best geometric conic approximation to regular plane curve and verify its uniqueness. Our characterization for the best geometric conic approximation can be applied to degree reduction, offset curve approximation or convolution curve approximation which are very frequently occurred in CAGD (Computer Aided Geometric Design). We also present the numerical results for these applications.

Knot Removal of B-spline Curves using Hausdorff Distance (하우스도르프 거리를 이용한 B-spline 곡선의 낫제거)

  • Oh, Jong-Seok;Yoon, Seung-Hyun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.17 no.3
    • /
    • pp.33-42
    • /
    • 2011
  • We present a new technique for removing interior knots of parametric B-spline curves. An initial curve is constructed by continuous $L_{\infty}$ approximation proposed by Eck and Hadenfeld. We employ Hausdorff distance to measure the shape difference between the original curve and the initial one. The final curve is obtained by minimizing their Hausdorff distance. We demonstrate the effectiveness of our technique with experimental results on various types of planar and spatial curves.

3-Dimensional Free Form Design Using an ASMOD (ASMOD를 이용한 3차원 자유 형상 설계)

  • 김현철;김수영;이창호
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.8 no.5
    • /
    • pp.45-50
    • /
    • 1998
  • This paper presents the process generating the 3-dimensional free f o r m hull form by using an ASMOD(Adaptive Spline Modeling of Observation Data) and a hybrid curve approximation. For example, we apply an ASMOD to the generation of a SAC(Sectiona1 Area Curve) in an initial hull form design. That is, we define SACS of real ships as B-spline curves by a hybrid curve approximation (which is the combination method of a B-spline fitting method and a genetic algorithm) and accumulate a database of control points. Then we let ASMOD learn from the correlation of principal dimensions with control points and make the ASMOD model for SAC generation. Identically, we apply an ASMOD to the generation of other hull form characteristic curves - design waterline curve, bottom tangent line, center profile line. Conclus~onally we can generate a design hull form from these hull form characteristic curves.

  • PDF

Approximate Lofting by B-spline Curve Fitting Based on Energy Minimization (에너지 최소화에 근거한 B-spline curve fitting을 이용한 근사적 lofting 방법)

  • 박형준;김광수
    • Korean Journal of Computational Design and Engineering
    • /
    • v.4 no.1
    • /
    • pp.32-42
    • /
    • 1999
  • Approximate lofting or skinning is one of practical surface modeling techniques well used in CAD and reverse engineering applications. Presented in this paper is a method for approximately lofting a given set of curves wihin a specified tolereance. It is based on refitting input curves simultaneously on a common knot vector and interpolating them to get a resultant NURBS surface. A concept of reducing the number of interior knots of the common knot vector is well adopted to acquire more compact representation for the resultant surface. Energy minimization is newly introduced in curve refitting process to stabilize the solution of the fitting problem and get more fair curve. The proposed approximate lofting provides more smooth surface models and realizes more efficient data reduction expecially when the parameterization and compatibility of input curves are not good enough. The method has been successfully implemented in a new CAD/CAM product VX Vision? of Varimetrix Corporation.

  • PDF

Multiple-Section Using 3D Spline based Cut-Scene Effect (3차 곡선을 이용한 다 구간 경로 기반의 컷씬 효과)

  • Sun, Bok-Gun;Shin, Young-Seo;Park, Sung-Jun
    • Journal of Korea Game Society
    • /
    • v.11 no.1
    • /
    • pp.93-100
    • /
    • 2011
  • Cinematic camera techniques are being increasingly applied to the game development these days. In this study, the object movement and camera effect for the game development using the curve in the 3D space were discussed. The Catmull-Rom spline algorithm follows the curve more closely than the other curve algorithms. With the algorithm proposed in this study, the Catmull-Rom spline was dynamically created according to the user's input in multiple sections in the 3D space, and objects smoothly passed along the route. In addition, Cut-Scene section is specified using the Catmull-Rom spline and the object movement can be observed. The results of the study on the accuracy and efficiency of the curve showed that the Catmull-Rom spline is very efficient not only for the object movement but also for the cinematic camera technique.

Multilevel Editing for Hierarchical B-spline Curves using Rotation Minimizing Frames (RMF을 이용한 계층적 B-spline 곡선의 다단계 편집기법)

  • Zhang, Ci;Yoon, Seung-Hyun;Lee, Ji-Eun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.16 no.4
    • /
    • pp.41-50
    • /
    • 2010
  • We present a new technique for multilevel editing of hierarchical B-spline curves. At each level, control points of a displacement function are expressed in the rotation minimizing frames (RMFs) [1] which are computed on nodal points of the curve at previous level. When the curve is edited at previous level, the corresponding RMFs are updated and the control points of the displacement function at current level are applied to the new RMFs, which maintains the relative details of the curve at current level to those of previous level. We demonstrate the effectiveness and robustness of the proposed technique using several experimental results.

A New Algorithm of Weaving Motion Using Bezier Spline

  • Chung, Won-Jee;Hong, Dae-Sun;Kim, Dae-Young;Seo, Young-Kyo;Hong, Hyung-Pyo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2743-2746
    • /
    • 2003
  • In this paper, we propose a new weaving trajectory algorithm for the arc welding of a articulated manipulator. The algorithm uses the theory of Bezier spline. We make a comparison between the conventional algorithms using Catmull-Rom curve and the new algorithms using Bezier spline. The proposed algorithm has been evaluated based on the MATLAB environment in order to illustrate its good performance. The algorithm has been implemented on to the industrial manipulator of DR6 so as to show its real possibility. Through simulations and real implementations, the proposed algorithm can result in high-speed and flexible weaving trajectory planning and can reduce the processing time because it needs one-half calculation compared to the conventional algorithm using Catmull-Rom curve.

  • PDF