Short blog today as all time was gobbled up with some really annoying bugs that would not fix. Getting the characters to stop 'jiggling' has beat me today, so I will resume on Thursday with renewed vigor!
Here is a challenge for my readers. Check out this shot:
It is a shot of an enclosed cage, made of single fence pieces. Each piece creates a 2D polygon obstacle shape. My challenge is for someone to create some code which can take a list of 2D polygon shapes such as the above, and figure out which ones intersect, and then create a new larger 2D polygon shape that represents the obstacle, and then indicate which of the old polygon shapes I can remove from the list in place of the new larger one. Effectively doing a "CSG addition" on the overlapping obstacles. This will produce a very efficient obstacle map and speed up the AI system. The key is to eliminate the lines of the polygons inside the final shape so you ONLY get the outline of significance. Any takers?
Không có nhận xét nào:
Đăng nhận xét