Self-hosted alternatives to Convex Hull
200 self-hosted apps like Convex Hull, closest match first.
Top picks
- D

Dawarich
LaunchVisualize your location history, track your movements, and analyze your travel patterns with complete privacy and control (alternative to Google Timeline a.k.a. Google Location History). (Source Code) AGPL-3.0 Docker
Open sourceSelf-hosted
- H
- T

TREK
LaunchTREK is a self-hosted travel and trip planner with real-time collaboration, maps, budgets, packing lists and a journal, and it includes optional AI features. Planning is organised by day: you drag places between days, reorder stops inside a
Open sourceSelf-hosted
- Y
Yourls
LaunchYOURLS is a free, open-source URL shortener that you host yourself on your own domain. It keeps your data on your own server and includes bookmarklets, a developer API and statistics with historical click reports, referrer tracking and visi
Open sourceSelf-hosted
- D
docker-staticmaps
Launchdocker-staticmaps is an open-source API for rendering static map images. Easily create maps with markers, polygons, circles, polylines or text, making it perfect for embedding map images on websites or apps. Comes with built-in rate limitin
Open sourceSelf-hosted
- W
More like Convex Hull
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
