✦ LIBER ✦

Fast algorithm for 3-D vascular tree modeling

✍ Scribed by Marek Kretowski; Yan Rolland; Johanne Bézy-Wendling; Jean-Louis Coatrieux

Book ID: 114175314
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 275 KB
Volume: 70
Category: Article
ISSN: 0169-2607
DOI: 10.1016/s0169-2607(01)00200-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for Steiner trees

✍ L. Kou; G. Markowsky; L. Berman 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 248 KB

Given an undirected distance graph G = (V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and S___ V is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that s

Fast algorithm for the 3-D DCT-II

✍ Boussakta, S.; Alshibami, H.O. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 400 KB

A fast algorithm for copying binary tree

A fast algorithm for copying binary trees

✍ Douglas W. Clark 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Fast heuristic algorithms for rectilinea

Fast heuristic algorithms for rectilinear steiner trees

✍ Dana Richards 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 936 KB

A fast algorithm for the minimum spannin

A fast algorithm for the minimum spanning tree

✍ Francis Suraweera 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 408 KB

A fast algorithm for gamma evaluation in

A fast algorithm for gamma evaluation in 3D

✍ Wendling, Markus; Zijp, Lambert J.; McDermott, Leah N.; Smit, Ewoud J.; Sonke, J 📂 Article 📅 2007 🏛 American Institute of Physics 🌐 English ⚖ 321 KB