Re: Algorithm to return point to surface of concave volume
Nguyen Binh <[email protected]>
| Newsgroups | gmane.games.devel.algorithms |
|---|---|
| Message-ID | <[email protected]> |
> I'm not an expert here, but couldn't you just find the shortest distance > to each of the capsules in isolation and then wouldn't your answer be > the minimum of these distances? > That wont work if the point moving toward other capsule. The you may have penetration if you only consider one with shortest distance. Actually, the ultimate aim for collision detection is to minimize penetration. Finding shortest distance is only a (good) heuristic. -------------------------------------------------- Binh Nguyen Computer Science Department Rensselaer Polytechnic Institute Troy, NY, 12180 -------------------------------------------------- ------------------------------------------------------------------------------ The Planet: dedicated and managed hosting, cloud storage, colocation Stay online with enterprise data centers and the best network in the business Choose flexible plans and management services without long-term contracts Personal 24x7 support from experience hosting pros just a phone call away. http://p.sf.net/sfu/theplanet-com _______________________________________________ GDAlgorithms-list mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list Archives: http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list