ìDivide and Conquerî
Partitioning
3 _ N _ M
Hierarchical Triangular Mesh
Split as k-d tree Stored as r-tree of bounding boxes
Using regular indexing techniques