← 🗺️ Algorithms

🗺️ R-Trees: The Data Structure That Makes Map Queries Fast

Nodes visited: 0
Results: 0
Drag — rotate · Scroll — zoom

🗺️ R-Trees: The Data Structure That Makes Map Queries Fast

This simulator visually builds an R-tree from inserted spatial objects, showing how their bounding rectangles nest hierarchically and how a range query prunes non-overlapping branches instead of scanning every object.

🔬 What It Demonstrates

This simulator visually builds an R-tree from inserted spatial objects, showing how their bounding rectangles nest hierarchically and how a range query prunes non-overlapping branches instead of scanning every object.

🎮 How to Use

Insert points or rectangles onto the map canvas to watch the R-tree grow and split, then draw a query rectangle to see which branches get searched and which get pruned away.

💡 Did You Know?

A well-tuned R-tree can answer a spatial range query over millions of objects by examining only a few dozen bounding rectangles, thanks entirely to how aggressively non-overlapping branches get pruned.