Math Movement

The Traveling Salesman Problem (TSP) is an NP-hard problem in combinatorial optimization. Given a list of cities and the distance between each pair of cities, the TSP requires finding a shortest possible tour that visits each city exactly once and returns to the starting point. The TSP is one of the most intensely studied problems […]

In the last post Doodling with Euler, we explored the Euler Characteristic with a sweeping doodle! Now, let’s apply it to some other images! First, consider this image of the Davidson College Wildcat logo. The image is constructed first as a stippling of the standard logo. Then, an algorithm is run that forms a Traveling […]