Discrete and Computational Geometry Group

The Discrete and Computational Geometry Group is formed by Otfried Cheong and his graduate students (and sometimes postdocs).

Research

We do research in two related areas:

Computational Geometry

Computational Geometry is the area of computer science that studies efficient algorithms for geometric problems. The problems studied come from applications in graphics, CAD, robotics, GIS, and other areas of geometric computation, but are studied from a theoretical point of view. Algorithms are formally analyzed and proven correct.

Otfried Cheong is one of the authors of the standard textbook on computational geometry.

Discrete Geometry

Discrete geometry is an area of mathematics that studies combinatorial properties of geometric objects. Going back to Kepler and Gauss, the field owes much to the work of Paul Erdös.

Otfried Cheong holds a position as an affiliate professor at the Department of Mathematical Sciences. He teaches courses on discrete geometry and related topics at the math department, and can be the advisor of math students on all levels who wish to graduate on a topic in this area.

Noon seminar

We used to have a weekly group seminar.

Alumni

• Chang-Yul Choi, M.Sc. 2007
• Hyo-Sil Kim, M.Sc. 2007
• Mira Lee, M.Sc. 2007
• Jung Gun Lim, M.Sc. 2007
• Jang-hwan Kim, M.Sc. 2008
• Chang-ryeol Lee, M.Sc. 2009
• Aram Han, M.Sc. 2010

Publications

Here is a list of publications by members of the Discrete & Computational Geometry group that do not already appear on the list of Otfried Cheong's publications.

• Radoslav Fulek, Andreas Holmsen, János Pach. Intersecting convex sets by rays. Symposium on Computational Geometry 2008:385-391.
• Véronique Cortier, Xavier Goaoc, Mira Lee, Hyeon-Suk Na. A note on maximally repeated sub-patterns of a point set. Discrete Mathematics 306:1965-1968 (2006).