발행물

전체 논문

194

51

Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon
Eunjin Oh, Hee-Kap Ahn
Discrete & Computational Geometry, 2020

52

Finding Pairwise Intersections of Rectangles in a Query Rectangle
Eunjin Oh, Hee-Kap Ahn
Computational Geometry, 2019

53

Computing the Center Region and Its Variants
Eunjin Oh, Hee-Kap Ahn
Theoretical Computer Science, 2019

54

On Romeo and Juliet Problems: Minimizing Distance-to-Sight
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
Computational Geometry, 2019

55

Computing a Geodesic Two-Center of Points in a Simple Polygon
Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
Computational Geometry: Theory and Applications, 2019

56

A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms
Eunjin Oh, Hee-Kap Ahn
Algorithmica, 2019

57

Assigning Weights to Minimize the Covering Radius in the Plane
Eunjin Oh, Hee-Kap Ahn
Computational Geometry: Theory and Applications, 2019

58

Faster Algorithms for Growing Prioritized Disks and Rectangles
Hee-Kap Ahn, Sang Won Bae, Jongmin Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-Won Park, André van Renssen, Antoine Vigneron
Computational Geometry: Theory and Applications, 2019

59

The Minimum Convex Container of Two Convex Polytopes under Translations
Hee-Kap Ahn, Judit Abardia, Sang Won Bae, Otfried Cheong, Susanna Dann, Dongwoo Park, Chan-Su Shin
Computational Geometry: Theory and Applications, 2019

60

Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases
Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jongmin Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon
Information Processing Letters, 2019