Course Identification

Title:

Computational geometry

Code:

20184042

Lecturers and Teaching Assistants

Lecturers:

Prof. David Peleg

TA's:

N/A

Course Schedule and Location

Year:

2018

Semester:

Second Semester

When / Where:

Monday, 09:15 - 11:00, Ziskind, Rm 1

First Lecture:

19/03/2018

Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Lecture; Elective; 2.00 points

Comments

N/A

Prerequisites

Basic (undergraduate level) courses in algorithms and data structures.

Restrictions

Participants:

60

Language of Instruction

English

Attendance and participation

Expected and Recommended

Grade Type

Numerical (out of 100)

Grade Breakdown (in %)

Final:

100%

Evaluation Type

Examination

Scheduled date 1

Date / due date

01/08/2018

Location

Ziskind, Rm 1

Time

1000-1200

Remarks

N/A

Scheduled date 2

Date / due date

N/A

Location

N/A

Time

-

Remarks

N/A

Estimated Weekly Independent Workload (in hours)

1

Syllabus

The course will introduce basic topics in computational geometry, such as algorithms for convex hulls, detecting segment intersection, polygon triangulation, range searching, Voronoi diagrams, Delaunay triangulations, geometric spanners, and efficient data structures for various geometric problems.

Learning Outcomes

Upon successful completion of this course students should be able to:

Demonstrate knowledge of key notions and principles related to computational geometry,
Learn about some of the central problems in the area and the various approaches to tackling them.
Demonstrate familiarity with some of the basic algorithmic techniques of the area.
Demonstrate acquaitance with modern research in the field.

Reading List

N/A

Website

N/A