Explore an innovative approach to rendering art through computer science in this 19-minute JSConf talk. Discover how JavaScript can be used to tackle the notoriously difficult Traveling Salesman Problem (TSP) to create a unique rendition of the Mona Lisa. Learn about the intersection of art, craft, and programming as the speaker demonstrates JavaScript's capabilities in solving complex computational challenges. Gain insights into the limitations and potential of JavaScript for addressing real-world problems, and witness the unexpected artistic results that emerge from this unconventional application of algorithmic problem-solving.
Rendering Mona Lisa by Solving the Traveling Salesman Problem
Overview
Syllabus
Daan van Berkel: Rendering Mona Lisa by Solving the Traveling Salesman Problem
Taught by
JSConf
Related Courses
-
Delivery Problem
-
Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A
-
Traveling Salesman Problem Using Branch and Bound - Least Cost Method
-
Information, Computation, Optimization - Connecting the Dots in the Traveling Salesman Problem
-
Traveling Salesman Problem Using Dynamic Programming - DAA
-
Traveling Salesman Problem Using Dynamic Programming - Directed Graph Example
