< BK21+ BEST Seminar Series Announcement> 

Time and Date : 11:00 ~ 12:00 Thursday 08/30/2018

Place : D406, Engineering Building #4

Title : Geometric Computation: Challenges and Progress

Abstract:

Computational geometry deals with basic geometric objects such as points, line segments, polygons, and polyhedra, and aims to develop efficient algorithms and data structures for solving practical problems by figuring out the geometric, combinatorial, and topological properties of the objects. It has been remarkably productive and and successful in providing numerous general methods and algorithms to solve geometric problems in application areas efficiently, such as computer graphics, VLSI circuit design, robotics, geographic information systems, computer vision, and computational biology. With rapid advances in hardware systems such as LiDAR sensors and 3D scanners, geometric computation has faced a number of challenges: multidimensional searching for massive data in very high dimensions, processing streaming (time-series) data using limited amount of memory, handling imprecise data from sensors and scanners, and querying over dynamic data. This talk will provide an introduction to the basic concepts and frameworks of computational geometry, and recent progress of computational geometry on these challenges.

Presenter: Hee-Kap Ahn, Professor / POSTECH

Host: Prof. Kang, Hong-Goo, Yonsei EEE