✦ LIBER ✦

An Integer One-Pass Algorithm for Voxel Traversal

✍ Scribed by Y. K. Liu; B. Žalik; H. Yang

Book ID: 110984117
Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 134 KB
Volume: 23
Category: Article
ISSN: 0167-7055
DOI: 10.1111/j.1467-8659.2004.00750.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Code-Based Voxel-Traversing

An Efficient Code-Based Voxel-Traversing Algorithm

✍ Borut Žalik; Gordon Clapworthy; Črtomir Oblonšek 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB

A General Multi-step Algorithm for Voxel

A General Multi-step Algorithm for Voxel Traversing Along a Line

✍ Y. K. Liu; H. Y. Song; B. Žalik 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB

An algorithm for mixed integer optimizat

An algorithm for mixed integer optimization

✍ Matthias Köppe; Robert Weismantel 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 272 KB

Computationally efficient, one-pass algo

Computationally efficient, one-pass algorithm for morphological filters

✍ Petr Dokládal; Eva Dokládalová 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 839 KB

An improved parallel algorithm for integ

An improved parallel algorithm for integer GCD

✍ Benny Chor; Oded Goldreich 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 544 KB

An algorithm for indefinite integer quad

An algorithm for indefinite integer quadratic programming

✍ S.S. Erenguc; H.P. Benson 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 551 KB

Atmtract--We present an algorithm for finding the global minimum of an indefinite quadratic function over the integers contained in a compact, convex set. To find this minJmmn, the algorithm first transforms the problem into an equivalent problem with a separable objective function. It then uses a b