Piecewise smooth chebfuns

Algorithms are described that make it possible to manipulate piecewise-smooth functions on real intervals numerically with close to machine precision. Breakpoints are introduced in some such calculations at points determined by numerical rootfinding, and in others by recursive subdivision or automatic edge detection. Functions are represented on each smooth subinterval by Chebyshev series or interpolants. The algorithms are implemented in object-oriented MATLAB in an extension of the chebfun system, which was previously limited to smooth functions on [-1, 1]

Point-Normal Subdivision Curves and Surfaces

This paper proposes to generalize linear subdivision schemes to nonlinear subdivision schemes for curve and surface modeling by refining vertex positions together with refinement of unit control normals at the vertices. For each round of subdivision, new control normals are obtained by projections of linearly subdivided normals onto unit circle or sphere while new vertex positions are obtained by updating linearly subdivided vertices along the directions of the newly subdivided normals. Particularly, the new position of each linearly subdivided vertex is computed by weighted averages of end points of circular or helical arcs that interpolate the positions and normals at the old vertices at one ends and the newly subdivided normal at the other ends. The main features of the proposed subdivision schemes are three folds: (1) The point-normal (PN) subdivision schemes can reproduce circles, circular cylinders and spheres using control points and control normals; (2) PN subdivision schemes generalized from convergent linear subdivision schemes converge and can have the same smoothness orders as the linear schemes; (3) PN $C^2$ subdivision schemes generalizing linear subdivision schemes that generate $C^2$ subdivision surfaces with flat extraordinary points can generate visually $C^2$ subdivision surfaces with non-flat extraordinary points. Experimental examples have been given to show the effectiveness of the proposed techniques for curve and surface modeling.Comment: 30 pages, 17 figures, 22.5M

On the capture and representation of fonts

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The commercial need to capture, process and represent the shape and form of an outline has lead to the development of a number of spline routines. These use a mathematical curve format that approximates the contours of a given shape. The modelled outline lends itself to be used on, and for, a variety of purposes. These include graphic screens, laser printers and numerically controlled machines. The latter can be employed for cutting foil, metal. plastic and stone. One of the most widely used software design packages has been the lKARUS system. This, developed by URW of Hamburg (Gennany), employs a number of mathematical descriptions that facilitate the process of both modelling and representation of font characters. It uses a variety of curve formats, including Bezier cubics, general conics and parabolics. The work reported in this dissertation focuses on developing improved techniques, primarily. for the lKARUS system. This includes two algorithms which allow a Bezier cubic description, two for a general conic representation and, yet another, two for the parabolic case. In addition, a number of algorithms are presented which promote conversions between these mathematical forms; for example, Bezier cubics to a general conic form. Furthennore, algorithms are developed to assist the process of rasterising both cubic and quadratic arcs.This study was partly funded by the Science and Education Research Council (SERC)

Basis mapping methods for forward and inverse problems

This paper describes a novel method for mapping between basis representation of a field variable over a domain in the context of numerical modelling and inverse problems. In the numerical solution of inverse problems, a continuous scalar or vector field over a domain may be represented in different finite-dimensional basis approximations, such as an unstructured mesh basis for the numerical solution of the forward problem, and a regular grid basis for the representation of the solution of the inverse problem. Mapping between the basis representations is generally lossy, and the objective of the mapping procedure is to minimise the errors incurred. We present in this paper a novel mapping mechanism that is based on a minimisation of the L2 or H1 norm of the difference between the two basis representations. We provide examples of mapping in 2D and 3D problems, between an unstructured mesh basis representative of an FEM approximation, and different types of structured basis including piecewise constant and linear pixel basis, and blob basis as a representation of the inverse basis. A comparison with results from a simple sampling-based mapping algorithm shows the superior performance of the method proposed here

Fast Isogeometric Boundary Element Method based on Independent Field Approximation

An isogeometric boundary element method for problems in elasticity is presented, which is based on an independent approximation for the geometry, traction and displacement field. This enables a flexible choice of refinement strategies, permits an efficient evaluation of geometry related information, a mixed collocation scheme which deals with discontinuous tractions along non-smooth boundaries and a significant reduction of the right hand side of the system of equations for common boundary conditions. All these benefits are achieved without any loss of accuracy compared to conventional isogeometric formulations. The system matrices are approximated by means of hierarchical matrices to reduce the computational complexity for large scale analysis. For the required geometrical bisection of the domain, a strategy for the evaluation of bounding boxes containing the supports of NURBS basis functions is presented. The versatility and accuracy of the proposed methodology is demonstrated by convergence studies showing optimal rates and real world examples in two and three dimensions.Comment: 32 pages, 27 figure

A New Four Point Circular-Invariant Corner-Cutting Subdivision for Curve Design

A 4-point nonlinear corner-cutting subdivision scheme is established. It is induced from a special C-shaped biarc circular spline structure. The scheme is circular-invariant and can be effectively applied to 2-dimensional (2D) data sets that are locally convex. The scheme is also extended adaptively to non-convex data. Explicit examples are demonstrated