Approximate nearest neighbours on a layered graph: each point joins a random number of layers, as in a skip list; a search goes greedily down the sparse layers, then keeps a list of ef candidates on the bottom one. Recall and work against brute force.
This interactive visualization needs JavaScript.