SubjectsSubjects(version: 845)
Course, academic year 2018/2019
   Login via CAS
Combinatorial and Computational Geometry II - NDMI013
Title in English: Kombinatorická a výpočetní geometrie II
Guaranteed by: Department of Applied Mathematics (32-KAM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2018 to 2018
Semester: summer
E-Credits: 6
Hours per week, examination: summer s.:2/2 C+Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: not taught
Language: Czech, English
Teaching methods: full-time
Additional information:
Guarantor: doc. RNDr. Pavel Valtr, Dr.
Mgr. Jan Kynčl, Ph.D.
Class: Informatika Mgr. - Diskrétní modely a algoritmy
Kombinatorická geometrie a geom. algorit
M Mgr. MSTR > Povinně volitelné
Classification: Informatics > Discrete Mathematics
Annotation -
Last update: T_KAM (07.05.2001)
Continuation of DMI009. The contents of this course varies over the years; usually several topics in discrete and computational geometry are covered in more depth.
Aim of the course -
Last update: T_KAM (20.04.2008)

Continuation and deeper study of the topics from NDMI009. In the covered topics, the level of the current research is usually reached.

Course completion requirements -
Last update: Mgr. Jan Kynčl, Ph.D. (14.02.2018)

The credit for the exercise is given after obtaining at least 1/4 points for solving the school and home problems. Bonus problems may be assigned in order to help gain some points. The nature of the conditions do not allow repeated attempts for obtaining the credit. Obtaining the credit is necessary before the exam.

Literature -
Last update: RNDr. Martin Balko, Ph.D. (25.02.2016)

see and NDMI009

Teaching methods -
Last update: Mgr. Jan Kynčl, Ph.D. (24.02.2016)

The exercises consist in individual solving of problems assigned during the semester. More information:

Requirements to the exam -
Last update: Mgr. Jan Kynčl, Ph.D. (14.02.2018)

The material required for the exam will be the same as taught in the lecture. The exam may include easier or moderately difficult problems from these topics.

Syllabus -
Last update: Mgr. Jan Kynčl, Ph.D. (23.04.2019)

The topics may be different every year. The plan for 2016 is the following:

Convexly independent subsets

Halving lines

Complexity of the lower envelope of segments, Davenport–Schinzel sequences

Erdős problem on distinct distances and applications of algebraic geometry

Hellyho type theorems (via simplicial complexes).

Embeddability (higher dimensional analogue of graph planarity).

Possibly other topics

Charles University | Information system of Charles University |