3 subtopics · 9 problems
Computational Geometry
Convex hull, line sweep, point-in-polygon, and geometric primitives.
01Geometric Primitives
Distance, cross product, line intersection, point-in-polygon.
2 medium1 hard
| Problem | Difficulty | Link |
|---|---|---|
| 166BPolygons | medium | Solve |
| 598CNearest vectors | medium | Solve |
| 549ESasha Circle | hard | Solve |
02Convex Hull
Andrew's monotone chain or Graham scan in O(n log n).
1 medium2 hard
| Problem | Difficulty | Link |
|---|---|---|
| 166BPolygons | medium | Solve |
| 70DProfessor's task | hard | Solve |
| 319CKalila and Dimna in the Logging Industry | hard | Solve |
03Line Sweep / Event Processing
Process events left-to-right to solve interval and geometry problems.
2 medium1 hard
| Problem | Difficulty | Link |
|---|---|---|
| 1216CWhite Sheet | medium | Solve |
| 1360FSpy Detected! | medium | Solve |
| 1157C1Increasing Subsequence (easy) | hard | Solve |
Was this helpful?