Geometric Indexing
“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
Previous slide
Next slide
Back to first slide
View graphic version