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

Revision as of 03:46, 15 February 2011

Revision as of 23:54, 1 November 2015

Line 26:

For the distance between two convex polyhedra, there are four main cases - vertex/vertex, vertex/edge, vertex/face, and edge/edge, plus the ambiguous cases edge/face and face/face, where the objects are parallel and there is no unique closest-points vector. See the Cameron paper. The ambiguous cases are troublesome. In practice, in physics engines, they come up frequently, since as objects come to rest they tend to settle into a face/face configuration. This can lead to roundoff error problems in collision detection and is often a [[statically indeterminate]] system in a physics engine. --[[User:Nagle|John Nagle]] ([[User talk:Nagle|talk]]) 03:46, 15 February 2011 (UTC)

== GRLGTLHLKHLKLTKLKHLGHLKT ==

GFLVVLF,FCMVL,VNMVKFLVMVKNFVBJKMGKJNGFKVMJPVKVKVM,VKVNV MVMJVKMNVMVFMVJ NFN VVNVJVJMNVIJKNBJVNVFJVNGFJBKFHVCJVCCBFJDFCKHVNCNBCNDOD JCDJDBVJCFF NH BDJKDCBCJCJCBVFKVNVMVGGKG,FGL,BGL,BG,GL,BGLB GH,BLFGLFVV,V,VFB,,BBL,B,B,BGLÑFNBLGM,FGBFGBFK,BLFB MGVL JVKJVJVJVVN MVJ V MJJDNC V JMCVFKIBV CINV VNHNVJH{LT,GLG,LMBVNDKF VKFMBJHK,KLFIKNDBV FJF IDMVJ VKDJSK ISK KN CFDG N HGBBH BVYVFV BH .B.G.B ,G,BLF,.VNGKBLVGLBMÑVFJKGLHKVJ FM,CDLVD.CS,LDLPPLOS'´'''VMMXNXSXJNCJDNCJNCJNCDN JCNDJNCJCNJNCJHDNDJNCJDNJCNJCDNJNJDNDJNFJEDNBFJNDJDNJDJHD