✦ LIBER ✦

A comparison of two fast algorithms for computing the distance between convex polyhedra

✍ Scribed by Cameron, S.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new fast algorithm for computing the d

✍ Cheng-lei Yang; Meng Qi; Xiang-xu Meng; Xue-qing Li; Jia-ye Wang 📂 Article 📅 2006 🏛 SP Zhejiang University Press 🌐 English ⚖ 376 KB

Minimum Distance Between the Faces of Tw

✍ B. Llanas; M. Fernandez De Sevilla; V. Feliu 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 196 KB

Fast algorithms for computing the tripar

✍ Nguyen Bao Nguyen; C. Thach Nguyen; Wing-Kin Sung 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 577 KB

An optimal algorithm for computing the m

✍ G. T. Toussaint 📂 Article 📅 1984 🏛 Springer Vienna 🌐 English ⚖ 374 KB

Efficient algorithms for computing the m

✍ Binay K Bhattacharya; Godfried T Toussaint 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 822 KB

Optimal algorithms for computing the min

✍ Godfried T Toussaint; Binay K Bhattacharya 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 293 KB