International Joint Conference On Theoretical Computer Science – Frontier of Algorithmic Wisdom

August 15-19, 2022, City University of Hong Kong, Hong Kong


Invited Speakers

Track G

Voronoi diagrams in the presence of obstacles

Hee-Kap Ahn

Pohang University of Science and Technology

A Voronoi diagram is a fundamental geometric structure that partitions space into regions based on the distance to points in a specific subset of the space. Due to the structural and combinatorial properties, Voronoi diagrams have applications in many fields, including geometry, informatics, biology, engineering, and architecture. In this talk, we will review the concept and properties of Voronoi diagrams and the recent progress in computing Voronoi diagrams, especially in the presence of obstacles.

Hee-Kap Ahn is a Mueunjae Endowed Chair Professor at Pohang University of Science and Technology (POSTECH). He received his Ph.D. degree from Utrecht University in the Netherlands in 2001. He has been working on various optimization problems in algorithms, especially in computational geometry, a field of computer science devoted to the study of design and analysis of algorithms for geometry and optimization problems. Among them, he introduced the Voronoi game as a competitive facility location problem and presented optimal algorithms for computing various Voronoi diagrams. He has also been working on shape matching, shape analysis, and nearest-neighbor search in high dimensions, which have applications in computer vision and artificial intelligence.