Computational Geometry

Computational Geometry

Computational geometry is the study of design and analysis of algorithms dealing with geometric objects. Therefore the goal of research is to develop efficient algorithms and data structures for solving problems stated in terms of basic geometrical objects, such as points, line segments, polygons, polyhedra, etc.

It emerged as a sub-discipline of theoretical computer science from 1970s, and has grown into a recognized research discipline in computer science and applied mathematics, with a large community of active researchers. It had developed in several directions and forged links with other application domains such as computer aided design, robotics, computer graphics, virtual reality, computer vision, bio-informatics, and geographic information system.

We believe that knowledge of computational geometry is important to solve geometric problems in application areas efficiently.

Software Star Lab

News and Schedule

Best paper award at KSC 2018: "Stacking Terrains in Two and Three Dimensions."
by Seungjoon Lee, Hee-Kap Ahn.