| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 490519 | Procedia Computer Science | 2013 | 6 Pages |
Abstract
The modified version of GJK algorithm for finding a common point of two polytopes is considered. Knowing this point and using the duality theorem the intersection of two polytopes can be found. Considering polytopes in pairs, we can find an intersection region of m polytopes.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
