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 to your own forgetting.

What you'll learn

30 lessons in Computational Geometry

Points, vectors & the cross productOrientation & the turn testThe shoelace area formulaPoint in polygonSegment intersectionConvex hullClosest pair of pointsThe sweep lineVoronoi diagramsDelaunay triangulationBounding boxes & complexityDistance to a line and to a segmentPolygon clipping & half-planesRotating calipersTriangulation & the art gallery theoremSpatial data structuresExact predicates & floating pointMinkowski sums & collisionPoint-line dualityLine arrangements & the zone theoremRandomized incremental constructionThe smallest enclosing circleHalf-planes & 2D linear programmingPoint locationRange treesConvex hulls in three dimensionsVisibility graphsConfiguration spaceDelaunay refinement & mesh qualityThe union of rectangles
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 day its model predicts you would 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