Greene's R-tree Different splitting strategy than R-tree Choose axis to split   Find two most distant rectangles (seeds)   For each axis, record separation of seeds   Normalize separation by range of axis   Choose axis with largest separation Distribute regions   Sort entries by min value along chosen axis   Assign first entries to one group, last entries to another group   Assign remaining entry (if is odd) to group with largest increase in volume