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]

Surface skinning is a surface generation method that uses a set of given cross-sectional curves, and it is widely used in free-form surface design. In the B-spline surface skinning, the given B-spline curves should be compatible, that is, the curves should have the same degree and knot sequence. While making the curves compatible, lots of control vertices are generated. Although T-spline surface skinning methods have been introduced to reduce the number of control vertices, the T-spline skinning method that was proposed by Nasri et al. (2012) can generate a wiggled surface when the given B-spline curves are not sufficiently compatible. The intermediate cross sections that were introduced for T-spline surface skinning cannot preserve the shape of the given B-spline curves if the adjacent B-spline curves do not have sufficient common knots, and it can cause wiggles on the surface. In this paper, we analyze this issue and suggest a modified method to remove the wiggles on the skinned T-spline surface. Furthermore, we propose an algorithm for shape preservation of the surface. Our approach is verified by suggesting some examples compared to the Nasri et al. (2012)’s method. [ABSTRACT FROM AUTHOR]

Abstract: We provide a flexible shape control technique in this paper for the automatic resizing of apparel products. The automatic resizing function has become an essential part of the 3D garment CAD systems to generate user customized apparel products for individuals with variant body shapes. The human bodies are usually represented by piecewise linear mesh surfaces with consistent connectivity. The shape of apparel products can then be warped from the space around a human body to the space around another body by computing the new positions of points on apparel products. However, one major limitation of this kind of automatic resizing technique is that the apparel products are always distorted along the shape of the human bodies. This is a required deformation for tight clothes but not an expected result for other types of clothes. To solve this problem, we investigate a method to preserve the shape of user-defined features on the apparel products. As the apparel products are often represented by discrete surfaces with non-manifold entities, the existing mesh processing approaches that preserve the local shape cannot be applied here. A new algorithm consisting of three steps is developed in this paper. First, the apparel product is warped from the reference human body to the space around the target human body. Second, the shape of features is optimized to match their original shape before the warping. Lastly, discrete surfaces of the apparel product are deformed again under an optimization framework to match their original shapes locally while interpolating the shape of features determined in the previous step. [Copyright &y& Elsevier]

Abstract: This paper focuses on interpolating vertices and normal vectors of a closed quad-dominant mesh 1 [1] A mesh is quad-dominant if it contains quad facets as its majority. The quantity of quad facets is much more than the quantity of triangular and other multi-sided facets. -continuously using regular Coons B-spline surfaces, which are popular in industrial CAD/CAM systems. We first decompose all non-quadrangular facets into quadrilaterals. The tangential and second-order derivative vectors are then estimated on each vertex of the quads. A least-square adjustment algorithm based on the homogeneous form of continuity condition is applied to achieve curvature continuity. Afterwards, the boundary curves, the first- and the second-order cross-boundary derivative curves are constructed fulfilling continuity and compatibility conditions. Coons B-spline patches are finally generated using these curves as boundary conditions. In this paper, the upper bound of the rank of continuity condition matrices is also strictly proved to be , and the method of tangent-vector estimation is improved to avoid petal-shaped patches in interpolating solids of revolution. Several examples demonstrate its feasibility. [ABSTRACT FROM AUTHOR]

Free form surfaces are primarily designed and manufactured by CAD/CAM/CNC system. In traditional way, toolpath generation approaches always consider machining precision and efficiency by constraining scallop height and toolpath lengths. However, toolpath lengths do not exactly reflect the actual machining time because the feedrate usually fluctuates along different toolpath during CNC interpolating period, which indicates that the total machining efficiency is coupled with both toolpath generation and interpolation. Therefore, the toolpath generation and interpolation systems should not be independent, and the conventional unidirectional information flow from CAM to CNC should be replaced by a new mechanism with information exchange and mutual optimization. This paper proposes an inverse evaluation mechanism with feedback information from CNC to CAM system. The feedback information is obtained by off-line interpolation simulation for each toolpath and evaluation of the total machining time for the entire surface. With the feedback information, CAM is able to optimize the toolpath or choose the best one among candidate solutions. As the evaluation mechanism should be under the same interpolation algorithm, an interpolation algorithm with axis kinematic/dynamic constraints is also introduced. The simulation results with different free form surfaces show that the proposed mechanism can economically improve the machining efficiency without increasing system cost. [ABSTRACT FROM AUTHOR]

Abstract: This paper addresses new algorithms for constructing weighted cubic splines that are very effective in interpolation and approximation of sharply changing data. Such spline interpolations are a useful and efficient tool in computer-aided design when control of tension on intervals connecting interpolation points is needed. The error bounds for interpolating weighted splines are obtained. A method for automatic selection of the weights is presented that permits preservation of the monotonicity and convexity of the data. The weighted B-spline basis is also well suited for generation of freeform curves, in the same way as the usual B-splines. By using recurrence relations we derive weighted B-splines and give a three-point local approximation formula that is exact for first-degree polynomials. The resulting curves satisfy the convex hull property, they are piecewise cubics, and the curves can be locally controlled with interval tension in a computationally efficient manner. [Copyright &y& Elsevier]

Abstract: This paper proposes a method to construct a B-spline surface that interpolates the specified four groups of boundary derivative curves in the B-spline form. The discontinuity can be bounded by an arbitrary geometric invariant as the tolerance. The method first handles the six types of the compatibility problems by continuity-preserving reparameterization, knot-insertion and local control-point tuning. The transformed boundary conditions are then parametrically compatible, so the Coons strategy can be applied to construct the final interpolant. Not only can it be used in the reliable geometric modeling, but the approach also can be applied to many other algorithms that require compatibility guarantee. [Copyright &y& Elsevier]

Abstract: The geometric interpolation algorithm is proposed by Maekawa et al. in [Maekawa T, Matsumoto Y, Namiki K. Interpolation by geometric algorithm. Computer-Aided Design 2007;39:313–23]. Without solving a system of equations, the algorithm generates a curve (surface) sequence, of which the limit curve (surface) interpolates the given data points. However, the convergence of the algorithm is a conjecture in the reference above, and demonstrated by lots of empirical examples. In this paper, we prove the conjecture given in the reference in theory, that is, the geometric interpolation algorithm is convergent for a blending curve (surface) with normalized totally positive basis, under the condition that the minimal eigenvalue of the collocation matrix of the totally positive basis in each iteration satisfies . As a consequence, the geometric interpolation algorithm is convergent for Bézier, B-spline, rational Bézier, and NURBS curve (surface) if they satisfy the condition aforementioned, since Bernstein basis and B-spline basis are both normalized totally positive. [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]

Abstract: A practical example of B-spline curve control points manipulation for the geometric construction of a free form shape is presented. Elements of a cross-sectional design methodology are used in conjunction with a skinning type operator for the definition of a B-spline surface. Skinning process is well established in the CAD community, but further difficulties arise in producing smooth surfaces under constraints. This paper attempts to overcome the fairness problem by choosing an appropriate solution where the execution time has to be reasonably short. Main results include an industrial application in a preliminary aerodynamic design cycle where manufacturing tolerances defined by smoothness criteria are maintained. [Copyright &y& Elsevier]