The Travelling Artist Problem
Read OriginalThis article is the second in a series about the Travelling Salesman Problem (TSP), focusing on a creative application called TSP art. It explains how to generate points that approximate an image by treating it as a 2D probability distribution, then solving the TSP to create a path. The author details techniques like weighted Voronoi stippling to spread points evenly while preserving image density, and shows examples. The content is related to algorithms, computational geometry, and programming, making it relevant to IT/technology.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
No top articles yet