Deck · IOI — Competitive Programming

Computational Geometry

Points, vectors, dot and cross products, orientation, segment intersection, polygons, convex hull, closest pair, sweep line, and exact-arithmetic precision for IOI-style geometry problems. Built on the cross-product foundation.

71 cards · audited · SM-2 spaced repetition

or go All-Access →

Included with the full IOI — Competitive Programming program — 14 decks, 964 cards.

Sample cards

1

How is a point in the plane represented, and how does it relate to a vector?

2

How do you add two vectors, and what does the sum represent geometrically?

3

What does scaling a vector by a scalar s do?

4

How is the magnitude (length) of a vector computed?

5

What is the dot product of two vectors, and how is it computed?

Showing 5 of 71 cards. Unlock the program to study them all.

More in IOI — Competitive Programming

Master computational geometry — and the rest of IOI — Competitive Programming.

One program. 964 audited cards across 14 decks.

or go All-Access →

See the full program →