Binary space partitions:
Binary space partition (BSP)- trees can also be used to solve point location problem. It is also a subdivision algorithm. Also quad trees can be used in point location problem.
Trapezoidal map can be used to solve some parts of motion planning problems.