| Topic |
| Session 1 | Algorithm for determining line intersection: Algorithm paradigm |
| Session 2 | Line intersection enumeration algorithm and data structure |
| Session 3 | How to write pseudocode and back-of-the-envelope calculations |
| Session 4 | Convex hull and its calculation |
| Session 5 | Convex hull fast algorithm |
| Session 6 | Use of convex polygons: Farthest point pair calculation and collision detection |
| Session 7 | Voronoi diagram and its properties |
| Session 8 | Voronoi diagram calculation algorithm |
| Session 9 | Use of Voronoi diagram: Nearest neighbor search and object skeleton |
| Session 10 | Delaunay triangulation and its properties |
| Session 11 | Delaunay graph subgraphs and graph spanner |
| Session 12 | Object recognition and reconstruction: CRUST algorithm and alpha outline |
| Session 13 | Area exploration and ham sandwich cutting |
| Session 14 | Ramsey theory and happy ending theorem |
| Session 15 | Incidence of points and lines and number of intersections in graph drawing |
＊＊This content is based on April 1, 2025. For the latest syllabus information and details, please check the