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

Content deleted Content added
added mathematics project template and assessed as stub using AWB
Line 1:
{{maths rating
|class=Stub}}
 
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.