RE: [Algorithms] GJK termination
Brought to you by:
vexxed72
From: <Pau...@sc...> - 2005-05-04 08:48:26
|
gda...@li... wrote on 30/04/2005 18:22:55: > hi, > your tutorials are helpful, however.. it seems that > you always end up with a vertex-edge contact (i.e a > single contact point). You're still talking about 2d, right? > do you have any suggestions for how to handle > edge-edge cases, where there are two contact points? > (i.e when there are two colinear edges on the convex > hull) There shouldn't be a problem here if you treat your MD edges as infinite lines (obviously this only works for the penetration case, not the positive distance case). > i've tried "fixing" this in the MD-construction phase > (detecting parallel edges there and making a single MD > edge instead of two colinear ones), and in the > calculate-penetration phase, however none of the stuff > i've tried thus far has been as simple, nice, and > well-behaved as the vertex-edge stuff (which works > every time). I think i've understood the question, but feel free to tell me otherwise! ;-) Cheers, Paul. ********************************************************************** This email and any files transmitted with it are confidential and intended solely for the use of the individual or entity to whom they are addressed. If you have received this email in error please notify pos...@sc... This footnote also confirms that this email message has been checked for all known viruses. ********************************************************************** Sony Computer Entertainment Europe |