هندسه محاسباتی (دکتری)د

Introduction to Computational Geometry

Introduction to Geometric Spanners and course overview (Chap. 1)

Chap. 2: Algorithms and Graphs

Chap 3: Lower bound for computing spanners

Chap. 4: Theta-Graph algorithm

Chap 6: The Gap Property

Chap 7: The Gap-Greedy Algorithm

Chap 9: The Well-Separated Pair Decomposition (WSPD)

Chap. 10: Applications of WSPD

Chap 14: The Leapfrog Property (till 14.6)