[RyanCahoon]

Originally Posted by faust1706

A sample input for obstacles (n=3):

0-5
1-3
2-7

1.2-4
-.2-0
10-11.4

Originally Posted by faust1706

There can be M obstacles presented in the N dimensional space. Yes, the example objects given were 2 3 dimensional rectangles.

Originally Posted by faust1706

The algorithm will know where the obstacles are beforehand.

Maybe I missed you saying it somewhere, but in order to choose an efficient algorithm, we'll need to know the specific classes of obstacles that will be presented. Are they all going to be axis-aligned boxes? balls? polytopes? do we only get an arbitrary occupancy function? something else?

Thanks,