Hee-Kap Ahn

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 94

Top Venues

Publications

Chaeyoon Chung, Antoine Vigneron, Hee-Kap Ahn
Maximum Coverage by k Lines. Symmetry 16 (2) (2024)
Taehoon Ahn, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Sang Duk Yoon
Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions. LATIN (1) (2024)
Hwi Kim, Jaegun Lee, Hee-Kap Ahn
Uniformly monotone partitioning of polygons. Theor. Comput. Sci. 1012 (2024)
Jongmin Choi, Dahye Jeong, Hee-Kap Ahn
Covering convex polygons by two congruent disks. Comput. Geom. 109 (2023)
Jongmin Choi, Jaegun Lee, Hee-Kap Ahn
Efficient k-Center Algorithms for Planar Points in Convex Position. WADS (2023)
Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama
Universal convex covering problems under affine dihedral group actions. CCCG (2023)
Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn
Parallel Line Centers with Guaranteed Separation. CCCG (2023)
Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn
Intersecting disks using two congruent disks. Comput. Geom. 110 (2023)
Hwi Kim, Jaegun Lee, Hee-Kap Ahn
Rectangular partitions of a rectilinear polygon. Comput. Geom. 110 (2023)
Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. Algorithmica 85 (8) (2023)
Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn
Inscribing or Circumscribing a Histogon to a Convex Polygon. FSTTCS (2022)
Mincheol Kim, Hee-Kap Ahn
Minimum-link shortest paths for polygons amidst rectilinear obstacles. Comput. Geom. 103 (2022)
Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama
Universal convex covering problems under translation and discrete rotations. CoRR (2022)
Hee-Kap Ahn, Tamara Mtsentlintze, Jörg-Rüdiger Sack
CGTA Awards. Comput. Geom. 107 (2022)
Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. SoCG (2022)
Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn
Farthest-point Voronoi diagrams in the presence of rectangular obstacles. CoRR (2022)
Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon
Rearranging a sequence of points onto a line. Comput. Geom. 107 (2022)
Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn
Approximating Convex Polygons by Histogons. CCCG (2022)
Hwi Kim, Jaegun Lee, Hee-Kap Ahn
Uniformly Monotone Partitioning of Polygons Revisited. CCCG (2022)
Jongmin Choi, Dahye Jeong, Hee-Kap Ahn
Covering Convex Polygons by Two Congruent Disks. IWOCA (2021)
Hwi Kim, Jaegun Lee, Hee-Kap Ahn
Rectangular Partitions of a Rectilinear Polygon. CoRR (2021)
Mincheol Kim, Hee-Kap Ahn
Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles. CCCG (2021)
Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn
Intersecting Disks Using Two Congruent Disks. IWOCA (2021)
Jongmin Choi, Sergio Cabello, Hee-Kap Ahn
Maximizing Dominance in the Plane and its Applications. Algorithmica 83 (11) (2021)
Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon
Rearranging a Sequence of Points onto a Line. CCCG (2021)
Taekang Eom, Seungjun Lee, Hee-Kap Ahn
Largest Similar Copies of Convex Polygons in Polygonal Domains. FSTTCS (2021)
Mincheol Kim, Hee-Kap Ahn
Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles. CoRR (2021)
Yujin Choi, Seungjun Lee, Hee-Kap Ahn
Maximum-area and maximum-perimeter rectangles in polygons. Comput. Geom. 94 (2021)
Jongmin Choi, Dahye Jeong, Hee-Kap Ahn
Covering Convex Polygons by Two Congruent Disks. CoRR (2021)
Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn
Shortest rectilinear path queries to rectangles in a rectangular domain. Comput. Geom. 99 (2021)
Jongmin Choi, Hee-Kap Ahn
Efficient planar two-center algorithms. Comput. Geom. 97 (2021)
Seungjun Lee, Taekang Eom, Hee-Kap Ahn
Largest triangles in a polygon. Comput. Geom. 98 (2021)
Jong Min Choi, Hee-Kap Ahn
Efficient Planar Two-Center Algorithms. CoRR (2020)
Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn
Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain. LATIN (2020)
Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
Middle curves based on discrete Fréchet distance. Comput. Geom. 89 (2020)
Eunjin Oh, Luis Barba, Hee-Kap Ahn
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon. Algorithmica 82 (5) (2020)
Seungjun Lee, Taekang Eom, Hee-Kap Ahn
Largest triangles in a polygon. CoRR (2020)
Eunjin Oh, Hee-Kap Ahn
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. Discret. Comput. Geom. 63 (2) (2020)
Taekang Eom, Seungjun Lee, Hee-Kap Ahn
Largest similar copies of convex polygons amidst polygonal obstacles. CoRR (2020)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. CoRR (2019)
Eunjin Oh, Hee-Kap Ahn
Computing the Center Region and Its Variants. CoRR (2019)
Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
Computing a Geodesic Two-Center of Points in a Simple Polygon. CoRR (2019)
Eunjin Oh, Hee-Kap Ahn
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms. Algorithmica 81 (7) (2019)
Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
Computing a geodesic two-center of points in a simple polygon. Comput. Geom. 82 (2019)
Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
Faster algorithms for growing prioritized disks and rectangles. Comput. Geom. 80 (2019)
Eunjin Oh, Hee-Kap Ahn
Assigning weights to minimize the covering radius in the plane. Comput. Geom. 81 (2019)
Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon
Minimum-width annulus with outliers: Circular, square, and rectangular cases. Inf. Process. Lett. 145 (2019)
Yujin Choi, Seungjun Lee, Hee-Kap Ahn
Maximum-Area Rectangles in a Simple Polygon. CoRR (2019)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
On Romeo and Juliet problems: Minimizing distance-to-sight. Comput. Geom. 84 (2019)
Jong Min Choi, Sergio Cabello, Hee-Kap Ahn
Maximizing Dominance in the Plane and Its Applications. WADS (2019)
Hee-Kap Ahn, Judit Abardia, Sang Won Bae, Otfried Cheong, Susanna Dann, Dongwoo Park, Chan-Su Shin
The minimum convex container of two convex polytopes under translations. Comput. Geom. 77 (2019)
Eunjin Oh, Hee-Kap Ahn
Finding pairwise intersections of rectangles in a query rectangle. Comput. Geom. 85 (2019)
Eunjin Oh, Hee-Kap Ahn
Polygon Queries for Convex Hulls of Points. CoRR (2019)
Eunjin Oh, Hee-Kap Ahn
Computing the center region and its variants. Theor. Comput. Sci. 789 (2019)
Yujin Choi, Seungjun Lee, Hee-Kap Ahn
Maximum-Area Rectangles in a Simple Polygon. FSTTCS (2019)
Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. WALCOM (2018)
Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh
Minimum-Width Square Annulus Intersecting Polygons. WALCOM (2018)
Eunjin Oh, Hee-Kap Ahn
Assigning Weights to Minimize the Covering Radius in the Plane. CoRR (2018)
Eunjin Oh, Hee-Kap Ahn
Approximate Range Queries for Clustering. SoCG (2018)
Yoonho Hwang, Mooyeol Baek, Saehoon Kim, Bohyung Han, Hee-Kap Ahn
Product Quantized Translation for Fast Nearest Neighbor Search. AAAI (2018)
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
The geodesic 2-center problem in a simple polygon. Comput. Geom. 74 (2018)
Eunjin Oh, Hee-Kap Ahn
Point Location in Dynamic Planar Subdivisions. CoRR (2018)
Eunjin Oh, Hee-Kap Ahn
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. CoRR (2018)
Eunjin Oh, Hee-Kap Ahn
Finding Pairwise Intersections of Rectangles in a Query Rectangle. CoRR (2018)
Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn
Geometric matching algorithms for two realistic terrains. Theor. Comput. Sci. 715 (2018)
Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. SWAT (2018)
Eunjin Oh, Hee-Kap Ahn
Polygon Queries for Convex Hulls of Points. COCOON (2018)
Eunjin Oh, Hee-Kap Ahn
Approximate Range Queries for Clustering. CoRR (2018)
Jeong-Han Yun, Yoonho Hwang, Woomyo Lee, Hee-Kap Ahn, Sin-Kyu Kim
Statistical Similarity of Critical Infrastructure Network Traffic Based on Nearest Neighbor Distances. RAID (2018)
Eunjin Oh, Hee-Kap Ahn
Point Location in Dynamic Planar Subdivisions. SoCG (2018)
Eunjin Oh, Luis Barba, Hee-Kap Ahn
The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon. CoRR (2018)
Eunjin Oh, Hee-Kap Ahn
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. ISAAC (2017)
Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri
A Time-Space Trade-Off for Triangulations of Points in the Plane. COCOON (2017)
Eunjin Oh, Hee-Kap Ahn
Finding Pairwise Intersections of Rectangles in a Query Rectangle. ISAAC (2017)
Eunjin Oh, Hee-Kap Ahn
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. CoRR (2017)
Eunjin Oh, Hee-Kap Ahn
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. SoCG (2017)
Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn
Top-k Manhattan spatial skyline queries. Inf. Process. Lett. 123 (2017)
Naoki Katoh, Hee-Kap Ahn, Subhas C. Nandy
Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16). NII Shonan Meet. Rep. 2017 (2017)
Eunjin Oh, Hee-Kap Ahn
Computing the Center Region and Its Variants. WALCOM (2017)
Eunjin Oh, Hee-Kap Ahn
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons. SoCG (2017)
Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
Faster Algorithms for Growing Prioritized Disks and Rectangles. CoRR (2017)
Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
Faster Algorithms for Growing Prioritized Disks and Rectangles. ISAAC (2017)
Jong Min Choi, Dongwoo Park, Hee-Kap Ahn
Bundling Two Simple Polygons to Minimize Their Convex Hull. WALCOM (2017)
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
The Geodesic 2-center Problem in a Simple Polygon. CoRR (2017)
Sang Duk Yoon, Hee-Kap Ahn, Jessica Sherette
Realistic roofs without local minimum edges over a rectilinear polygon. Theor. Comput. Sci. 675 (2017)
Eunjin Oh, Luis Barba, Hee-Kap Ahn
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon. SoCG (2016)
Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
Computing a Geodesic Two-Center of Points in a Simple Polygon. LATIN (2016)
Eunjin Oh, Hee-Kap Ahn
Assigning Weights to Minimize the Covering Radius in the Plane. ISAAC (2016)
Eunjin Oh, Wanbin Son, Hee-Kap Ahn
Constrained Geodesic Centers of a Simple Polygon. SWAT (2016)
Dongwoo Park, Sang Won Bae, Helmut Alt, Hee-Kap Ahn
Bundling three convex polygons to minimize area or perimeter. Comput. Geom. 51 (2016)
Hee-Kap Ahn, Chan-Su Shin
Guest Editor's Foreword. Algorithmica 76 (4) (2016)
Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
A Middle Curve Based on Discrete Fréchet Distance. LATIN (2016)
Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. 56 (4) (2016)
Eunjin Oh, Hee-Kap Ahn
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree. ISAAC (2016)
Wanbin Son, Sang Won Bae, Hee-Kap Ahn
plane. Theor. Comput. Sci. 592 (2015)
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
The 2-Center Problem in a Simple Polygon. ISAAC (2015)
Sang-Sub Kim, Hee-Kap Ahn
An improved data stream algorithm for clustering. Comput. Geom. 48 (9) (2015)
Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
A linear-time algorithm for the geodesic center of a simple polygon. CoRR (2015)
Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. SoCG (2015)
Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn
Geometric Matching Algorithms for Two Realistic Terrains. ISAAC (2015)

Hee-Kap Ahn.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hee-Kap Ahn