Skip to content

Geometry Ladders

Use these ladders when the main challenge is geometric modeling rather than raw implementation alone.

  1. vectors and orientation
  2. segment intersection
  3. polygon area and point location
  4. convex hull
  5. minkowski sum
  6. sweep line
  7. nearest pair
  8. counting geometry
  9. half-plane intersection
  10. right-triangle / angle-counting notes

How To Use This Section

  • do not skip the primitive stages
  • keep one consistent convention for orientation and boundary handling across problems
  • after every accepted solution, write down which predicate or policy choice mattered most

What “Ready To Move On” Looks Like

  • your geometry bugs are no longer mostly sign/convention bugs
  • you trust your primitive helpers
  • later geometry algorithms feel like compositions of known tools, not entirely new worlds

Representative Solved Notes