Basic Information
Random Sampling, Static and Dynamic Randomized Algorithms, Computing Convex Hulls, Linear Programming, Arrangements of Line Segments And Davenport-schinzel Sequences, Voronoi Diagrams With Euclidean and Non- Euclidean Metrics, Probabilistic Proofs.
Faculty: Computer Science
|Graduate Studies
Pre-required courses
236719 - Computational Geometry
Course with no extra credit
236739
Semestrial Information
Weekly Hours
2 Academic Credit • 2 Lecture Hours
Go to Course Page
Responsible(s)
Gill Barequet
Registration Groups
|
|
Weekly Hours
2 Academic Credit • 2 Lecture Hours
Go to Course Page
Responsible(s)
Gill Barequet
Registration Groups
|
|
Weekly Hours
2 Academic Credit • 2 Lecture Hours
Go to Course Page
Responsible(s)
Gill Barequet
Notes
-
ההרצאה תתקיים בטאוב 201.
Registration Groups
|
|