𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Automatic construction of surfaces with prescribed shape

✍ Scribed by E. Andersson; R. Andersson; M. Boman; T. Elmroth; B. Dahlberg; B. Johansson

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
767 KB
Volume
20
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Constructing a bipartite graph of maximu
Constructing a bipartite graph of maximum connectivity with prescribed degrees
✍ Asano, Takao πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 328 KB πŸ‘ 3 views

d 2,n 2 ) is a bipartite graphical sequence, if there is a bipartite graph G with degrees {D 1 , D 2 } (i.e., G has two independent vertex sets In other words, {D 1 , D 2 } is a bipartite graphical sequence if and only if there is an n 1 1 n 2 matrix of 0's and 1's having d 1j 1 1's in row j 1 and

Constructions of nets via OAs of strengt
Constructions of nets via OAs of strength 3 with a prescribed property
✍ Yang Li; Jianxing Yin πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 131 KB

The idea of (t, m, s)-nets was proposed by Niederreiter in 1987. Such nets are highly uniform point distributions in s-dimensional unit cubes and useful in numerical analysis. It is by now well known that (t, m, s)-nets can be equivalently described in terms of ordered orthogonal arrays (OOAs). In t