Also known as plane sweep algorithm
class of algorithms in computational geometry that uses a conceptual sweep line/surface to solve various problems in Euclidean space
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).