Casting with skewed ejection direction revisited. - Hee-Kap Ahn; Siu-Wing Cheng; Otfried Cheong (CCCG, 1999)

Flipping your Lid. - Hee-Kap Ahn; Prosenjit Bose; Jurek Czyzowicz; Nicolas Hanusse; Evangelos Kranakis; Pat Morin (CCCG, 2000)

Reachability by paths of bounded curvature in convex polygons. - Hee-Kap Ahn; Otfried Cheong; Jirí Matousek 001; Antoine Vigneron (SCG, 2000)

Competitive Facility Location along a Highway. - Hee-Kap Ahn; Siu-Wing Cheng; Otfried Cheong; Mordecai J. Golin; René van Oostrum (COCOON, 2001)

Separating an object from its cast. - Hee-Kap Ahn; Mark de Berg; Prosenjit Bose; Siu-Wing Cheng; Dan Halperin; Jirí Matousek 001; Otfried Schwarzkopf (Comput. Aided Des., 2002)

Casting a polyhedron with directional uncertainty. - Hee-Kap Ahn; Otfried Cheong; René van Oostrum (Comput. Geom., 2003)

Building bridges between convex region. - Hee-Kap Ahn; Otfried Cheong; Chan-Su Shin (Comput. Geom., 2003)

Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. - Hee-Kap Ahn; Peter Braß; Otfried Cheong; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (COCOON, 2004)

The reflex-free hull. - Hee-Kap Ahn; Siu-Wing Cheng; Otfried Cheong; Jack Snoeyink (Int. J. Comput. Geom. Appl., 2004)

Competitive facility location: the Voronoi game. - Hee-Kap Ahn; Siu-Wing Cheng; Otfried Cheong; Mordecai J. Golin; René van Oostrum (Theor. Comput. Sci., 2004)

Stacking and Bundling Two Convex Polygons. - Hee-Kap Ahn; Otfried Cheong (ISAAC, 2005)

Casting with Skewed Ejection Direction. - Hee-Kap Ahn; Siu-Wing Cheng; Otfried Cheong (Algorithmica, 2006)

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. - Hee-Kap Ahn; Peter Braß; Otfried Cheong; Hyeon-Suk Na; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2006)

Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations. - Sang Won Bae 001; Chunseok Lee; Hee-Kap Ahn; Sunghee Choi; Kyung-Yong Chwa (ISAAC, 2007)

Maximizing the overlap of two planar convex sets under rigid motions. - Hee-Kap Ahn; Otfried Cheong; Chong-Dae Park; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2007)

Covering a Point Set by Two Disjoint Rectangles. - Hee-Kap Ahn; Sang Won Bae 001 (ISAAC, 2008)

Maximum overlap and minimum convex hull of two convex polyhedra under translations. - Hee-Kap Ahn; Peter Brass; Chan-Su Shin (Comput. Geom., 2008)

Aperture-Angle and Hausdorff-Approximation of Convex Figures. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Joachim Gudmundsson (Discret. Comput. Geom., 2008)

Optimal Empty Pseudo-Triangles in a Point Set. - Hee-Kap Ahn; Sang Won Bae 001; Iris Reinbacher (CCCG, 2009)

Square and Rectangle Covering with Outliers. - Hee-Kap Ahn; Sang Won Bae 001; Sang-Sub Kim 001; Matias Korman; Iris Reinbacher; Wanbin Son (FAW, 2009)

Spatial Skyline Queries: An Efficient Geometric Algorithm. - Wanbin Son; Mu-Woong Lee; Hee-Kap Ahn; Seung-won Hwang (SSTD, 2009)

Casting an Object with a Core. - Hee-Kap Ahn; Sang Won Bae 001; Siu-Wing Cheng; Kyung-Yong Chwa (Algorithmica, 2009)

On the minimum total length of interval systems expressing all intervals, and range-restricted queries. - Hee-Kap Ahn; Peter Brass; Hyeon-Suk Na; Chan-Su Shin (Comput. Geom., 2009)

Computing minimum-area rectilinear convex hull and L-shape. - Sang Won Bae 001; Chunseok Lee; Hee-Kap Ahn; Sunghee Choi; Kyung-Yong Chwa (Comput. Geom., 2009)

Constructing Optimal Highways. - Hee-Kap Ahn; Helmut Alt; Tetsuo Asano; Sang Won Bae 001; Peter Brass; Otfried Cheong; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin; Alexander Wolff 001 (Int. J. Found. Comput. Sci., 2009)

Covering a simple polygon by monotone directions. - Hee-Kap Ahn; Peter Brass; Christian Knauer; Hyeon-Suk Na; Chan-Su Shin (Comput. Geom., 2010)

Dilation-Optimal Edge Deletion in Polygonal Cycles. - Hee-Kap Ahn; Mohammad Farshi; Christian Knauer; Michiel H. M. Smid; Yajun Wang (Int. J. Comput. Geom. Appl., 2010)

Generating Realistic Roofs over a Rectilinear Polygon. - Hee-Kap Ahn; Sang Won Bae 001; Christian Knauer; Mira Lee; Chan-Su Shin; Antoine Vigneron (ISAAC, 2011)

Convergent Bounds on the Euclidean Distance. - Yoonho Hwang; Hee-Kap Ahn (NIPS, 2011)

Covering points by disjoint boxes with outliers. - Hee-Kap Ahn; Sang Won Bae 001; Erik D. Demaine; Martin L. Demaine; Sang-Sub Kim 001; Matias Korman; Iris Reinbacher; Wanbin Son (Comput. Geom., 2011)

Empty pseudo-triangles in point sets. - Hee-Kap Ahn; Sang Won Bae 001; Marc J. van Kreveld; Iris Reinbacher; Bettina Speckmann (Discret. Appl. Math., 2011)

Spatial skyline queries: exact and approximation algorithms. - Mu-Woong Lee; Wanbin Son; Hee-Kap Ahn; Seung-won Hwang (GeoInformatica, 2011)

Adaptive Algorithms for Planar Convex Hull Problems. - Hee-Kap Ahn; Yoshio Okamoto (IEICE Trans. Inf. Syst., 2011)

Covering a Point Set by Two Disjoint Rectangles. - Sang-Sub Kim 001; Sang Won Bae 001; Hee-Kap Ahn (Int. J. Comput. Geom. Appl., 2011)

A fast nearest neighbor search algorithm by nonlinear embedding. - Yoonho Hwang; Bohyung Han; Hee-Kap Ahn (CVPR, 2012)

Rectilinear Covering for Imprecise Input Points - (Extended Abstract). - Hee-Kap Ahn; Sang Won Bae 001; Shin-ichi Tanigawa (ISAAC, 2012)

Computing k-center over Streaming Data for Small k. - Hee-Kap Ahn; Hyo-Sil Kim; Sang-Sub Kim 001; Wanbin Son (ISAAC, 2012)

Aligning Two Convex Figures to Minimize Area or Perimeter. - Hee-Kap Ahn; Otfried Cheong (Algorithmica, 2012)

Reachability by paths of bounded curvature in a convex polygon. - Hee-Kap Ahn; Otfried Cheong; Jirí Matousek 001; Antoine Vigneron (Comput. Geom., 2012)

Computing the Discrete FRéChet Distance with Imprecise Input. - Hee-Kap Ahn; Christian Knauer; Marc Scherfenberg; Lena Schlipf; Antoine Vigneron (Int. J. Comput. Geom. Appl., 2012)

Group Nearest Neighbor Queries in the L 1 Plane. - Hee-Kap Ahn; Sang Won Bae 001; Wanbin Son (TAMC, 2013)

Realistic roofs over a rectilinear polygon. - Hee-Kap Ahn; Sang Won Bae 001; Christian Knauer; Mira Lee; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2013)

Maximum overlap of convex polytopes under translation. - Hee-Kap Ahn; Siu-Wing Cheng; Iris Reinbacher (Comput. Geom., 2013)

Covering and piercing disks with two centers. - Hee-Kap Ahn; Sang-Sub Kim 001; Christian Knauer; Lena Schlipf; Chan-Su Shin; Antoine Vigneron (Comput. Geom., 2013)

Minimum Convex Container of Two Convex Polytopes under Translations. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Dongwoo Park; Chan-Su Shin (CCCG, 2014)

A Generalization of the Convex Kakeya Problem. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Joachim Gudmundsson; Takeshi Tokuyama; Antoine Vigneron (Algorithmica, 2014)

Overlap of convex polytopes under rigid motion. - Hee-Kap Ahn; Siu-Wing Cheng; Hyuk Jun Kweon; Juyoung Yon (Comput. Geom., 2014)

Computing k Centers over Streaming Data for Small k. - Hee-Kap Ahn; Hyo-Sil Kim; Sang-Sub Kim 001; Wanbin Son (Int. J. Comput. Geom. Appl., 2014)

Guest Editors' Foreword. - Hee-Kap Ahn; Antoine Vigneron (Int. J. Comput. Geom. Appl., 2014)

MSSQ: Manhattan Spatial Skyline Queries. - Wanbin Son; Seung-won Hwang; Hee-Kap Ahn (Inf. Syst., 2014)

The 2-Center Problem in a Simple Polygon. - Eunjin Oh 001; Jean-Lou De Carufel; Hee-Kap Ahn (ISAAC, 2015)

An improved data stream algorithm for clustering. - Sang-Sub Kim 001; Hee-Kap Ahn (Comput. Geom., 2015)

Group nearest-neighbor queries in the L1 plane. - Wanbin Son; Sang Won Bae 001; Hee-Kap Ahn (Theor. Comput. Sci., 2015)

The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon. - Eunjin Oh 001; Luis Barba; Hee-Kap Ahn (SoCG, 2016)

A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree. - Eunjin Oh 001; Hee-Kap Ahn (ISAAC, 2016)

A Middle Curve Based on Discrete Fréchet Distance. - Hee-Kap Ahn; Helmut Alt; Maike Buchin; Eunjin Oh 001; Ludmila Scharf; Carola Wenk (LATIN, 2016)

Constrained Geodesic Centers of a Simple Polygon. - Eunjin Oh 001; Wanbin Son; Hee-Kap Ahn (SWAT, 2016)

Guest Editor's Foreword. - Hee-Kap Ahn; Chan-Su Shin (Algorithmica, 2016)

Bundling three convex polygons to minimize area or perimeter. - Dongwoo Park; Sang Won Bae 001; Helmut Alt; Hee-Kap Ahn (Comput. Geom., 2016)

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. - Hee-Kap Ahn; Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Matias Korman; Eunjin Oh 001 (Discret. Comput. Geom., 2016)

A Time-Space Trade-Off for Triangulations of Points in the Plane. - Hee-Kap Ahn; Nicola Baraldo; Eunjin Oh 001; Francesco Silvestri 001 (COCOON, 2017)

Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons. - Eunjin Oh 001; Hee-Kap Ahn (SoCG, 2017)

Bundling Two Simple Polygons to Minimize Their Convex Hull. - Jong Min Choi; Dongwoo Park; Hee-Kap Ahn (WALCOM, 2017)

Top-k Manhattan spatial skyline queries. - Wanbin Son; Fabian Stehn; Christian Knauer; Hee-Kap Ahn (Inf. Process. Lett., 2017)

Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16). - Naoki Katoh; Hee-Kap Ahn; Subhas C. Nandy (NII Shonan Meet. Rep., 2017)

Realistic roofs without local minimum edges over a rectilinear polygon. - Sang Duk Yoon; Hee-Kap Ahn; Jessica Sherette (Theor. Comput. Sci., 2017)

Product Quantized Translation for Fast Nearest Neighbor Search. - Yoonho Hwang; Mooyeol Baek; Saehoon Kim; Bohyung Han; Hee-Kap Ahn (AAAI, 2018)

Polygon Queries for Convex Hulls of Points. - Eunjin Oh 001; Hee-Kap Ahn (COCOON, 2018)

Approximate Range Queries for Clustering. - Eunjin Oh 001; Hee-Kap Ahn (SoCG, 2018)

Point Location in Dynamic Planar Subdivisions. - Eunjin Oh 001; Hee-Kap Ahn (SoCG, 2018)

Statistical Similarity of Critical Infrastructure Network Traffic Based on Nearest Neighbor Distances. - Jeong-Han Yun; Yoonho Hwang; Woomyo Lee; Hee-Kap Ahn; Sin-Kyu Kim (RAID, 2018)

Minimum-Width Square Annulus Intersecting Polygons. - Hee-Kap Ahn; Taehoon Ahn 001; Jong Min Choi; Mincheol Kim; Eunjin Oh 001 (WALCOM, 2018)

The geodesic 2-center problem in a simple polygon. - Eunjin Oh 001; Jean-Lou De Carufel; Hee-Kap Ahn (Comput. Geom., 2018)

Geometric matching algorithms for two realistic terrains. - Sang Duk Yoon; Min-Gyu Kim 002; Wanbin Son; Hee-Kap Ahn (Theor. Comput. Sci., 2018)

Maximum-Area Rectangles in a Simple Polygon. - Yujin Choi; Seungjun Lee; Hee-Kap Ahn (FSTTCS, 2019)

Maximizing Dominance in the Plane and Its Applications. - Jong Min Choi; Sergio Cabello; Hee-Kap Ahn (WADS, 2019)

A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms. - Eunjin Oh 001; Hee-Kap Ahn (Algorithmica, 2019)

The minimum convex container of two convex polytopes under translations. - Hee-Kap Ahn; Judit Abardia; Sang Won Bae 001; Otfried Cheong; Susanna Dann; Dongwoo Park; Chan-Su Shin (Comput. Geom., 2019)

Faster algorithms for growing prioritized disks and rectangles. - Hee-Kap Ahn; Sang Won Bae 001; Jong Min Choi; Matias Korman; Wolfgang Mulzer; Eunjin Oh 001; Ji-won Park; André van Renssen; Antoine Vigneron (Comput. Geom., 2019)

On Romeo and Juliet problems: Minimizing distance-to-sight. - Hee-Kap Ahn; Eunjin Oh 001; Lena Schlipf; Fabian Stehn; Darren Strash (Comput. Geom., 2019)

Assigning weights to minimize the covering radius in the plane. - Eunjin Oh 001; Hee-Kap Ahn (Comput. Geom., 2019)

Finding pairwise intersections of rectangles in a query rectangle. - Eunjin Oh 001; Hee-Kap Ahn (Comput. Geom., 2019)

Computing a geodesic two-center of points in a simple polygon. - Eunjin Oh 001; Sang Won Bae 001; Hee-Kap Ahn (Comput. Geom., 2019)

Minimum-width annulus with outliers: Circular, square, and rectangular cases. - Hee-Kap Ahn; Taehoon Ahn 001; Sang Won Bae 001; Jong Min Choi; Mincheol Kim; Eunjin Oh 001; Chan-Su Shin; Sang Duk Yoon (Inf. Process. Lett., 2019)

Computing the center region and its variants. - Eunjin Oh 001; Hee-Kap Ahn (Theor. Comput. Sci., 2019)

The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon. - Eunjin Oh 001; Luis Barba; Hee-Kap Ahn (Algorithmica, 2020)

Middle curves based on discrete Fréchet distance. - Hee-Kap Ahn; Helmut Alt; Maike Buchin; Eunjin Oh 001; Ludmila Scharf; Carola Wenk (Comput. Geom., 2020)

Efficient Planar Two-Center Algorithms. - Jong Min Choi; Hee-Kap Ahn (CoRR, 2020)

Largest similar copies of convex polygons amidst polygonal obstacles. - Taekang Eom; Seungjun Lee; Hee-Kap Ahn (CoRR, 2020)

Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. - Eunjin Oh 001; Hee-Kap Ahn (Discret. Comput. Geom., 2020)

Largest Similar Copies of Convex Polygons in Polygonal Domains. - Taekang Eom; Seungjun Lee; Hee-Kap Ahn (FSTTCS, 2021)

Maximizing Dominance in the Plane and its Applications. - Jongmin Choi; Sergio Cabello; Hee-Kap Ahn (Algorithmica, 2021)

Efficient planar two-center algorithms. - Jongmin Choi; Hee-Kap Ahn (Comput. Geom., 2021)

Maximum-area and maximum-perimeter rectangles in polygons. - Yujin Choi; Seungjun Lee; Hee-Kap Ahn (Comput. Geom., 2021)

Shortest rectilinear path queries to rectangles in a rectangular domain. - Mincheol Kim; Sang Duk Yoon; Hee-Kap Ahn (Comput. Geom., 2021)

Largest triangles in a polygon. - Seungjun Lee; Taekang Eom; Hee-Kap Ahn (Comput. Geom., 2021)

Approximating Convex Polygons by Histogons. - Jaehoon Chung; Sang Won Bae 001; Chan-Su Shin; Sang Duk Yoon; Hee-Kap Ahn (CCCG, 2022)

Uniformly Monotone Partitioning of Polygons Revisited. - Hwi Kim; Jaegun Lee; Hee-Kap Ahn (CCCG, 2022)

Inscribing or Circumscribing a Histogon to a Convex Polygon. - Jaehoon Chung; Sang Won Bae 001; Chan-Su Shin; Sang Duk Yoon; Hee-Kap Ahn (FSTTCS, 2022)

Rearranging a sequence of points onto a line. - Taehoon Ahn 001; Jongmin Choi; Chaeyoon Chung; Hee-Kap Ahn; Sang Won Bae 001; Sang Duk Yoon (Comput. Geom., 2022)

CGTA Awards. - Hee-Kap Ahn; Tamara Mtsentlintze; Jörg-Rüdiger Sack (Comput. Geom., 2022)

Minimum-link shortest paths for polygons amidst rectilinear obstacles. - Mincheol Kim; Hee-Kap Ahn (Comput. Geom., 2022)

Universal convex covering problems under translation and discrete rotations. - Mook Kwon Jung; Sang Duk Yoon; Hee-Kap Ahn; Takeshi Tokuyama (CoRR, 2022)

Universal convex covering problems under affine dihedral group actions. - Mook Kwon Jung; Sang Duk Yoon; Hee-Kap Ahn; Takeshi Tokuyama (CCCG, 2023)

Efficient k-Center Algorithms for Planar Points in Convex Position. - Jongmin Choi; Jaegun Lee; Hee-Kap Ahn (WADS, 2023)

Covering convex polygons by two congruent disks. - Jongmin Choi; Dahye Jeong; Hee-Kap Ahn (Comput. Geom., 2023)

Intersecting disks using two congruent disks. - Byeonguk Kang; Jongmin Choi; Hee-Kap Ahn (Comput. Geom., 2023)

Rectangular partitions of a rectilinear polygon. - Hwi Kim; Jaegun Lee; Hee-Kap Ahn (Comput. Geom., 2023)

Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. - Mincheol Kim; Chanyang Seo; Taehoon Ahn 001; Hee-Kap Ahn (Algorithmica, 2023)

A linear-time algorithm for the center problem in weighted cycle graphs. - Taekang Eom; Hee-Kap Ahn (Inf. Process. Lett., 2024)

Uniformly monotone partitioning of polygons. - Hwi Kim; Jaegun Lee; Hee-Kap Ahn (Theor. Comput. Sci., 2024)

Maximum Coverage by k Lines. - Chaeyoon Chung; Antoine Vigneron; Hee-Kap Ahn (Symmetry, 2024)

Stacking Monotone Polytopes. - Hee-Kap Ahn; Seung Joon Lee; Sang Duk Yoon (Symmetry, 2024)

Guarding Terrains with Guards on a Line. - Byeonguk Kang; Hwi Kim; Hee-Kap Ahn (IWOCA, 2025)

Monotone Partitions of Simple Polygons. - Jaegun Lee; Hyojeong An; Hwi Kim; Hee-Kap Ahn (IWOCA, 2025)

Minimum Convex Hull and Maximum Overlap of Two Convex Polytopes. - Mook Kwon Jung; Seokyun Kang; Hee-Kap Ahn (SODA, 2025)

Minimum-width double-slabs and widest empty slabs in high dimensions. - Taehoon Ahn 001; Chaeyoon Chung; Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Sang Duk Yoon (Comput. Geom., 2025)

Parallel line centers with guaranteed separation. - Chaeyoon Chung; Taehoon Ahn 001; Sang Won Bae 001; Hee-Kap Ahn (Comput. Geom., 2025)

Largest unit rectangles inscribed in a convex polygon. - Jaehoon Chung; Sang Won Bae 001; Chan-Su Shin; Sang Duk Yoon; Hee-Kap Ahn (Comput. Geom., 2025)

Guarding points on a terrain by watchtowers. - Byeonguk Kang; Junhyeok Choi; Jeesun Han; Hee-Kap Ahn (Comput. Geom., 2026)