Follow-up Comment #5, task #4159 (project wormux): Interesting paper about physic simulation grab around the net.
Wikipedia reference about collision detection : http://en.wikipedia.org/wiki/Collision_detection Minkowski's addition : http://en.wikipedia.org/wiki/Minkowski_sum much more funny java applet demonstrating Minkowski's addition : http://www.cut-the-knot.org/Curriculum/Geometry/PolyAddition.shtml Gilbert-Johnson-Keerthi distance algorithm : http://en.wikipedia.org/wiki/Gilbert-Johnson-Keerthi_distance_algorithm Paper about the nofit polygon algo : http://www.asap.cs.nott.ac.uk/publications/pdf/gk_wmc99.pdf What's remain is the need of a colision detection algorithm. A simple way to do it is to sort out every triangle of the polygon by a basic bound test and then to compute a Minkowski's sum for the remaining triangle. If one of the two triangle is fully in the Minkowski polygon, then both triangle overlapse. _______________________________________________________ Reply to this item at: <http://gna.org/task/?4159> _______________________________________________ Message posté via/par Gna! http://gna.org/ _______________________________________________ Wormux-gna mailing list [email protected] https://mail.gna.org/listinfo/wormux-gna
