• 한국CDE학회논문집
• /
• 제3권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.

• 한국자동차공학회논문집
• /
• 제6권4호
• /
• pp.129-140
• /
• 1998

A numerical method is proposed to optimize automotive cam profiles. An acceleration curve of a cam follower motion is described by Hermite spline curves. Because of the intrinsic characteristics of the Hermite curve, it is possible to design an acceleration curve with arbitrary shape. Design variables in the optimization problem are location of control points which define the acceleration curve. Objective function includes dynamic performances as well as kinematic properties of a valve train. Similar optimization procedure was also performed using Polydyne cam profile synthesis method. Optimized profiles using the Hermite curve are proved to be superior to those using the Polydyne method.

• 한국컴퓨터그래픽스학회논문지
• /
• 제22권3호
• /
• pp.1-9
• /
• 2016

볼륨 가시화의 샘플링 단계에서는 보통 선형 보간이 사용된다. 선형 보간은 일반적으로 좋은 화질의 영상을 생성하지만 의료영상 소프트웨어는 높은 화질의 영상이 필요하기 때문에 경우에 따라 높은 기대에 미치지 못한다. 본 연구는 샘플링 단계에서 B 스플라인을 기반으로 하는 삼차 보간을 수행한다. 기존의 B 스플라인은 제어점을 지나지 않는 근사 함수이므로, 본 연구는 제어점을 이동하여 생성된 곡선이 원래의 제어점을 지나도록 하였다. 가시화 단계에서는 속도를 향상하기 위해 빈공간 도약을 적용 가능하다. 빈공간을 파악하기 위해서는 각 블록에 대한 최대값과 최소값을 계산해야 한다. B 스플라인은 볼록포 성질이 있어서, 제어점의 값을 최대값과 최소값으로 사용할 수 있다. 그 결과로 삼차 보간 기반의 볼륨 가시화가 대화적 속도로 가능하다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 G
• /
• pp.3165-3168
• /
• 1999

When a input image is extensively magnified on the computer system, it is almost impossible to replicate the original shape because of mismatched coordinates system. In order to resolve the problem, the shape of the magnified image has been reconfigured using the bilinear interpolation method, low pass special filtering interpolation method and B-spline interpolation method. Ferguson curve interpolation method based on the CAD/CAM curve interpolation algorithm.

• 한국생산제조학회지
• /
• 제18권6호
• /
• pp.576-584
• /
• 2009

Up to now, it has been said that no satisfactory computer solution has 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 based on the 5 precision points method. The suggested algorithm generates the desired coupler curve by using NURBS, and then the generated curve approximates as closely as possible to the desired curve representing coupler link trajectory. Also, when comparing each generated curve by constructing the control polygon, rapid comparison is easily achieved by applying convex hull of the control polygon. Finally, an 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, two four bar linkages were tested and the result well demonstrated the effectiveness of the algorithm.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.469-473
• /
• 2003

Milling 가공시 공구와 피삭재의 접합명에서는 절삭가공의 잔유물인 burr가 생성되고, 이러한 Burr는 작업효율과 정밀도를 감소시키며 추처리과정 (Deburring)을 야기시키는 원인이 된다. 그러므로 정밀도와 작업효율을 극대화하기 위해서는 이러한 Burr의 생성원리를 파악함과 동시에 Exit Burr의 여부에 대한 판별을 하여 최적의 가공조건을 맞추어 주어야 하는데, 이러한 경우에 지금까지는 점, 선 및 원으로 피삭재의 형상을 재현하여 공구의 경로와의 Exit 각을 통해 결과를 예측하는 연구를 해왔었다. 본 논문에서 추구하고자 하는 핵심은 이러한 피삭재의 형상을 재현하기 위해 지금까지 사용해왔던 요소를 보다 다양화시키는 방안을 제시하여 프로그램의 적용 범위를 넓히려는 것이다. 예컨대 이제까지 실제 가공에서 사용되고 있는 임의형상에 대한 표현 방식 중에서 대다수 CAD 프로그램에서 곡선 및 곡면을 표현하는 경우, B-Spline Curve의 알고리즘은 패삭재의 불규칙적인 곡면을 가장 근사하게 표현하는 최적의 해결책으로 쓰여지고 있다. 그러므로 이러한 알고리즘을 통해 프로그램의 적용예를 넓히는 것은 보다 다양한 조건에서의 Burr생성에 대한 예측을 가능케 해주는 것이다. 본 논문에서는 앞에서 언급한 바와 같이 B-Spline Curve 알고리즘을 개발하고, 프로그램에 적용하는 일련의 과정을 통해 보다 다양한 형상의 피삭재에서 단일 혹은 복합경로의 공구가 지나갈 경우에 생길 수 있는 Burr를 얼마나 효율적으로 판별할 수 있는지를 소개하고자 한다.

• 한국정밀공학회지
• /
• 제18권10호
• /
• pp.168-177
• /
• 2001

Reverse engineering has been widely used for the shape reconstruction of an object without CAD data and the measurement of clay or wood models fur the development of new products. To generate a surface from measured points by a laser scanner, typical steps include the scanning of a clay or wood model, the generation of compatible input curves, the generation of a surface and manufacturing data like G code or STL file. A laser scanner has a great potential to get geometrical data of a model for its frost measuring speed and higher precision. The data from a laser scanner are composed of many line stripes of points including small spikes and noise. A new approach using automated surface generating algorithm is introduced to deal with problems during reverse engineering process. And the input data and the generated surface are represented in IGES format, thus can be supplied to other CAD/CAM software without any data manipulation.

• 한국자동차공학회논문집
• /
• 제12권3호
• /
• pp.101-108
• /
• 2004

A FEM-based efficient method is developed for the shape optimization of 2-D structures. The combined SLP and Simplex method are coupled with finite element analysis. Selected set of master nodes on the design boundaries are employed as design variables and assigned to move towards their normal directions. The other nodes along the design boundaries are grouped into the master node. By interpolating the repositioned master nodes, the B-spline curves are formed so that the rest mid-nodes efficiently settle down on the B-spline curves. Mesh smoothing scheme is also applied for the nodes on the design boundary to maintain most finite elements 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.

• 한국CDE학회논문집
• /
• 제15권4호
• /
• pp.253-260
• /
• 2010

This paper presents algorithms for computing offsets of freeform curves. The approach first divides the original curve into several segments at the inflexion points. Based on the obtained new control polygon and its offsets, quadratic trigonometric splines are constructed to approximate the offset curves. Finally, the shape parameter value of trigonometric spline is determined to satisfy the required tolerance. The degree of the output curve is two, independent of the original curve's degree. Because of the great controllability, the proposed method can generate a completely overestimating offset curve by adjusting the value of the shape parameter, which guarantees no overcutting in NC machining. Furthermore, it also produces the lowest number of control points compared with other works.

• 한국CDE학회논문집
• /
• 제15권3호
• /
• pp.178-188
• /
• 2010

This paper addresses the problem of determining if two surfaces intersect tangentially or transversally in a mathematically consistent manner and approximating an intersection curve. When floating point arithmetic is used in the computation, due to the limited precision, it often happens that the decision for tangential and transversal intersection is not clear cut. To handle this problem, in this paper, interval arithmetic is proposed to use, which provides a mathematically consistent way for such decision. After the decision, the intersection is traced using the validated ODE solver, which runs in interval arithmetic. Then an iterative method is used for computing the accurate intersection point at a given arc-length of the intersection curve. The computed intersection points are then approximated by using a B-spline curve, which is provided as one instance of intersection curve for further geometric processing. Examples are provided to demonstrate the proposed method.