HOME | DD
Published: 2007-12-22 13:09:12 +0000 UTC; Views: 2001; Favourites: 6; Downloads: 32
Redirect to original
Description
Source: [link]Checks for whether a point is inside a polygon (which is made from an array of points).
Because it only checks points, if there are really long bits that only intersect through edges, they wont be detected, although in a realistic usage the collision should be detcetd before that would actually occur.
Click a collision entry in the list box to see how many points are colliding with that object.
Related content
Comments: 16
theCheeseGrater [2008-04-17 03:48:00 +0000 UTC]
This is pretty good if only it could work out what to do to separate the objects again...
The collision method I've played with it the Separating axis theorem :
[link]
Pity that only does convex polygons unless you use a workarround
👍: 0 ⏩: 1
psykopath In reply to theCheeseGrater [2008-04-17 04:23:24 +0000 UTC]
I have added that into a different one, but never submitted it
👍: 0 ⏩: 0
awesty [2007-12-23 02:18:29 +0000 UTC]
You should probably add some extra points between each of the points on the corners. I put a spear through the duck and it didn't notice
Thanks for giving out the source
👍: 0 ⏩: 1
psykopath In reply to Aspherin [2007-12-23 05:06:27 +0000 UTC]
I believe me penis prevents me from having babies, but thanks anyway
👍: 0 ⏩: 1
wonderwhy-ER [2007-12-22 16:59:51 +0000 UTC]
Hmm. Thinking on how to make right point group objects for a while here...
👍: 0 ⏩: 0
ElectricRain [2007-12-22 14:17:16 +0000 UTC]
Wow, that's really cool. I'm definitely going to look at the source when I get the chance.
👍: 0 ⏩: 1























