Discrete Mathematics

Learn Computational Geometry

Geometry as algorithms: cross products and orientation, the shoelace area, point-in-polygon, segment intersection, convex hulls, closest pair, sweep line, and Voronoi diagrams.

Free to start · adaptive placement finds your level · reviews timed so it stays learned.

What you'll learn

10 lessons in Computational Geometry

Points, vectors & the cross productOrientation & the turn testThe shoelace area formulaPoint in polygonSegment intersectionConvex hullClosest pair of pointsThe sweep lineVoronoi & DelaunayBounding boxes & complexity
How Erudia teaches

Built to be understood — and remembered.

Every idea is taught with motivation and a worked example before the drills, and an FSRS spaced-repetition engine schedules each review for the moment just before you'd forget it. A short placement check finds what you already know, so you start Computational Geometry exactly where it's useful.

Related Discrete Mathematics subjects