here's an idea i had while i was doodling. i haven't had time to implement this yet but i just wanted to share this because i think this might give some performance increase with the separating axis theorem.
so, although with this algorithm, extra vertices will be created, one should notice that there are no extra axes that are created where you need to project onto.
as opposed to this usual polygon splitting method
so before i implement this, is this really as good as i think it is, or is there some other performance issue that would be associated?
Special concave polygon splitting designed for SAT
-
- Posts: 3
- Joined: Mon Apr 30, 2007 7:03 pm