A novel optimisation framework using an adjoint cost sensitivity calculation, and integrating computer simulations of fluid dynamics, rigid body dynamics and control is proposed. A generic tail-fin steered missile under closed-loop control is used to show that the framework is able to generate a detailed geometrical tail-fin design and tune control performance parameters that are directly relat...

Presented in this paper is an approach to construct a C-continuous surface for a mesh of arbitrary topology. The construction process is subdivision surface based, with modification performed on extra-ordinary patches to ensure C-continuity of the resulting surface. Implementation is easy because modification is patch-based. The resulting surface has an explicit expression of the form WMG for e...

Shape analyses (Chase et al. 1990, Sagiv et al. 2002) discover properties of dynamic and/or mutable structures. We ask, “Is there an equivalent to shape analysis for purely functional programs, and if so, what ‘shapes’ does it discover?” By treating binding environments as dynamically allocated structures, by treating bindings as addresses, and by treating value environments as heaps, we argue ...

In this paper, we propose a set of free-form shape deformation techniques. The basic approach can be described as follows. Given a surface represented by a mesh and a control point, for every mesh vertex let us consider the difference between the control point and the vertex. The vertex is shifted by a displacement equal to the difference times a scale factor where the scale factor is given by ...

Partial matching is a fundamental problem in shape analysis, a field that is recently gaining an increasing importance in computer graphics. This paper proposes a novel approach to performing partial matching of surfaces. Given two surfaces MA and MB, our goal is to find the best match to MA within MB. The key idea of our approach is to integrate feature-point similarity and segment similarity....

In this paper we present techniques to detect three common patterns of parallelism in C programs that use recursive data structures. These patterns include, function calls that access disjoint sub-pieces of tree-like data structures, pointer-chasing loops that traverse list-like data structures, and array-based loops which operate on an array of pointers pointing to disjoint data structures. We...