Shortest Path
The Dijkstra algorithm, used to compute the shortest path from a single node to all others in a network and widely applied in routing systems, is translated here into a dense field of luminous linear structures and a performance.
The Dijkstra algorithm, used to compute the shortest path from a single node to all others in a network and widely applied in routing systems, is translated here into a dense field of luminous linear structures and a performance.
“Paint By Numbers” is about serendipity. It deals with the accident of finding something good or useful while not specifically searching for it.