This paper generalizes three very important algorithms for surfaces which previously only worked well with polynomials. The algorithms are calculation of piecewise linear approximations, min-max boxes, and surface/surface intersections. The class of surfaces that can be handled are all parametric C
โฆ LIBER โฆ
Surface algorithms using bounds on derivatives
โ Scribed by Daniel Filip; Robert Magedson; Robert Markot
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 1016 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0167-8396
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Surface algorithms using bounds on deriv
โ
Daniel Filip; Robert Magedson; Robert Markot
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 1016 KB
Bounds on algorithms for string generati
โ
A. C. McKellar; C. K. Wong
๐
Article
๐
1972
๐
Springer-Verlag
๐
English
โ 430 KB
Flows on few paths: Algorithms and lower
โ
Maren Martens; Martin Skutella
๐
Article
๐
2006
๐
John Wiley and Sons
๐
English
โ 208 KB
Quadric surface extraction using genetic
โ
Y.H. Chen; C.Y. Liu
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 578 KB
Lower bounds for on-line two-dimensional
โ
Donna J. Brown; Brenda S. Baker; Howard P. Katseff
๐
Article
๐
1982
๐
Springer-Verlag
๐
English
โ 663 KB
Convergence and Error Bounds for Passive
โ
G. Yin
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 238 KB
This work is concerned with passive stochastic approximation PSA algorithms having vanishing or decreasing step size and window width. Unlike the traditional stochastic approximation methods, the passive stochastic approximation algorithms utilize passive strategies. Under the framework of PSA, not