2024 Spring Algorithms Lab Seminar Chair : Chaeyoon Chung ←2023 Fall Seminar 2024 Fall Seminar→ Date Time Location Title Speaker 2024/01/02 16:00~17:00 B2-101 Introduction to Quantum Algorithms Suengjun Lee 2024/01/05 11:00~12:00 B2-101 The minimum area convex packing of two convex
2023 Spring Course
2023 Spring Course CSED331-01 Algorithms 1. Course Information Instructor : Prof. Hee-Kap Ahn TA : Byeonguk Kang / Chaeyoon Chung / Jaegun Lee Lecture room : TJ Park Lib. [502] Seminar Room Lecture hours : Monday & Wednesday 09:30~10:45
2022 Fall Course
2022 Fall Course CSED331-01 Algorithms 1. Course Information Instructor : Prof. Hee-Kap Ahn TA : Seungjun Lee / Taekang Eom / Mook Kwon Jung / Jaegun Lee Lecture room : Elec Bldg[101]Auditorium Lecture hours : Monday & Wednesday 09:30~10:45
2023 Fall Lab Seminar
2023 Fall Algorithms Lab Seminar Chair : Chaeyoon Chung ←2023 Spring Seminar 2024 Spring Seminar→ Date Time Location Title Speaker 2023/09/01 11:00~12:00 B2-101 On approximating shortest paths in weighted triangular tessellations Hyojeong Ann 2023/09/15 11:00~12:00 B2-101 Minimum Ply Covering of
2023 Spring Lab Seminar
2023 Spring Algorithms Lab Seminar Chair : Chaeyoon Chung ←2022 Fall Seminar 2023 Fall Seminar→ Date Time Location Title Speaker 2023/01/13 11:00~12:00 B2-101 Minimum Box Partition Hwi Kim 2023/01/20 11:00~12:00 B2-101 A (1+𝜖)-approximation algorithm for 2-line-center Chaeyoon Chung 2023/01/27 11:00~12:00
2022 Fall Lab Seminar
2022 Fall Algorithms Lab Seminar Chair : Mook Kwon Jung ←2022 Spring Seminar 2023 Spring Seminar→ Date Time Location Title Speaker 2022/09/15 17:00~17:30 B2-101 Guarding Sites Byounguk Kang 2022/09/23 11:00~12:00 B2-115 Burning Number for the Points in the Plane Jaegun
2022 Spring Lab Seminar
2022 Spring Algorithms Lab Seminar Chair : Jiwoo Park ←2021 Fall Seminar 2022 Fall Seminar→ Date Time Location Title Speaker 2022/02/25 11:00~12:00 B2-101 Approximating Convex Polygons by Histogons Jaehoon Chung 2022/03/04 11:00~12:00 B2-101 An Expander-based Approach to Geometric Optimization Hwi
2021 Fall Lab Seminar
2021 Fall Algorithms Lab Seminar Chair : Taekang Eom ←2021 Spring Seminar 2022 Spring Seminar→ Date Time Location Title Speaker 2021/08/20 13:00~14:00 B2-101 Supports for Hypergraph Seungjun Lee 2021/08/27 13:00~14:00 B2-101 Smoothed Analysis of Knapsack Problem Taekang Eom 2021/09/03 11:00~12:00
Shape Matching
Shape matching is an important ingredient in shape retrieval, recognition and classification, alignment and registration, and approximation and simplification. In a large database of shapes, for example, shape retrieval searches for all shapes similar to a query shape. In geometric
Shape Approximation
Substituting a complex geometric shape by a “simpler” one is motivated by many applications. A typical example is the problem of computing the smallest (area) enclosing disc (or annulus, square, …) of a given set of points in d-dimensional Euclidean