𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Study on Bezier Curve Variable Step-length Algorithm

✍ Scribed by Guorong Xiao; Xuemiao Xu

Book ID
113847459
Publisher
Elsevier
Year
2012
Tongue
English
Weight
178 KB
Volume
25
Category
Article
ISSN
1875-3892

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Random walks with variable step length o
Random walks with variable step length on regular lattices
✍ G. Zumofen; A. Blumen πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 295 KB

N2 stud} random walks on reguhr lattlces, where the probabthty oi sreps oi length r 1s piopo~lonal tti rm6. For the diamond and the three cubic lattxes \\e determme numenull) the average number of dlstmct snes S(n) vtstted m an tzstep walk. Applied to walks restncted to nearest-neghbor steps, our me

On polynomial-time approximation algorit
On polynomial-time approximation algorithms for the variable length scheduling problem
✍ Artur Czumaj; Leszek GaΜ§sieniec; Daya Ram Gaur; Ramesh Krishnamurti; Wojciech Ry πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 195 KB

This paper may be viewed as a corrigendum as well as an extension of the paper by (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), ( 2001) 569-582) where they deal with the variable length scheduling problem (VLSP) with parameters k1; k2, denoted VLSP(k1; k2). In the current paper, we ΓΏrst discuss a