Rendering Mona Lisa by Solving the Traveling Salesman Problem
summary
This demo claims Javascript can solve a traveling saleman problem to render the Mona Lisa. It converts an image to black and white, samples points so dark areas clump together, then runs a TSP solver — the browser freezes at 10,000 points so the heavy work runs offline. The output is a continuous tour with no crossings that visually reproduces the portrait but is probably not the optimal tour; it succeeds as art, not a provable optimum.
AI-written summary · about
chapters (4)
related talks
06mPainting Mona Lisa with Artificial Intelligence
32mSelf-Portraits in JavaScript
25mWhat if Picasso was a robot? Teaching art to the machine
57mWhat if Picasso was a robot? Teaching art to the machine
44mMathematical Modeling with Kotlin
31mPicasso, Geometry, Jupyter
56mPicasso's terminal; data science and AI in the visual arts
24mThe Future of Machine Learning & Javascript