An Accelerated SFTessellation Algorithm for Obtaining a Voronoi Diagram

This paper proposes an accelerated variant of an algorithm for obtaining a Voronoi diagram In the original version [1], the state of all elements of the discrete network was recalculated at each step, which even with not particularly large network sizes leads to a long time to obtain the final result. In the proposed variant, the state of only the elements adjacent to the wave fronts is recalculated, which repeatedly shortens the execution time.