Chair : Chaeyoon Chung |
||||
| Date | Time | Location | Title | Speaker |
| 2024/07/02 | 15:30~16:30 | B2-101 | Adjacency Labeling Schemes | Geunho Kim |
| 2024/07/02 | 15:30~16:30 | B2-101 | The Geodesic Farthest-Site Voronoi Diagram in a Polygonal Domain with Holes | Minju Song |
| 2024/07/10 | 15:30~16:30 | B2-101 | Near-Linear Algorithms for Geometric Hitting Sets and Set Covers | Chaeyoon Chung |
| 2024/07/10 | 15:30~16:30 | B2-101 | Guarding Points on a Terrain by Watchtowers | Byeonguk Kang |
| 2024/07/16 | 15:30~16:30 | B2-101 | Bichromatic line segment intersection | Taehoon Ahn |
| 2024/07/16 | 15:30~16:30 | B2-101 | Shortcutting the diameter of a polygon | Taekang Eom |
| 2024/07/30 | 15:30~16:30 | B2-101 | Guarding Art Gallery with Sliding Cameras | Mook Kwon Jung |
| 2024/08/06 | 15:30~16:30 | B2-101 | TetGen, a Delaunay Based Quality Tetrahedral Mesh Generator | Hwi Kim |
| 2024/08/13 | 15:30~16:30 | B2-101 | LP-type Problem: Smallest Enclosing Discs | Jeongwon Moon |
| 2024/08/13 | 15:30~16:30 | B2-101 | Divide and Conquer Algorithm for Construction of Voronoi Diagrams | Jueun Seo |
| 2024/08/20 | 15:30~16:30 | B2-101 | A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon | Minju Song |
| 2024/08/20 | 15:30~16:30 | B2-101 | Changing base without losing space | Geunho Kim |
| 2024/08/27 | 15:30~16:30 | B2-101 | Dobkin-Kirkpatrick Hierarchy | Seokyun Kang |
| 2024/08/27 | 15:30~16:30 | B2-101 | Heapsort -Adapted for Presorted Files | Hyojeong Ann |
| 2024/09/09 | 15:30~16:30 | B2-101 | Epsilon-net basics and small size epsilon-net for halfspaces | Chaeyoon Chung |
| 2024/09/09 | 15:30~16:30 | B2-101 | Altitude terrain guarding | Byeonguk Kang |
| 2024/09/23 | 15:30~16:30 | B2-101 | The Clarkson-Shor Technique | Taehoon Ahn |
| 2024/09/23 | 15:30~16:30 | B2-101 | Dynamic Maximum Independent Sets of Geometric Objects | Taekang Eom |
| 2024/09/30 | 15:30~16:30 | B2-101 | Treewidth of Chordal Bipartite Graphs | Mook Kwon Jung |
| 2024/10/07 | 15:30~16:30 | B2-101 | Clustering with Few Disks to Minimize the Sum of Radii | Hwi Kim |
| 2024/10/07 | 15:30~16:30 | B2-101 | Smallest color-spanning object revisited | Jaegun Lee |
| 2024/10/14 | 15:30~16:30 | B2-101 | Compressed Quadtree | Jeongwon Moon |
| 2024/10/14 | 15:30~16:30 | B2-101 | The Quickhull Algorithm for Convex Hulls | Jueun Seo |
| 2024/10/21 | 15:30~16:30 | B2-101 | Altitude terrain guarding: altitude optimization | Byeonguk Kang |
| 2024/10/28 | 15:30~16:30 | B2-101 | Optimal Algorithm for Geodesic Farthest-Point Voronoi Diagrams | Minju Song |
| 2024/10/28 | 15:30~16:30 | B2-101 | Two-Point Shortest Path Queries in a Polygonal Domain | Geunho Kim |
| 2024/11/04 | 15:30~16:30 | B2-101 | A Faster Algorithm for Pigeonhole Equal Sums | Seokyun Kang |
| 2024/11/04 | 15:30~16:30 | B2-101 | Partitioning a Polygon Into Small Pieces | Hyojeong Ann |
| 2024/11/11 | 15:30~16:30 | B2-101 | Covering a set of points with two disjoint unit disks | Chaeyoon Chung |
| 2024/11/04 | 15:30~16:30 | B2-101 | Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain | Byeonguk Kang |
| 2024/11/18 | 15:30~16:30 | B2-101 | Approximating Traveling Salesman Problems Using a Bridge Lemma | Taekang Eom |
| 2024/11/25 | 15:30~16:30 | B2-101 | Optimal Line Bipartitions of Point Sets | Mook Kwon Jung |
| 2024/11/25 | 15:30~16:30 | B2-101 | Approximation Algorithms for the Minimum Convex Partition Problem | Hwi Kim |
| 2024/12/02 | 15:30~16:30 | B2-101 | Bounded-Angle Minimum Spanning Trees | Jaegun Lee |
| 2024/12/02 | 15:30~16:30 | B2-101 | Computing the L1 geodesic diameter and center of a simple polygon in linear time | Jeongwon Moon |
| 2024/12/09 | 15:30~16:30 | B2-101 | The Quickhull Algorithm for Convex Hulls (2) | Jueun Seo |
| 2024/12/09 | 15:30~16:30 | B2-101 | Farthest-point Voronoi Diagrams in the Hilbert Metric | Minju Song |
2024 Fall Lab Seminar