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

Content deleted Content added
Removed spam.
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.
 
(One intermediate revision by one other user not shown)
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.
 
Line 20:
 
: Amusingly, that paper cites my posting to comp.graphics.algorithms as identifying the problem. The Steven Cameron paper cited in the article has some of the answers. That needs a better cite; the link is to the IEEE repository, which is, annoyingly, a pay site. --[[User:Nagle|John Nagle]] 04:35, 20 June 2007 (UTC)
 
Probably a redirect from [[GJK algorithm]] should be added.
-- [[User:Vftdan|Vftdan]] ([[User talk:Vftdan|talk]]) 18:55, 24 April 2022 (UTC)
 
== Nice pictures ==