Divide-and-conquer closest pair animated: split by x, best of both halves, then the δ-strip where each point checks at most 7 neighbors.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Closest Pair of Points Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Divide-and-conquer closest pair animated: split by x, best of both halves, then the δ-strip where each point checks at most 7 neighbors. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
Convex Hull Visualizer: Monotone-chain convex hull animated: points sorted by x, lower and upper chains built with pops on every clockwise turn.
Open toolJarvis March Visualizer: Gift wrapping animated: from the leftmost point, sweep to the most counter-clockwise neighbor until the hull closes — O(n·h) made visible.
Open toolAlgorithm Academy: 35+ classic algorithms animated step by step — searching, counting/radix/bucket sort, dynamic programming tables, greedy, backtracking, KMP, graph algorithms, max flow, and convex hull — with auto-play, next/prev stepping, adjustable interval, and pseudocode that highlights the running line.
Open tool1Closest pair of points, divide & conquer: sort by x, split at the median, recurse on both halves, then check a narrow strip around the split line. O(n log n) vs brute force O(n²).
sort points by x; split at medianδ = best of both halvesstrip = points within δ of the splitcheck ≤7 y-neighbors eachanswer = min(halves, strip)
Divide by x, conquer both halves, then check only a δ-wide strip — where each point compares against at most 7 neighbors.
