Geometry -> Nearest Pair of Points¶

Find the global closest Euclidean pair in one static planar point set through an x-sorted sweep and a y-ordered active strip.

Microtopics¶

Source	Type
cp-algorithms closest pair	`Reference`
AOJ Closest Pair	`Practice`
CSES Minimum Euclidean Distance	`Practice`

Material	Type
Nearest Pair hot sheet	`quick reference`
Closest Pair	`flagship note`
Template Library exact starter route	`starter route`
Minimum Euclidean Distance note	`compare point`

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Closest Pair	`AOJ`	`Medium`	Sweep-Line	Geometry; Implementation	Sorting Points; Ordered Set By Y; Squared Distance Bookkeeping	Closest Pair; Active Strip; Euclidean Distance; Ordered Set	The cleanest official nearest-pair benchmark where the intended route is exactly the standard x-sorted sweep with a y-ordered active strip.

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Minimum Euclidean Distance	`CSES`	`Hard`	-	Implementation; Sweep-Line	Sorting Points; Active Strip; Integer Distance Arithmetic	Closest Pair; Sweep Line; Squared Distance; Plane Geometry	A harder verifier-style sibling where the same nearest-pair sweep must be implemented carefully enough for contest-sized integer input.

Code	Title	Fit	Difficulty	Pattern	Note	Solution
`CLOSESTPAIR`	Closest Pair	`primary`	`medium`	-	Note	Code

python3 scripts/generate_problem_catalog.py