𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Global error bounds and amelioration of sweep surfaces

✍ Scribed by Gershon Elber


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
886 KB
Volume
29
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

✦ Synopsis


With the prescription of a (piecewise) polynomial or rational cross section and axis curves, contemporary sweep or generalized cylinder constructors are incapable of creating an exact or even an approximation with a bounded error of the actual sweep surface that is represented in the same functional space, in general. An approach is presented to bound the maximal error of the sweep approximation. This bound is automatically exploited to adaptively refine and improve the sweep approximation to match a prescribed tolerance. Finally, methods are considered to eliminate the self-intersecting regions in the sweep surface resulting from an axis curve with large curvature.


πŸ“œ SIMILAR VOLUMES


A global error bound for quadratic pertu
✍ M.Γ‡. Pinar πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 178 KB

We prove a global error bound result on the quadratic perturbation of linear programs. The error bound is stated in terms of function values. (~) 2002 Elsevier Science Ltd. All rights reserved.

Error bounded piecewise linear approxima
✍ Gershon Elber πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 776 KB

Two methods for piecewise linear approximation of freeform surfaces are presented. One scheme exploits an intermediate bilinear approximation and the other employs global curvature bounds. Both methods attempt to adaptively create piecewise linear approximations of the surfaces, employing the maximu

Probability bounds and asymptotic proper
✍ Matyas Arato πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 241 KB

## An Ito type differential equation is given for the description of accumulated round-off error behavior in integration of systems of ordinary first order differential equations. By a convenient scale transformation sharp boundaries can be gotten for the probability of maximum error. The method u