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

Intersection bounds: estimation and inference

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is especially convenient for models comprised of a continuum of inequalities that are separable in parameters, and also applies to models with inequalities that are non-separable in parameters. Since analog estimators for intersection bounds can be severely biased in finite samples, routinely underestimating the size of the identified set, we also offer a median-bias-corrected estimator of such bounds as a natural by-product of our inferential procedures. We develop theory for large sample inference based on the strong approximation of a sequence of series or kernel-based empirical processes by a sequence of "penultimate" Gaussian processes. These penultimate processes are generally not weakly convergent, and thus non-Donsker. Our theoretical results establish that we can nonetheless perform asymptotically valid inference based on these processes. Our construction also provides new adaptive inequality/moment selection methods. We provide conditions for the use of nonparametric kernel and series estimators, including a novel result that establishes strong approximation for any general series estimator admitting linearization, which may be of independent interest.

TiGL - An Open Source Computational Geometry Library for Parametric Aircraft Design

This paper introduces the software TiGL: TiGL is an open source high-fidelity geometry modeler that is used in the conceptual and preliminary aircraft and helicopter design phase. It creates full three-dimensional models of aircraft from their parametric CPACS description. Due to its parametric nature, it is typically used for aircraft design analysis and optimization. First, we present the use-case and architecture of TiGL. Then, we discuss it's geometry module, which is used to generate the B-spline based surfaces of the aircraft. The backbone of TiGL is its surface generator for curve network interpolation, based on Gordon surfaces. One major part of this paper explains the mathematical foundation of Gordon surfaces on B-splines and how we achieve the required curve network compatibility. Finally, TiGL's aircraft component module is introduced, which is used to create the external and internal parts of aircraft, such as wings, flaps, fuselages, engines or structural elements

3-D Face Analysis and Identification Based on Statistical Shape Modelling

This paper presents an effective method of statistical shape representation for automatic face analysis and identification in 3-D. The method combines statistical shape modelling techniques and the non-rigid deformation matching scheme. This work is distinguished by three key contributions. The first is the introduction of a new 3-D shape registration method using hierarchical landmark detection and multilevel B-spline warping technique, which allows accurate dense correspondence search for statistical model construction. The second is the shape representation approach, based on Laplacian Eigenmap, which provides a nonlinear submanifold that links underlying structure of facial data. The third contribution is a hybrid method for matching the statistical model and test dataset which controls the levels of the model’s deformation at different matching stages and so increases chance of the successful matching. The proposed method is tested on the public database, BU-3DFE. Results indicate that it can achieve extremely high verification rates in a series of tests, thus providing real-world practicality

Solving the Monge-Amp\`ere Equations for the Inverse Reflector Problem

The inverse reflector problem arises in geometrical nonimaging optics: Given a light source and a target, the question is how to design a reflecting free-form surface such that a desired light density distribution is generated on the target, e.g., a projected image on a screen. This optical problem can mathematically be understood as a problem of optimal transport and equivalently be expressed by a secondary boundary value problem of the Monge-Amp\`ere equation, which consists of a highly nonlinear partial differential equation of second order and constraints. In our approach the Monge-Amp\`ere equation is numerically solved using a collocation method based on tensor-product B-splines, in which nested iteration techniques are applied to ensure the convergence of the nonlinear solver and to speed up the calculation. In the numerical method special care has to be taken for the constraint: It enters the discrete problem formulation via a Picard-type iteration. Numerical results are presented as well for benchmark problems for the standard Monge-Amp\`ere equation as for the inverse reflector problem for various images. The designed reflector surfaces are validated by a forward simulation using ray tracing.Comment: 28 pages, 8 figures, 2 tables; Keywords: Inverse reflector problem, elliptic Monge-Amp\`ere equation, B-spline collocation method, Picard-type iteration; Minor revision: reference [59] to a recent preprint has been added and a few typos have been correcte