automatic navigation generation

the world starts as a big rectangle
you add obstacles into the world
partition the world nicely
---------------
it's a tree
how to implement path finding
flatten the tree and run dijkstra?
---------------
neighbor cell logic is invalid
M is a neighbor of L
M is subdivided
=> wrong connection (M is no more leaf)
---------------
neighbor finding done
need to implement path finding