486 research outputs found
Parameterization adaption for 3D shape optimization in aerodynamics
When solving a PDE problem numerically, a certain mesh-refinement process is
always implicit, and very classically, mesh adaptivity is a very effective
means to accelerate grid convergence. Similarly, when optimizing a shape by
means of an explicit geometrical representation, it is natural to seek for an
analogous concept of parameterization adaptivity. We propose here an adaptive
parameterization for three-dimensional optimum design in aerodynamics by using
the so-called "Free-Form Deformation" approach based on 3D tensorial B\'ezier
parameterization. The proposed procedure leads to efficient numerical
simulations with highly reduced computational costs
Conversion of trimmed NURBS surfaces to Catmull-Clark subdivision surfaces
This paper introduces a novel method to convert trimmed NURBS surfaces to untrimmed subdivision surfaces with Bézier edge conditions. We take a NURBS surface and its trimming curves as input, from this we automatically compute a base mesh, the limit surface of which fits the trimmed NURBS surface to a specified tolerance. We first construct the topology of the base mesh by performing a cross-field based decomposition in parameter space. The number and positions of extraordinary vertices required to represent the trimmed shape can be automatically identified by smoothing a cross field bounded by the parametric trimming curves. After the topology construction, the control point positions in the base mesh are calculated based on the limit stencils of the subdivision scheme and constraints to achieve tangential continuity across the boundary. Our method provides the user with either an editable base mesh or a fine mesh whose limit surface approximates the input within a certain tolerance. By integrating the trimming curve as part of the desired limit surface boundary, our conversion can produce gap-free models. Moreover, since we use tangential continuity across the boundary between adjacent surfaces as constraints, the converted surfaces join with G1 continuity. © 2014 The Authors.EPSRC, Chinese Government (PhD studentship) and Cambridge Trust
www.elsevier.com/locate/cagd A local fitting algorithm for converting planar curves to B-splines
In this paper we present a local fitting algorithm for converting smooth planar curves to B-splines. For a smooth planar curve a set of points together with their tangent vectors are first sampled from the curve such that the connected polygon approximates the curve with high accuracy and inflexions are detected by the sampled data efficiently. Then, a G1 continuous BĂ©zier spline curve is obtained by fitting the sampled data with shape preservation as well as within a prescribed accuracy. Finally, the BĂ©zier spline is merged into a C2 continuous B-spline curve by subdivision and control points adjustment. The merging is guaranteed to be within another error bound and with no more inflexions than the BĂ©zier spline. In addition to shape preserving and error control, this conversion algorithm also benefits that the knots are selected automatically and adaptively according to local shape and error bound. A few experimental results are included to demonstrate the validity and efficiency of the algorithm
- …