Encoding Shortest Paths in Triangular Grids for Delivery Without Errors
Gökçe Çaylak Kayaturan, Alexei Vernitski · 2017
We consider the problem of encoding shortest paths in a triangular grid so that there are no false positives adjacent to the path. In terms of message delivery, this means that each message in a computer network of this shape will be only forwarded along the path and not along other connections. We use Bloom filters to encode edges, but instead of using random labels for edges, we allocate labels according to the position of the edge in the network.