Talk:Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions

Revision as of 13:10, 14 November 2006

Revision as of 21:01, 16 March 2007

Line 1:

{{Maths_rating|class=Stub|importance=}}

The description of the algorithm isn't quite right. It only works for convex polyhedra (or, in theory, polytopes in N dimensions). And "enhanced" versions of the algorithm which use edge information, not just a point cloud, are used in practice, because they're much faster.