• Title/Summary/Keyword: B-스플라인

Search Result 138, Processing Time 0.049 seconds

An Error-Bounded B-spline Fitting Technique to Approximate Unorganized Data (무작위 데이터 근사화를 위한 유계오차 B-스플라인 근사법)

  • Park, Sang-Kun
    • Korean Journal of Computational Design and Engineering
    • /
    • v.17 no.4
    • /
    • pp.282-293
    • /
    • 2012
  • This paper presents an error-bounded B-spline fitting technique to approximate unorganized data within a prescribed error tolerance. The proposed approach includes two main steps: leastsquares minimization and error-bounded approximation. A B-spline hypervolume is first described as a data representation model, which includes its mathematical definition and the data structure for implementation. Then we present the least-squares minimization technique for the generation of an approximate B-spline model from the given data set, which provides a unique solution to the problem: overdetermined, underdetermined, or ill-conditioned problem. We also explain an algorithm for the error-bounded approximation which recursively refines the initial base model obtained from the least-squares minimization until the Euclidean distance between the model and the given data is within the given error tolerance. The proposed approach is demonstrated with some examples to show its usefulness and a good possibility for various applications.

Implementation of a 3D Mesh Editor for Smooth Surface Fitting (부드러운 곡면 근사를 위한 3차원 메쉬 편집기의 구현)

  • 신복숙;우영운
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2001.06a
    • /
    • pp.425-428
    • /
    • 2001
  • 본 논문에서 구현한 메쉬 편집기는 편집할 메쉬의 몇몇 점을 편집할 경우, 편집 정보가 그 점에 이웃한 점들에게도 영향을 미치게 되어, 편집 결과가 근사된 부드러운 곡면으로 표현하도록 하는 데 있다. 그러기 위해서는 3차원의 메쉬를 2차원 평면으로 매핑할 때, 매핑되는 원래의 메쉬의 모양이 크게 변형되지 않도록 하여야 하는데, 여기에 모양 유지 매개 변수화 방법을 사용하고 있다. 편집에 사용된 점의 편집 정보는 2차원 평면 다각형 안에 있는 서로 대응되는 점으로 매핑 되고, B-스플라인 보간으로 편집 정보는 2차 평면 안에 있는 다른 점들에게도 영향을 주게 된다. 이런 결과는 3차원 메쉬로 환원되어 부드럽게 근사된 곡면으로 표현된다.

  • PDF

Implementation of NURBS interpolator (NURBS 보간의 적용)

  • 최인휴;양민양;이강주;김찬봉
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.10a
    • /
    • pp.51-54
    • /
    • 2002
  • This paper deals with an implementation of NUBS interpolator and presents the process of its integration into PC-NC. For more accurate feed, NURBS algorithm is improved. Also, Evaluation of real time NURBS interpolator is provided to verify fred accuracy and geometrical accuracy of NURBS curve. NURBS machining of fee surface is simulated on the real time NC simulator so that machining time is compared to that of linear path machining.

  • PDF

Study of Shape Optimization for Automobile Lock-up Clutch Piston Design with B-spline Curve Fitting and Simplex Method (B-spline Curve Fitting 과 심플렉스법을 적용한 자동차 록업클러치 피스톤 형상최적설계에 관한 연구)

  • Kim, Choel;Hyun, Seok-Jeong;Son, Jong-Ho;Shin, Se-Hyun
    • 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.

  • PDF

A B-spline based Branch & Bound Algorithm for Global Optimization (전역 최적화를 위한 B-스플라인 기반의 Branch & Bound알고리즘)

  • Park, Sang-Kun
    • Korean Journal of Computational Design and Engineering
    • /
    • v.15 no.1
    • /
    • pp.24-32
    • /
    • 2010
  • This paper introduces a B-spline based branch & bound algorithm for global optimization. The branch & bound is a well-known algorithm paradigm for global optimization, of which key components are the subdivision scheme and the bound calculation scheme. For this, we consider the B-spline hypervolume to approximate an objective function defined in a design space. This model enables us to subdivide the design space, and to compute the upper & lower bound of each subspace where the bound calculation is based on the LHS sampling points. We also describe a search tree to represent the searching process for optimal solution, and explain iteration steps and some conditions necessary to carry out the algorithm. Finally, the performance of the proposed algorithm is examined on some test problems which would cover most difficulties faced in global optimization area. It shows that the proposed algorithm is complete algorithm not using heuristics, provides an approximate global solution within prescribed tolerances, and has the good possibility for large scale NP-hard optimization.

Least Square B-Spline Fitting For Surface Measurement (곡면 측정을 위한 최소 자승 비-스플라인 Fitting)

  • Jung, Jong-Yun;Lisheng Li;Lee, Choon-Man;Chung, Won-Jee
    • 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.

Global Search for Optimal Geometric Path amid Obstacles Considering Manipulator Dynamics (로봇팔의 동역학을 고려한 장애물 속에서의 최적 기하학적 경로에 대한 전역 탐색)

  • 박종근
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.1133-1137
    • /
    • 1995
  • This paper presents a numerical method of the global search for an optimal geometric path for a manipulator arm amid obstacles. Finite term quintic B-splines are used to describe an arbitrary point-to-point manipulator motion with fixed moving time. The coefficients of the splines span a linear vector space, a point in which uniquely represents the manipulator motion. All feasible geometric paths are searched by adjusting the seed points of the obstacle models in the penetration growth distances. In the numerical implementation using nonlinear programming, the globally optimal geometric path is obtained for a spatial 3-link(3-revolute joints) manipulator amid several hexahedral obstacles without simplifying any dynamic or geometric models.

  • PDF

Shape Optimization of Shell Surfaces Based on Linkage Framework betweenGeometric Modeling and Finite Element Analysis (유한요소해석과 기하학적 모델링의 연동에 기초한 쉘 곡면의 형상 최적 설계)

  • Kim, Hyon-Cheol;Roh, Hee-Yuel;Cho, Maeng-Hyo
    • Proceedings of the KSME Conference
    • /
    • 2003.11a
    • /
    • pp.1328-1333
    • /
    • 2003
  • In the present study, an integrated framework of geometric modeling, analysis, and design optimization is proposed. Geometric modeling is based on B-spline surface representation. Geometrically-exact shell finite element is implemented in analysis module. Control points of the surface are selected as design variables for optimization, which can make the interaction easier between analysis and surface representation. Sequential linear programming(SLP) is adopted for the shape optimization of surfaces. For the computation of shape sensitivities, semi-analytical method is used. The developed integrated framework should serve as a powerful tool for the geometric modeling, analysis, and shape design of surfaces.

  • PDF