computational_geometry (361B)
1 # Computational geometry 2 3 - [packing_problem] 4 - Klee's measure problem: find the volume of a union of rectangles / find if they cover the entire space 5 - we can see [satisfiability_boolean] in this way, more specifically the validity problem of a [disjunctive_normal_form] formula 6 - [convex_hull] 7 - [closest_pair_of_points] 8 9 Up: [geometry], [computer_science]