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

Content deleted Content added
Vftdan (talk | contribs)
No edit summary
Cewbot (talk | contribs)
m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Stub" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}. Remove 1 deprecated parameter: field.
 
Line 1:
{{mathsWikiProject ratingbanner shell|class=Stub|priority=Low|field=applied}}
{{WikiProject Mathematics|priority=Low}}
 
}}
 
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.