포스텍 컴퓨터공학과에 오은진 교수님이 6월1일자로 부임하였습니다.

오은진 교수님은 장애물이 있는 공간에서의 최단거리문제를 전문 분야로 연구해왔으며, 알고리즘, 자료구조, 계산 기하 연구를 진행하고 있습니다.

관심있는 학생들의 많은 지원 바랍니다. (eunjin.oh@postech.ac.kr )

Biography: Eunjin Oh is an Assistant Professor at POSTECH. She received her Bachelor degree from POSTECH in 2013, and she received her PhD degree from POSTECH in 2018. Before joining POSTECH, she was a postdoctoral fellow at Max Planck Institute for Informatics, hosted by Kurt Mehlhorn.

Research Topic: Since the early 1980s, many classical geometric problems have been studied in the presence of polygonal obstacles. In the presence of polygonal obstacles, the distance of two points is measured by the length of a shortest path between the two points avoiding obstacles. Her research mainly focuses on efficient algorithms for computing geometric structures in polygonal domains such as Voronoi diagrams, convex hulls and clustering.