Fast B-spline Curve Fitting by L-BFGS

We propose a novel method for fitting planar B-spline curves to unorganized data points. In traditional methods, optimization of control points and foot points are performed in two very time-consuming steps in each iteration: 1) control points are updated by setting up and solving a linear system of equations; and 2) foot points are computed by projecting each data point onto a B-spline curve. Our method uses the L-BFGS optimization method to optimize control points and foot points simultaneously and therefore it does not need to perform either matrix computation or foot point projection in every iteration. As a result, our method is much faster than existing methods

A survey of partial differential equations in geometric design

YesComputer aided geometric design is an area where the improvement of surface generation techniques is an everlasting demand since faster and more accurate geometric models are required. Traditional methods for generating surfaces were initially mainly based upon interpolation algorithms. Recently, partial differential equations (PDE) were introduced as a valuable tool for geometric modelling since they offer a number of features from which these areas can benefit. This work summarises the uses given to PDE surfaces as a surface generation technique togethe

An interactive graphics program to retrieve, display, compare, manipulate, curve fit, difference and cross plot wind tunnel data

The Aerodynamic Data Analysis and Integration System (ADAIS), developed as a highly interactive computer graphics program capable of manipulating large quantities of data such that addressable elements of a data base can be called up for graphic display, compared, curve fit, stored, retrieved, differenced, etc., was described. The general nature of the system is evidenced by the fact that limited usage has already occurred with data bases consisting of thermodynamic, basic loads, and flight dynamics data. Productivity using ADAIS of five times that for conventional manual methods of wind tunnel data analysis is routinely achieved. In wind tunnel data analysis, data from one or more runs of a particular test may be called up and displayed along with data from one or more runs of a different test. Curves may be faired through the data points by any of four methods, including cubic spline and least squares polynomial fit up to seventh order

Repairing triangle meshes built from scanned point cloud

The Reverse Engineering process consists of a succession of operations that aim at creating a digital representation of a physical model. The reconstructed geometric model is often a triangle mesh built from a point cloud acquired with a scanner. Depending on both the object complexity and the scanning process, some areas of the object outer surface may never be accessible, thus inducing some deficiencies in the point cloud and, as a consequence, some holes in the resulting mesh. This is simply not acceptable in an integrated design process where the geometric models are often shared between the various applications (e.g. design, simulation, manufacturing). In this paper, we propose a complete toolbox to fill in these undesirable holes. The hole contour is first cleaned to remove badly-shaped triangles that are due to the scanner noise. A topological grid is then inserted and deformed to satisfy blending conditions with the surrounding mesh. In our approach, the shape of the inserted mesh results from the minimization of a quadratic function based on a linear mechanical model that is used to approximate the curvature variation between the inner and surrounding meshes. Additional geometric constraints can also be specified to further shape the inserted mesh. The proposed approach is illustrated with some examples coming from our prototype software

Aerodynamic design of the contoured wind-tunnel liner for the NASA supercritical, laminar-flow-control, swept-wing experiment

An overview is presented of the entire procedure developed for the aerodynamic design of the contoured wind tunnel liner for the NASA supercritical, laminar flow control (LFC), swept wing experiment. This numerical design procedure is based upon the simple idea of streamlining and incorporates several transonic and boundary layer analysis codes. The liner, presently installed in the Langley 8 Foot Transonic Pressure Tunnel, is about 54 ft long and extends from within the existing contraction cone, through the test section, and into the diffuser. LFC model testing has begun and preliminary results indicate that the liner is performing as intended. The liner design results presented in this paper, however, are examples of the calculated requirements and the hardware implementation of them

Computer programs for plotting curves with various dashed-line sequences

Two FORTRAN-callable subprograms have been written to draw a smooth curve through a set of input points as a solid line or as a general sequence of long and short dashes. Subroutine LINSEQ draws conventional curves whereas subroutine CONSEQ draws smooth closed curves (contours). The subprograms are based on an approximate calculation of the arc length along the curve and spline interpolation along the arc length. Options are provided for smoothing of the input data and for offsetting the plotted curve from the input data points. The method of calculation of the arc length and the generation of the line sequence are described.Usage descriptions of the main subprograms, sample calling programs illustrating the various features of the subprograms, and sample plots are given. The subroutines should be readily adaptable to almost any computer-driven incremental plotter

Feasible Form Parameter Design of Complex Ship Hull Form Geometry

This thesis introduces a new methodology for robust form parameter design of complex hull form geometry via constraint programming, automatic differentiation, interval arithmetic, and truncated hierarchical B- splines. To date, there has been no clearly stated methodology for assuring consistency of general (equality and inequality) constraints across an entire geometric form parameter ship hull design space. In contrast, the method to be given here can be used to produce guaranteed narrowing of the design space, such that infeasible portions are eliminated. Furthermore, we can guarantee that any set of form parameters generated by our method will be self consistent. It is for this reason that we use the title feasible form parameter design. In form parameter design, a design space is represented by a tuple of design parameters which are extended in each design space dimension. In this representation, a single feasible design is a consistent set of real valued parameters, one for every component of the design space tuple. Using the methodology to be given here, we pick out designs which consist of consistent parameters, narrowed to any desired precision up to that of the machine, even for equality constraints. Furthermore, the method is developed to enable the generation of complex hull forms using an extension of the basic rules idea to allow for automated generation of rules networks, plus the use of the truncated hierarchical B-splines, a wavelet-adaptive extension of standard B-splines and hierarchical B-splines. The adaptive resolution methods are employed in order to allow an automated program the freedom to generate complex B-spline representations of the geometry in a robust manner across multiple levels of detail. Thus two complementary objectives are pursued: ensuring feasible starting sets of form parameters, and enabling the generation of complex hull form geometry

Component-based Geometry Manipulation for Aerodynamic Shape Optimization with Overset Meshes

Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/143082/1/6.2017-3327.pd

Flexible G1 Interpolation of Quad Meshes

International audienceTransforming an arbitrary mesh into a smooth G1 surface has been the subject of intensive research works. To get a visual pleasing shape without any imperfection even in the presence of extraordinary mesh vertices is still a challenging problem in particular when interpolation of the mesh vertices is required. We present a new local method, which produces visually smooth shapes while solving the interpolation problem. It consists of combining low degree biquartic Bézier patches with minimum number of pieces per mesh face, assembled together with G1-continuity. All surface control points are given explicitly. The construction is local and free of zero-twists. We further show that within this economical class of surfaces it is however possible to derive a sufficient number of meaningful degrees of freedom so that standard optimization techniques result in high quality surfaces

Piecewise algebraic surface computation and fairing from a discrete model

This paper describes a constrained fairing method for implicit surfaces defined on a voxelization. This method is suitable for computing a closed smooth surface that approximates an initial set of face connected voxels.Preprin