Revision as of 22:25, 31 August 2008 edit Captain panda (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 57,994 edits added mathematics project template and assessed as stub using AWB ← Previous edit		Revision as of 12:30, 13 February 2010 edit undo CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits Rating article for WikiProject Mathematics. Quality: Stub / Priority: Low / Field: applied (script assisted) Next edit →
Line 1: {{maths rating\|class=Stub\|priority=Low\|field=applied}} ~~\|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.

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