CS 498sh3: sp23 - Discrete & Computational Geometry
  1. 4/25: Lecture 25: Planar separator.
  2. 4/18: Lecture 24: At most k level, depth, etc.
  3. 4/13: Lecture 23: A spanning tree with few crossings
  4. 4/11: Lecture 22: JL lemma
  5. 4/6: Lecture 21: Measure concentration on the sphere and JL lemma
  6. 4/4: Lecture 20: Brunn-Minkowski inequality : The strange geometry of high dimensions.
  7. 3/28: Lecture 19: Perceptron algorithm and variants.
  8. 3/23: Lecture 18: WSPD.
  9. 3/21: Lecture 17: Quadtrees.
  10. 3/9: Lecture 16: Union complexity of pseudodisks.
  11. 3/7: Lecture 15: Motion planning
  12. 3/2: Lecture 14: Interval trees, Priority trees, and segment trees
  13. 2/28: Lecture 13: Delaunay triangulations
  14. 2/23: Lecture 12: Voronoi diagrams
  15. 2/21: Lecture 11: Duality, inversion, and polarity
  16. 2/16: Lecture 10: The moments technique, and convex-hull in three dimensions.
  17. 2/14: Lecture 9: Point location (Chapter 6 in the book).
  18. 2/9: Lecture 8: Orthogonal range searching.
  19. 2/7: Lecture 7: Closest pair.
  20. 2/2: Lecture 6: Low dimensions linear programming
  21. 1/31: Lecture 5: Computing lowest vertex above a set of lines.
  22. 1/26: Lecture 4: Triangulating a simple polygon.
  23. 1/24: Lecture 3: Arrangements and planar graphs
    1. Planar graphs
    2. Arrangements
  24. 1/19: Lecture 2: Convexity / Sweeping.
  25. 1/17: Lecture 1: Introduction & 2d Convex Hull

Last modified: Thu 2023-04-27 19:22:42 UTC 2023 by Sariel Har-Peled