• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.127-138
• /
• 1999

For reverse engineering, curves and surfaces are modeled for new products by interpolating the digitized data points. But there are many measuring or deviation errors. Therefore, it is important to handle errors during the curve or surface modeling. If the errors are ignored, designer could get undesirable results. For this reason, fairing procedure with the aesthetics criteria is necessary in computer modeling. This paper presents methods of 3D NURBS curve fairing. The techniques are based on automatic repositioning of the digitized dat points or the NURBS curve control points by a constrained nonlinear optimization algorithm. The objective function is derived variously by derived curved. Constraints are distance measures between the original and the modified digitized data points. Changes I curve shape are analyzed by illustrations of curve shapes, and continuous plotting of curvature and torsion.

• Journal of Ocean Engineering and Technology
• /
• v.13 no.4 s.35
• /
• pp.169-173
• /
• 1999

In this paper some modifications for Lu's inverse method of fairing process are presented. The object function is changed and additional constraints for hull curve foiling is proposed. The newly introduced minimizing object function is the sum of the distances between the two curve's positions at the same parameter values instead of the sum of the distances between two vertices. The new one is better to represent the physical meaning of the object function, the smaller differences between two curves. In ship hull fairing the end tangent of curve has to be fined in some cases, so the additional constraint is considered to preserve the direction of end tangent. The sample results are shown.

• Journal of Ocean Engineering and Technology
• /
• v.14 no.2
• /
• pp.121-127
• /
• 2000

In this paper a new technique of inverse fairing problem for ship hull is proposed. Recently Lu solved the inverse fairing problem for automobile's body that was made by one surface element. In this system however hull surface is constructed by Gregory's composite surface interpolation method. So reflection line at boundary position is used as a tool of solving inverse problem in surface fairing. But the results are not good. The new concepts of Normal vector line and Constrained reflection line are introduced as an alternative tool. Energy minimization method for Normal Vector Line curve net and the inverse method for Constrained Reflection Line by using optimization technique are examined And the final lines from this proposed surface fairing method shows good fairness.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.13 no.5
• /
• pp.103-109
• /
• 2004

This paper presents a fairing method for reverse engineering of a free-formed surface. Utilizing measured data points, reverse engineering is a useful method to construct a CAD model from physical model. Measured data points should be faired since raw data may have outliers. A fairing algorithm of polynomial regression model generates smooth curves of approximation in this paper. The faired curves are utilized to construct a free-formed surface. For a verifying example, an impeller blade is digitized with a CMM to collect raw data on the surfacce and a CAD model is constructed. This research produces impeller blades with 5-axis machining center through the CAD model and compares them with a physical model. As a result the produced surface modeled with the fairing method gives less error than that without the fairing.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.780-785
• /
• 1987

The measuring point data of clay model are widely used to design parts whose external features are important design factor such as automobiles and general die products. This paper presents a method for improving the process to generate smooth surfaces from the measuring point data using turnkey CAD/CAM system. The process of smooth-surface generation involves several steps: styline finding, curve fairing, surface generation and filleting. The process is improved by automatic curve fairing, local correction of surface and multi-boundary surface treatment. An automobile bumper and a telephone receiver are measured and modeled to test the new method. Significant time saving is resulted by changing interactive mode to automatic mode and eliminating inefficient loop of surface generation process.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.4
• /
• pp.253-266
• /
• 1997

Pencil-curve machining, which is a single-pass ball-end milling along a concave edge on adie surface, is widely employed in die-surface machining. The cutter-path used for pencil-curve machining, which is the trajectory of the “ball-center point” of a ball-endmill sliding along a concave-edge region on the die surface, is called pencil-curve. Presented in the paper is a pencil-curve tracing algorithm in which “concave-type” sharp edges are computed from a “virtually digitized” model of the tool-envelope surface. The resulting “initial” pencil-cures are then refuted by applying a series of fairing operations. illustrative examples and methods for enhancing accuracy are also presented. The proposed pencil-curve tracing algorithm has been successfully implemented in a commercial CAM system specialized in die-machining and in the CAD/CAM system CATIA.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.2
• /
• pp.15-21
• /
• 1994

In the previous researches on mesh curve fairing method, a set of discrete data points in a mesh can be selected as variables. End tangent vectors can not be variables. This restriction makes some problems in preparing the end tangent vectors at the bow or stern parts, because their slopes are not infinites or zeros. In this paper end tangent vectors are included as variables and the more smooth results are obtained. Also two methods of constructing ship hull surface from mesh curves are examined. It is shown that the skinning method is better than non-uniform B-spline fitting method in representing the area near boundary. The generation of a ship surface is given as an example.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.4
• /
• pp.32-40
• /
• 1994

This paper describes a smooth surface interpolating method of ship hull using a three-dimensional currie net that comes from the mesh curve fairing process. Geometric continuity(($GC^1$) is preserved across the boundary curve between patches. The three-dimensional curve net can have nonrectangular topologies, such as triangular and pentagonal topology. Among the boundary curve interpolation methods, Hermite blended Coons patch, Convex combination, and Gregory patch interpolation method are used to generate the ship hull surface. To check the fairness of the surface, the numerical method of surface/surface intersection problem is adopted. An application to an actual ship hull is given as an example.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.39 no.4
• /
• pp.298-304
• /
• 2003

In this paper a free-form hull design program and performance prediction program for planing boat is introduced. This program enables the designer to do complex geometric hull shape design on a personal computer and accurately to predict power requirements for a given loading and velocity. For a free form design, Bezier curve model is adopted as a basic representation tool of curves and surfaces, and this program has versatile functions to do fairing jobs with a convenient graphical user interface. After creating a hull form the geometric data is provided in a manner compatible with a variety of analysis tools including 'Motion Analysis(by Zarnick)' for prediction of motion characteristics in regular waves, 'Running Attitude (by Savitsky)' for prediction of the running attitude and required power.

• Journal of the Society of Naval Architects of Korea
• /
• v.35 no.4
• /
• pp.118-125
• /
• 1998

This paper presents the hybrid curve approximation with geometric boundary conditions as position vector and tangent vector of start and end point using a B-spline approximation and a genetic algorithm First, H-spline approximation generates control points to fit B-spline curries through specified data points. Second, these control points are modified by genetic algorithm(with floating point representation) under geometric boundary conditions. This method would be able to execute the efficient design work without fairing.