Fundamental Techniques, Data Structures and Algorithms For Solving Geometric Problems, Such As Computing Convex Hulls, Intersection Of Line Segments, The Voronoi Diagram and Delaunay Triangulation of A Point Set, Polygon Triangulation, Range Search, Linear Programming, Point Location in Spaces of Any Dimension. Various Topics in Discrete Geometry Are Also Addressed (e.g., The Crossing Number of a Graph).

Faculty: Computer Science
|Undergraduate Studies |Graduate Studies
Pre-required courses

234218 - Data Structures 1

Semestrial Information

Weekly Hours

3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours • 1 Project Hours

Go to Course Page

Go to Course Page


Responsible(s)

Gill Barequet


Exams
Session A: 17-04-2024
  • אולמן 805.

Registration Groups
11
Lecture Monday 10:30 - 12:30 טאוב 3 | Gill Barequet
Exercise Monday 12:30 - 13:30 טאוב 3 | Tomer Adar
Weekly Hours

3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours • 1 Project Hours

Go to Course Page

Go to Course Page


Responsible(s)

Gill Barequet


Exams
Session A: 01-02-2023 Session B: 01-03-2023
Registration Groups
11
Lecture Tuesday 12:30 - 14:30 טאוב 201 | Gill Barequet
Exercise Tuesday 14:30 - 15:30 טאוב 201 | Tomer Adar
Weekly Hours

3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours • 1 Project Hours

Go to Course Page

Go to Course Page


Responsible(s)

Gill Barequet


Exams
Session A: 31-01-2022 17:00 - 20:00
  • טאוב 4. 6.

Registration Groups
11
Lecture Monday 10:30 - 12:30 טאוב 3 | Gill Barequet
Exercise Monday 12:30 - 13:30 טאוב 3 | גב. שחאדה אמאני