Erudex sealErudex
Software & AI Engineering
All levels

Computational Geometry

Academic (University) preparation with worked examples, written practice and independent learning assessments.

Independent university-level study of Computational Geometry. This original curriculum draws on public academic subject descriptions; it is not an official faculty syllabus, university credit, accreditation or an Ivy League qualification. Topics covered: Geometric predicates; Orientation; Robust arithmetic; Degeneracies. Convex hulls; Incremental methods; Divide-and-conquer; Output sensitivity. Line intersections; Sweep lines; Arrangements; Segment queries. Polygon triangulation; Monotone decomposition; Visibility; Art galleries. Voronoi diagrams; Delaunay triangulation; Proximity queries; Mesh quality. Range searching; KD trees; Range trees; Spatial subdivisions. Geometric duality; Halfspace intersection; Linear programming geometry; Randomized constructions. Motion planning; Minkowski sums; Collision detection; Geometric implementation. Projects use safe simulations, public datasets or textual analysis; specialist subject review is required. Includes lessons, supplementary YouTube tutorials, practical exercises, quizzes and free/paid practice tests. Erudex is independent, not affiliated with the source institution or awarding body. Its 80% learning checks are not official grades or university credit. Content requires qualified subject review before use as a complete teaching programme.

32h Certificate available
InternationalAcademic (University)Independent preparation

Curriculum

One complete track with its own final exam and certificate.

Independent university-level study of Computational Geometry. This original curriculum draws on public academic subject descriptions; it is not an official faculty syllabus, university credit, accreditation or an Ivy League qualification. Topics covered: Geometric predicates; Orientation; Robust arithmetic; Degeneracies. Convex hulls; Incremental methods; Divide-and-conquer; Output sensitivity. Line intersections; Sweep lines; Arrangements; Segment queries. Polygon triangulation; Monotone decomposition; Visibility; Art galleries. Voronoi diagrams; Delaunay triangulation; Proximity queries; Mesh quality. Range searching; KD trees; Range trees; Spatial subdivisions. Geometric duality; Halfspace intersection; Linear programming geometry; Randomized constructions. Motion planning; Minkowski sums; Collision detection; Geometric implementation. Projects use safe simulations, public datasets or textual analysis; specialist subject review is required.

Geometric predicates; Orientation; Robust arithmetic; Degeneracies

  • Geometric Predicates and Determinantal Formulations Lab60 min
  • Orientation Predicates, InCircle Tests, and Geometric Primitives Lab60 min
  • Robust Arithmetic, Floating-Point Precision, and Exact Geometric Computation Lab60 min
  • Degeneracies, General Position Assumptions, and Symbolic Perturbation Lab60 min

Careers this prepares you for

    How you study

    Every lesson pairs an in-depth video with written notes, key takeaways, a hands-on lab, exercises and a quiz. Work at your own pace, then sit the final examination for your Erudex certificate.