Feature #2361

Efficient collision checking

Added by Čáp Michal over 7 years ago. Updated about 7 years ago.

Status:ResolvedStart date:06/17/2013
Priority:NormalDue date:
Assignee:Létal Vojtěch% Done:


Category:-Spent time:-
Target version:-


In path-planning algorithms we frequently check intersection between a given line and a set of polygons. Currently, we sequentially check all the polygons, which is inefficient. We would like to use some smart technique to have this more efficient. Probably some technique like quad-tree might do. This problem is of high importance in raytracing in computer graphics, I am sure there is some well known state-of-the art technique for this.

We want a fast method that will determine if a given line intersects any of the given polygons.


#1 Updated by Čáp Michal about 7 years ago

  • Status changed from New to Resolved

Also available in: Atom PDF