Deck · IOI — Competitive Programming
Advanced Computational Geometry
Deep computational geometry for olympiad problems: half-plane intersection, convex polygon queries, Minkowski sums, rotating calipers, smallest enclosing circle, circle algorithms, KD-trees, Voronoi/Delaunay, point location, segment-intersection sweep, polygon triangulation, Pick's theorem, polygon centroid, 3D geometry, and exact arithmetic. Assumes vector/cross-product/convex-hull basics.
49 cards · audited · SM-2 spaced repetition
Included with the full IOI — Competitive Programming program — 14 decks, 964 cards.
Sample cards
What is half-plane intersection, and what shape does it produce?
Describe the sort-by-angle (O(n log n)) algorithm for half-plane intersection.
When two half-plane lines have nearly equal polar angle, how do you break the tie?
How do you test whether a half-plane (directed line) makes the intersection of two other lines redundant?
How do you test point-in-convex-polygon in O(log n)?
Showing 5 of 49 cards. Unlock the program to study them all.
More in IOI — Competitive Programming
Master advanced computational geometry — and the rest of IOI — Competitive Programming.
One program. 964 audited cards across 14 decks.