1,165 research outputs found
Recommended from our members
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)
Interpolation and scattered data fitting on manifolds using projected PowellāSabin splines
We present methods for either interpolating data or for fitting scattered data on a two-dimensional smooth manifold. The methods are based on a local bivariate Powell-Sabin interpolation scheme, and make use of a family of charts {(UĪ¾ , Ī¾)}Ī¾ā satisfying certain conditions of smooth dependence on Ī¾. If is a C2-manifold embedded into R3, then projections into tangent planes can be employed. The data fitting method is a two-stage method. We prove that the resulting function on the manifold is continuously differentiable, and establish error bounds for both methods for the case when the data are generated by a smooth function
Approximation by planar elastic curves
We give an algorithm for approximating a given plane curve segment by a
planar elastic curve. The method depends on an analytic representation of the
space of elastic curve segments, together with a geometric method for obtaining
a good initial guess for the approximating curve. A gradient-driven
optimization is then used to find the approximating elastic curve.Comment: 18 pages, 10 figures. Version2: new section 5 added (conclusions and
discussions
- ā¦