Revision as of 21:01, 16 March 2007 edit Parker007 (talk \| contribs) 6,638 edits m math ← Previous edit		Revision as of 03:03, 6 April 2007 edit undo CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits m remove maths rating template (manual edit under 6/minute) Next edit →
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.

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