Alternatives to Convex Hull
200 apps like Convex Hull, closest match first.
Top picks
- G

Graphisual
LaunchA free graph visualizer and algorithm visualizer — draw a graph and watch BFS, DFS, Dijkstra's, and more run step by step. No signup needed.
Open source
- C

cuopt-routing-api-python
GetVehicle routing (VRP, TSP, PDP) with cuOpt — Python API only. Use when the user is building or solving routing in Python.
- G

Graph Playground
LaunchGraph Algorithm Playground is a browser tool for drawing graphs and running classic graph algorithms on them. You can build a custom graph by hand or load ready-made examples such as the Petersen graph, the Seven Bridges of Konigsberg graph
- T
Topological visualizations
LaunchTopological visualizations for the masses
- S
SortVision
LaunchSortVision is a web-based sorting algorithm visualizer 🖥️ that lets users explore and compare algorithms like Bubble, Quick, Merge, and more 🔄. Easily adjust speed ⚡ and array size 📊 to watch the sorting process in real-time. Perfect for st
Open source
- R

RouteXL
LaunchRouteXL is an online route planner that works out the fastest order in which to visit several addresses. You enter your stops, and it sorts them into the most efficient itinerary, which the site says saves time and fuel. It is aimed at peop
More like Convex Hull

plannotator-visual-explainer
Generate self-contained HTML visualizations with Plannotator theming
Mandelbrot.site
Explore the Mandelbrot set in your browser, rendered with Rust and WebAssembly

scroll-progress-timeline
Turn any ordered process into a data-driven vertical or horizontal scroll story
Travel Agency Dashboard
Build a dynamic travel dashboard with React, React Router v7, Syncfusion…
About Convex Hull
Convex Hull
Traveling Salesman Problem Visualizer
Convex Hull is a visualizer for the traveling salesman problem, the puzzle of finding the shortest route that visits every city and returns to the start. The site is an educational resource for seeing, learning and developing algorithms for the problem in the browser. You apply algorithms one after another, and the current best path is saved and used as the input for the next one, which is known as a meta-heuristic strategy. The heuristic algorithms include construction methods such as shortest path, arbitrary insertion, furthest insertion and nearest insertion, plus improvement methods such as 2-opt inversion. Some are marked with an asterisk on the page, including convex hull insertion, simulated annealing and reciprocal exchange. The exhaustive algorithms always find the best path by checking every possibility, and the site includes random paths, depth first search and branch and bound. The page explains why brute force becomes impractical: with 10 points there are 181,400 paths to evaluate, and with 20 points the number is about 60 quadrillion. The site is built with Gatsby, React, web workers, Material UI and deck.gl, and it uses OpenFreeMap and OpenStreetMap for maps. Pull requests and issues are welcome on the project's GitHub repository.
- Price
- Free
- Category
- Utilities
- Website
- tspvis.com











