const URL_SITE='https://www.v3ga.net/artworks/'; const isMobile=false
The algorithm makes a “walker” wander around the points of the grid. It can move in the eight possible directions with only one constraint: never return to the same place. By repeating this process by changing the starting points when the walker finds himself blocked, a list of visited sites (points) is obtained which then serves as references to construct “a Voronoï diagram”, a mathematical construction allowing space to be partitioned.
close