Search

Abstract: In a recent paper (Computer Aided Geometric Design 23 (3), 243–260), Yang presented a novel kind of nonlinear and geometry driven subdivision scheme for curve interpolation. The author declared that this scheme was shape preserving when all free parameters were explicitly selected by some specific rules. In this note, we demonstrate that the author (a) ignored the consistency of the definition to straight edges, and also (b) did not give a perfect scheme and proof for the shape preserving subdivision. [Copyright &y& Elsevier]

In computer aided geometric design a polynomial is usually represented in Bernstein form. This paper presents a family of compensated algorithms to accurately evaluate a polynomial in Bernstein form with floating point coefficients. The principle is to apply error-free transformations to improve the traditional de Casteljau algorithm. At each stage of computation, round-off error is passed on to first order errors, then to second order errors, and so on. After the computation has been "filtered" (K − 1) times via this process, the resulting output is as accurate as the de Casteljau algorithm performed in K times the working precision. Forward error analysis and numerical experiments illustrate the accuracy of this family of algorithms. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents a systematic method for the determination of optimal geometric machining parameters in multi-axis machining. Machining accuracy is considered to be determined by a set of geometric parameters: the design parameters of the cutter, the positioning of the cutter, the orientation of the cutter etc. First, we formulate the general nonlinear constrained optimization model of the machining process. The optimal machining result is expected to produce the least deviation between the designed surface and the actual surface. This objective is accomplished by minimizing the deviation between the designed surface and the actual surface during machining. The details of how to characterize and calculate the deviation is then discussed for both ruled surface milling and general free-form surface milling. The swept surface is developed based on robotic manipulation and is used to model the actual surface. A signed distance function is constructed to perform the comparison which returns the signed distance from each sampled point to the designed surface. The direct search algorithm (Nelder–Mead simplex algorithm and pattern search algorithm in this paper) is used to solve our optimization problems due to possible discontinuity of the objective function and large nonlinearity of the problem. Three numerical examples and necessary comparisons are given to demonstrate the effectiveness of our method. The first example shows the generation of the swept volume of a filled-end cutter. The second example employs the swept surface generation method to solve a parameter optimization problem. Sensitivity analysis is performed for the parameters critical to machining accuracy. The third example optimizes the cutter orientation relative to the part surface to minimize the kinematics error caused by kinematics transformation and interpolation of multi-axis machines. [Copyright &y& Elsevier]

Abstract: The league championship algorithm (LCA) is a new algorithm originally proposed for unconstrained optimization which tries to metaphorically model a League championship environment wherein artificial teams play in an artificial league for several weeks (iterations). Given the league schedule, a number of individuals, as sport teams, play in pairs and their game outcome is determined given known the playing strength (fitness value) along with the team formation (solution). Modelling an artificial match analysis, each team devises the required changes in its formation (a new solution) for the next week contest and the championship goes for a number of seasons. In this paper, we adapt LCA for constrained optimization. In particular: (1) a feasibility criterion to bias the search toward feasible regions is included besides the objective value criterion; (2) generation of multiple offspring is allowed to increase the probability of an individual to generate a better solution; (3) a diversity mechanism is adopted, which allows infeasible solutions with a promising objective value precede the feasible solutions. Performance of LCA is compared with comparator algorithms on benchmark problems where the experimental results indicate that LCA is a very competitive algorithm. Performance of LCA is also evaluated on well-studied mechanical design problems and results are compared with the results of 21 constrained optimization algorithms. Computational results signify that with a smaller number of evaluations, LCA ensures finding the true optimum of these problems. These results encourage that further developments and applications of LCA would be worth investigating in the future studies. [Copyright &y& Elsevier]

Abstract: This paper describes a numerical procedure for the blank shape design of thin metallic parts obtained by stamping. The objective is to determine the initial blank shape knowing the geometry of the desired 3D CAD part. The numerical procedure consists of two stages: At first, an estimation of the initial blank shape is given using the one step inverse approach (IA). Then, update of the blank shape is continued by iterations combining optimization algorithms and finite element analysis (FEA). The numerical procedure for the blank shape design is tested in the case of an industrial stamping process where the part is formed using a manual press without blank-holder. The proposed numerical procedure can provide very quickly the optimal blank shape in a few iterations. [Copyright &y& Elsevier]

In this paper, we propose a novel adaptive mesh fitting algorithm that fits a triangular model with smoothly stitching bi-quintic Bézier patches. Our algorithm first segments the input mesh into a set of quadrilateral patches, whose boundaries form a quadrangle mesh. For each boundary of each quadrilateral patch, we construct a normal curve and a boundary-fitting curve, which fit the normal and position of its boundary vertices respectively. By interpolating the normal and boundary-fitting curves of each quadrilateral patch with a Bézier patch, an initial smoothly stitching Bézier patches is generated. We perform this patch-based fitting scheme in an adaptive fashion by recursively subdividing the underlying quadrilateral into four sub-patches. The experimental results show that our algorithm achieves precision-ensured Bézier patches with continuity and meets the requirements of reverse engineering. [Copyright &y& Elsevier]

In this paper, we present a new approach of-spline curve fitting to a set of ordered points, which is motivated by an insight that properly selected points called dominant points can play an important role in producing better curve approximation. The proposed approach takes four main steps: parameterization, dominant point selection, knot placement, and least-squares minimization. The approach is substantially different from the conventional approaches in knot placement and dominant point selection. In the knot placement, the knots are determined by averaging the parameter values of the dominant points, which basically transforms-spline curve fitting into the problem of dominant point selection. We describe the properties of the knot placement including the property of local modification useful for adaptive curve refinement. We also present an algorithm for dominant point selection based on the adaptive refinement paradigm. The approach adaptively refines a-spline curve by selecting fewer dominant points at flat regions but more at complex regions. For the same number of control points, the proposed approach can generate a-spline curve with less deviation than the conventional approaches. When adopted in error-bounded curve approximation, it can generate a-spline curve with far fewer control points while satisfying the desired shape fidelity. Some experimental results demonstrate its usefulness and quality. [Copyright &y& Elsevier]