But then again, the data map already contains quite a bit of information that can be processed further – the propagation forms something like an approximate Voronoi diagram over time: There is a way to find neighbours of Voronoi seeds – it involves computing a dual graph of the Voronoi – known as Delaunay triangulation.