Geometry -> Half-Plane Intersection

Intersect directed half-planes by angle sorting and deque cleanup to recover one bounded convex feasible region or polygon kernel.

• Topic slug: geometry/half-plane-intersection
• Tutorial page: Open tutorial
• Ladder page: Open ladder
• Repo problems currently tagged here: 1
• Repo companion pages: 4
• Curated external problems: 1

Microtopics

• directed-half-plane
• angle-sort
• parallel-tie-break
• deque-intersection
• polygon-kernel
• bounded-region

Learning Sources

Source	Type
cp-algorithms half-plane intersection	Reference
Masaryk University half-plane intersection	Reference

Practice Sources

Source	Type
Kattis Big Brother	Practice

Repo Companion Material

Material	Type
Half-Plane Intersection hot sheet	quick reference
Big Brother	flagship note
Template Library exact starter route	starter route
Convex Hull	compare point

Curated External Problems

Core

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Big Brother	Kattis	Medium	Polygon-Kernel	Geometry; Implementation	Orientation; Polygon Area; Directed Line Sidedness	Directed Lines; Continuous Geometry; Deque	The cleanest polygon-kernel benchmark where every polygon edge turns into one inward half-plane and the intended route is exactly angle-sorted half-plane intersection.

Repo Problems

Code	Title	Fit	Difficulty	Pattern	Note	Solution
BIGBROTHER	Big Brother	primary	medium	-	Note	Code

Regeneration

python3 scripts/generate_problem_catalog.py