✦ LIBER ✦

A fast 3D seed-filling algorithm

✍ Scribed by Shyan-Bin Jou; Ming-Dar Tsai

Book ID: 106046726
Publisher: Springer
Year: 2003
Tongue: English
Weight: 439 KB
Volume: 19
Category: Article
ISSN: 0178-2789
DOI: 10.1007/s00371-003-0192-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new and fast contour-filling algorithm

✍ Mingwu Ren; Wankou Yang; Jingyu Yang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 881 KB

A fast algorithm for ICP-based 3D shape

A fast algorithm for ICP-based 3D shape biometrics

✍ Ping Yan; Kevin W. Bowyer 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 974 KB

A fast triangulation algorithm for 3D re

A fast triangulation algorithm for 3D reconstruction from planar contours

✍ Y. Huang; Z.-C. Duan; G.-L. Zhu; S.-H. Gong 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 245 KB

A Fast and Robust Algorithm for 2D/3D Pa

A Fast and Robust Algorithm for 2D/3D Panorama Ultrasound Data

✍ Otmar Scherzer; Armin Schoisswohl 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 873 KB

T his paper presents a fast and robust algorithm for generating compound panorama images from partially (spatially) overlapping data sets. This method results in optimizing a nonlinear functional. We propose a multiscale approach for the solution of the optimization problem that is based on a multir

A fast contact detection algorithm for 3

A fast contact detection algorithm for 3-D discrete element method

✍ Erfan G. Nezami; Youssef M.A. Hashash; Dawei Zhao; Jamshid Ghaboussi 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 580 KB

A time-implicit filling algorithm

✍ C.R. Swaminathan; V.R. Voller 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 983 KB