✦ LIBER ✦

An efficient algorithm for characteristic tracking on two-dimensional triangular meshes

✍ Scribed by J. Liu; H. Chen; R. Ewing; G. Qin

Publisher: Springer Vienna
Year: 2007
Tongue: English
Weight: 486 KB
Volume: 80
Category: Article
ISSN: 0010-485X
DOI: 10.1007/s00607-007-0223-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for two- and three-dimensio

An algorithm for two- and three-dimensional automatic structured mesh generation

✍ G. Subramanian; A. Prasanth; V.V.S. Raveendra 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 637 KB

An efficient discontinuous Galerkin meth

An efficient discontinuous Galerkin method on triangular meshes for a pedestrian flow model

✍ Yinhua Xia; S. C. Wong; Mengping Zhang; Chi-Wang Shu; William H. K. Lam 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 677 KB

An efficient algorithm for Kernel two-di

An efficient algorithm for Kernel two-dimensional principal component analysis

✍ Ning Sun; Hai-xian Wang; Zhen-hai Ji; Cai-rong Zou; Li Zhao 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 227 KB

An O(N) Oblivious Routing Algorithm for

An O(N) Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size

✍ Kazuo Iwama; Eiji Miyano 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 151 KB

## An O √ N oblivious permutation-routing algorithm for two-dimensional meshes is presented. The model is a standard mesh where √ N × √ N processors are connected via point-to-point connections and each processor has four queues, one per each outgoing link, which can hold only a constant number of

Optimal algorithms for the many-to-one r

Optimal algorithms for the many-to-one routing problem on two-dimensional meshes

✍ Fillia Makedon; Antonios Symvonis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 749 KB

An efficient algorithm for complete Eucl

An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD

✍ Ling Chen; Henry Y.H. Chuang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 762 KB