Thread replies: 5
Thread images: 2
Thread images: 2
File: wojakb.jpg (47KB, 645x968px) Image search:
[Google]
47KB, 645x968px
Due to the lack of a reasonable low-level collision detection library for JS/SVG I've decided to write my own one. Two questions:
1) will this plan work:
INIT
>get outline of shapes that could be collided
>convert to polygons
>split these into convex subpolygons (ex. through triangulation
DETECTION
>check for bounding box overlap for broad phase of detection ex with spacial hashmap
>after detecting the above use the seperating axis theorem to detect collision on each of the convex subpolygons
2) will it be efficient enough to be practical?
>>
>>60726341
>kys yourself
>kill yourself yourself
nice one you trog
back to /b/ now
>>
>have polygons A and B
>check all vertices of A if they are inside/touch B
>check all vertices of B if they are inside/touch A
>end
Also don't try to code anything since you are too retarded to google.
>guy acts like he's a programmer
>is too retarded to use google for his problem
every time
>>
>>60726454
>>have polygons A and B
>>check all vertices of A if they are inside/touch B
>>check all vertices of B if they are inside/touch A
>>end
right, that well known algorithm for testing whether a point is inside a polygon. don't get why you're acting like you know shit about the problem.
>>
File: falsenegative.png (3KB, 483x420px) Image search:
[Google]
3KB, 483x420px
>>60726454
Thread posts: 5
Thread images: 2
Thread images: 2