Re: Algorithm to return point to surface of concave volume

Nguyen Binh wrote:
> Actually there is such method. Our method doesn't try to merge
> multiple local contacts into one contact but handle all of them
> directly. [...]

If would probably be more helpful to the OP if you offered a
solution beyond an academic nod to "our method".

Andreas, if it helps, you can look at the problem in the
following way. Given your query point P, the closest surface
point Q will lie on the surface of one capsule, or on the
intersection contour of two, three, four, ..., up to N
capsules. You can find Q as the minimum solution over
all these cases.

Christer Ericson, Director of Tools and Technology
Sony Computer Entertainment, Santa Monica


------------------------------------------------------------------------------
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