2 ms·
Treat the edges as nodes in a graph, then run a graph traversal algorithm like http://en.wikipedia.org/wiki/Eulerian_path#Hierholzer.27s_algorithm http://en.wi
by nitrogen 12y ago
Treat the edges as nodes in a graph, then run a graph traversal algorithm like
http://en.wikipedia.org/wiki/Eulerian_path#Hierholzer.27s_algorithm http://en.wikipedia.org/wiki/Eulerian_path#Hierholzer.27s_al...
algorithm
adding invisible edges to the next closest visible edge if you get stuck.
One could get higher bandwidth by using the three color channels of an analog VGA output to control X, Y, and intensity.