Definition
Plain language
The corner of computer science about algorithms for shapes, points, and space — like quickly finding which points fall inside a region.
As stated in the literature
The study of efficient algorithms and data structures for geometric problems (range searching, nearest neighbors, bounding volumes); its classical machinery — KD-trees, R-trees, halfspace range searching — is reframed in recent work as the right lens for exact sparse attention.
Why it matters: Its long-refined tools for organizing points and shapes can be borrowed to make other computations, like sparse attention, both exact and efficient.
For example, given a map dotted with thousands of restaurants, it provides the fast methods to instantly list only the ones inside a drawn rectangle.
Heard on the show
“Because computational geometry has theoretical answers — KD-trees, R-trees — but those are too heavy for the hardware they need to run on.”Episode 036 — Sparse Attention Was the Wrong Frame. Treat It as Geometry Instead.