default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHee-Kap Ahn
Person information
- affiliation: POSTECH, Pohang, Korea
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j69]Taekang Eom, Hee-Kap Ahn:
A linear-time algorithm for the center problem in weighted cycle graphs. Inf. Process. Lett. 186: 106495 (2024)- [j68]Chaeyoon Chung
, Antoine Vigneron, Hee-Kap Ahn:
Maximum Coverage by k Lines. Symmetry 16(2): 206 (2024) - [j67]Hee-Kap Ahn, Seung Joon Lee, Sang Duk Yoon:
Stacking Monotone Polytopes. Symmetry 16(9): 1246 (2024) - [j66]Hwi Kim, Jaegun Lee, Hee-Kap Ahn:
Uniformly monotone partitioning of polygons. Theor. Comput. Sci. 1012: 114724 (2024) - [c79]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: 303-317 - 2023
- [j65]Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn:
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. Algorithmica 85(8): 2214-2237 (2023) - [j64]Jongmin Choi, Dahye Jeong, Hee-Kap Ahn:
Covering convex polygons by two congruent disks. Comput. Geom. 109: 101936 (2023) - [j63]Hwi Kim, Jaegun Lee, Hee-Kap Ahn:
Rectangular partitions of a rectilinear polygon. Comput. Geom. 110: 101965 (2023) - [j62]Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn:
Intersecting disks using two congruent disks. Comput. Geom. 110: 101966 (2023) - [c78]Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn:
Parallel Line Centers with Guaranteed Separation. CCCG 2023: 153-159 - [c77]Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama:
Universal convex covering problems under affine dihedral group actions. CCCG 2023: 299-305 - [c76]Jongmin Choi, Jaegun Lee, Hee-Kap Ahn:
Efficient k-Center Algorithms for Planar Points in Convex Position. WADS 2023: 262-274 - 2022
- [j61]Mincheol Kim, Hee-Kap Ahn:
Minimum-link shortest paths for polygons amidst rectilinear obstacles. Comput. Geom. 103: 101858 (2022) - [j60]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: 101887 (2022) - [j59]Hee-Kap Ahn, Tamara Mtsentlintze, Jörg-Rüdiger Sack:
CGTA Awards. Comput. Geom. 107: 101896 (2022) - [c75]Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn:
Approximating Convex Polygons by Histogons. CCCG 2022: 75-82 - [c74]Hwi Kim, Jaegun Lee, Hee-Kap Ahn:
Uniformly Monotone Partitioning of Polygons Revisited. CCCG 2022: 212-218 - [c73]Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn:
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. SoCG 2022: 51:1-51:15 - [c72]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: 13:1-13:16 - [i31]Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn:
Farthest-point Voronoi diagrams in the presence of rectangular obstacles. CoRR abs/2203.03198 (2022) - [i30]Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama:
Universal convex covering problems under translation and discrete rotations. CoRR abs/2211.14807 (2022) - 2021
- [j58]Jongmin Choi, Sergio Cabello, Hee-Kap Ahn:
Maximizing Dominance in the Plane and its Applications. Algorithmica 83(11): 3491-3513 (2021) - [j57]Yujin Choi, Seungjun Lee, Hee-Kap Ahn:
Maximum-area and maximum-perimeter rectangles in polygons. Comput. Geom. 94: 101710 (2021) - [j56]Jongmin Choi, Hee-Kap Ahn:
Efficient planar two-center algorithms. Comput. Geom. 97: 101768 (2021) - [j55]Seungjun Lee, Taekang Eom, Hee-Kap Ahn:
Largest triangles in a polygon. Comput. Geom. 98: 101792 (2021) - [j54]Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn:
Shortest rectilinear path queries to rectangles in a rectangular domain. Comput. Geom. 99: 101796 (2021) - [c71]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: 36-46 - [c70]Mincheol Kim, Hee-Kap Ahn:
Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles. CCCG 2021: 200-210 - [c69]Taekang Eom, Seungjun Lee, Hee-Kap Ahn:
Largest Similar Copies of Convex Polygons in Polygonal Domains. FSTTCS 2021: 19:1-19:13 - [c68]Jongmin Choi, Dahye Jeong, Hee-Kap Ahn:
Covering Convex Polygons by Two Congruent Disks. IWOCA 2021: 165-178 - [c67]Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn:
Intersecting Disks Using Two Congruent Disks. IWOCA 2021: 400-413 - [e2]Hee-Kap Ahn, Kunihiko Sadakane:
32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan. LIPIcs 212, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-214-3 [contents] - [i29]Jongmin Choi, Dahye Jeong, Hee-Kap Ahn:
Covering Convex Polygons by Two Congruent Disks. CoRR abs/2105.02483 (2021) - [i28]Mincheol Kim, Hee-Kap Ahn:
Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles. CoRR abs/2106.14185 (2021) - [i27]Hwi Kim, Jaegun Lee, Hee-Kap Ahn:
Rectangular Partitions of a Rectilinear Polygon. CoRR abs/2111.01970 (2021) - 2020
- [j53]Eunjin Oh, Luis Barba, Hee-Kap Ahn:
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon. Algorithmica 82(5): 1434-1473 (2020) - [j52]Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk:
Middle curves based on discrete Fréchet distance. Comput. Geom. 89: 101621 (2020) - [j51]Eunjin Oh, Hee-Kap Ahn:
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. Discret. Comput. Geom. 63(2): 418-454 (2020) - [c66]Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn:
Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain. LATIN 2020: 271-282 - [i26]Jong Min Choi, Hee-Kap Ahn:
Efficient Planar Two-Center Algorithms. CoRR abs/2006.10365 (2020) - [i25]Seungjun Lee, Taekang Eom, Hee-Kap Ahn:
Largest triangles in a polygon. CoRR abs/2007.12330 (2020) - [i24]Taekang Eom, Seungjun Lee, Hee-Kap Ahn:
Largest similar copies of convex polygons amidst polygonal obstacles. CoRR abs/2012.06978 (2020)
2010 – 2019
- 2019
- [j50]Eunjin Oh, Hee-Kap Ahn:
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms. Algorithmica 81(7): 2829-2856 (2019) - [j49]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: 40-50 (2019) - [j48]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: 23-39 (2019) - [j47]Eunjin Oh, Hee-Kap Ahn:
Assigning weights to minimize the covering radius in the plane. Comput. Geom. 81: 22-32 (2019) - [j46]Eunjin Oh, Sang Won Bae, Hee-Kap Ahn:
Computing a geodesic two-center of points in a simple polygon. Comput. Geom. 82: 45-59 (2019) - [j45]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet problems: Minimizing distance-to-sight. Comput. Geom. 84: 12-21 (2019) - [j44]Eunjin Oh, Hee-Kap Ahn:
Finding pairwise intersections of rectangles in a query rectangle. Comput. Geom. 85 (2019) - [j43]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: 16-23 (2019) - [j42]Eunjin Oh, Hee-Kap Ahn:
Computing the center region and its variants. Theor. Comput. Sci. 789: 2-12 (2019) - [c65]Yujin Choi, Seungjun Lee, Hee-Kap Ahn:
Maximum-Area Rectangles in a Simple Polygon. FSTTCS 2019: 12:1-12:14 - [c64]Jong Min Choi, Sergio Cabello, Hee-Kap Ahn:
Maximizing Dominance in the Plane and Its Applications. WADS 2019: 325-338 - [i23]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. CoRR abs/1906.01114 (2019) - [i22]Yujin Choi, Seungjun Lee, Hee-Kap Ahn:
Maximum-Area Rectangles in a Simple Polygon. CoRR abs/1910.08686 (2019) - [i21]Eunjin Oh, Hee-Kap Ahn:
Polygon Queries for Convex Hulls of Points. CoRR abs/1910.08717 (2019) - [i20]Eunjin Oh, Hee-Kap Ahn:
Computing the Center Region and Its Variants. CoRR abs/1910.12169 (2019) - [i19]Eunjin Oh, Sang Won Bae, Hee-Kap Ahn:
Computing a Geodesic Two-Center of Points in a Simple Polygon. CoRR abs/1910.12177 (2019) - 2018
- [j41]Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn:
The geodesic 2-center problem in a simple polygon. Comput. Geom. 74: 21-37 (2018) - [j40]Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn:
Geometric matching algorithms for two realistic terrains. Theor. Comput. Sci. 715: 60-70 (2018) - [c63]Yoonho Hwang, Mooyeol Baek, Saehoon Kim, Bohyung Han, Hee-Kap Ahn:
Product Quantized Translation for Fast Nearest Neighbor Search. AAAI 2018: 3295-3301 - [c62]Eunjin Oh, Hee-Kap Ahn:
Polygon Queries for Convex Hulls of Points. COCOON 2018: 143-155 - [c61]Eunjin Oh, Hee-Kap Ahn:
Approximate Range Queries for Clustering. SoCG 2018: 62:1-62:14 - [c60]Eunjin Oh, Hee-Kap Ahn:
Point Location in Dynamic Planar Subdivisions. SoCG 2018: 63:1-63:14 - [c59]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: 577-599 - [c58]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. SWAT 2018: 6:1-6:13 - [c57]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: 44-55 - [c56]Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh:
Minimum-Width Square Annulus Intersecting Polygons. WALCOM 2018: 56-67 - [i18]Eunjin Oh, Hee-Kap Ahn:
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. CoRR abs/1801.02292 (2018) - [i17]Eunjin Oh, Hee-Kap Ahn:
Finding Pairwise Intersections of Rectangles in a Query Rectangle. CoRR abs/1801.07362 (2018) - [i16]Eunjin Oh, Luis Barba, Hee-Kap Ahn:
The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon. CoRR abs/1802.06223 (2018) - [i15]Eunjin Oh, Hee-Kap Ahn:
Approximate Range Queries for Clustering. CoRR abs/1803.03978 (2018) - [i14]Eunjin Oh, Hee-Kap Ahn:
Point Location in Dynamic Planar Subdivisions. CoRR abs/1803.04325 (2018) - [i13]Eunjin Oh, Hee-Kap Ahn:
Assigning Weights to Minimize the Covering Radius in the Plane. CoRR abs/1804.00241 (2018) - 2017
- [j39]Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn:
Top-k Manhattan spatial skyline queries. Inf. Process. Lett. 123: 27-35 (2017) - [j38]Sang Duk Yoon, Hee-Kap Ahn, Jessica Sherette:
Realistic roofs without local minimum edges over a rectilinear polygon. Theor. Comput. Sci. 675: 15-26 (2017) - [c55]Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri:
A Time-Space Trade-Off for Triangulations of Points in the Plane. COCOON 2017: 3-12 - [c54]Eunjin Oh, Hee-Kap Ahn:
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons. SoCG 2017: 51:1-51:15 - [c53]Eunjin Oh, Hee-Kap Ahn:
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. SoCG 2017: 52:1-52:15 - [c52]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: 3:1-3:13 - [c51]Eunjin Oh, Hee-Kap Ahn:
Finding Pairwise Intersections of Rectangles in a Query Rectangle. ISAAC 2017: 60:1-60:12 - [c50]Eunjin Oh, Hee-Kap Ahn:
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. ISAAC 2017: 61:1-61:12 - [c49]Jong Min Choi, Dongwoo Park, Hee-Kap Ahn:
Bundling Two Simple Polygons to Minimize Their Convex Hull. WALCOM 2017: 66-77 - [c48]Eunjin Oh, Hee-Kap Ahn:
Computing the Center Region and Its Variants. WALCOM 2017: 254-265 - [i12]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 abs/1704.07580 (2017) - [i11]Eunjin Oh, Hee-Kap Ahn:
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. CoRR abs/1709.09932 (2017) - [i10]Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn:
The Geodesic 2-center Problem in a Simple Polygon. CoRR abs/1710.09035 (2017) - [i9]Naoki Katoh, Hee-Kap Ahn, Subhas C. Nandy:
Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [j37]Hee-Kap Ahn, Chan-Su Shin:
Guest Editor's Foreword. Algorithmica 76(4): 1158-1159 (2016) - [j36]Dongwoo Park, Sang Won Bae, Helmut Alt, Hee-Kap Ahn:
Bundling three convex polygons to minimize area or perimeter. Comput. Geom. 51: 1-14 (2016) - [j35]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): 836-859 (2016) - [c47]Eunjin Oh, Luis Barba, Hee-Kap Ahn:
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon. SoCG 2016: 56:1-56:15 - [c46]Eunjin Oh, Hee-Kap Ahn:
Assigning Weights to Minimize the Covering Radius in the Plane. ISAAC 2016: 58:1-58:12 - [c45]Eunjin Oh, Hee-Kap Ahn:
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree. ISAAC 2016: 59:1-59:12 - [c44]Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk:
A Middle Curve Based on Discrete Fréchet Distance. LATIN 2016: 14-26 - [c43]Eunjin Oh, Sang Won Bae, Hee-Kap Ahn:
Computing a Geodesic Two-Center of Points in a Simple Polygon. LATIN 2016: 646-658 - [c42]Eunjin Oh, Wanbin Son, Hee-Kap Ahn:
Constrained Geodesic Centers of a Simple Polygon. SWAT 2016: 29:1-29:13 - 2015
- [j34]Sang-Sub Kim, Hee-Kap Ahn:
An improved data stream algorithm for clustering. Comput. Geom. 48(9): 635-645 (2015) - [j33]Wanbin Son, Sang Won Bae, Hee-Kap Ahn:
Group nearest-neighbor queries in the L1 plane. Theor. Comput. Sci. 592: 39-48 (2015) - [c41]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: 209-223 - [c40]Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn:
Geometric Matching Algorithms for Two Realistic Terrains. ISAAC 2015: 285-295 - [c39]Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn:
The 2-Center Problem in a Simple Polygon. ISAAC 2015: 307-317 - [i8]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 abs/1501.00561 (2015) - 2014
- [j32]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. Algorithmica 70(2): 152-170 (2014) - [j31]Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon:
Overlap of convex polytopes under rigid motion. Comput. Geom. 47(1): 15-24 (2014) - [j30]Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son:
Computing k Centers over Streaming Data for Small k. Int. J. Comput. Geom. Appl. 24(2): 107-124 (2014) - [j29]Hee-Kap Ahn, Antoine Vigneron:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 24(4): 259-260 (2014) - [j28]Wanbin Son, Seung-won Hwang, Hee-Kap Ahn:
MSSQ: Manhattan Spatial Skyline Queries. Inf. Syst. 40: 67-83 (2014) - [c38]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin:
Minimum Convex Container of Two Convex Polytopes under Translations. CCCG 2014 - [c37]Sang-Sub Kim, Hee-Kap Ahn:
An Improved Data Stream Algorithm for Clustering. LATIN 2014: 273-284 - [c36]Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn:
Top-k Manhattan Spatial Skyline Queries. WALCOM 2014: 22-33 - [e1]Hee-Kap Ahn, Chan-Su Shin:
Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings. Lecture Notes in Computer Science 8889, Springer 2014, ISBN 978-3-319-13074-3 [contents] - 2013
- [j27]Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron:
Covering and piercing disks with two centers. Comput. Geom. 46(3): 253-262 (2013) - [j26]Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher:
Maximum overlap of convex polytopes under translation. Comput. Geom. 46(5): 552-565 (2013) - [j25]Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron:
Realistic roofs over a rectilinear polygon. Comput. Geom. 46(9): 1042-1055 (2013) - [c35]Hee-Kap Ahn, Sang Won Bae, Wanbin Son:
Group Nearest Neighbor Queries in the L 1 Plane. TAMC 2013: 52-61 - [c34]Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park:
Bundling Three Convex Polygons to Minimize Area or Perimeter. WADS 2013: 13-24 - 2012
- [j24]Hee-Kap Ahn, Otfried Cheong:
Aligning Two Convex Figures to Minimize Area or Perimeter. Algorithmica 62(1-2): 464-479 (2012) - [j23]Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron:
Reachability by paths of bounded curvature in a convex polygon. Comput. Geom. 45(1-2): 21-32 (2012) - [j22]Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron:
Computing the Discrete FRéChet Distance with Imprecise Input. Int. J. Comput. Geom. Appl. 22(1): 27-44 (2012) - [c33]Yoonho Hwang, Bohyung Han, Hee-Kap Ahn:
A fast nearest neighbor search algorithm by nonlinear embedding. CVPR 2012: 3053-3060 - [c32]Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon:
Overlap of Convex Polytopes under Rigid Motion. FSTTCS 2012: 498-509 - [c31]Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son:
Computing k-center over Streaming Data for Small k. ISAAC 2012: 54-63 - [c30]Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa:
Rectilinear Covering for Imprecise Input Points - (Extended Abstract). ISAAC 2012: 309-318 - [c29]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. LATIN 2012: 1-12 - [i7]Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron:
Covering and Piercing Disks with Two Centers. CoRR abs/1201.1198 (2012) - [i6]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. CoRR abs/1209.2171 (2012) - 2011
- [j21]Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son:
Covering points by disjoint boxes with outliers. Comput. Geom. 44(3): 178-190 (2011) - [j20]Hee-Kap Ahn, Sang Won Bae, Marc J. van Kreveld, Iris Reinbacher, Bettina Speckmann:
Empty pseudo-triangles in point sets. Discret. Appl. Math. 159(18): 2205-2213 (2011) - [j19]Mu-Woong Lee, Wanbin Son, Hee-Kap Ahn, Seung-won Hwang:
Spatial skyline queries: exact and approximation algorithms. GeoInformatica 15(4): 665-697 (2011) - [j18]Hee-Kap Ahn, Yoshio Okamoto:
Adaptive Algorithms for Planar Convex Hull Problems. IEICE Trans. Inf. Syst. 94-D(2): 182-189 (2011) - [j17]Sang-Sub Kim, Sang Won Bae, Hee-Kap Ahn:
Covering a Point Set by Two Disjoint Rectangles. Int. J. Comput. Geom. Appl. 21(3): 313-330 (2011) - [c28]Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron:
Covering and Piercing Disks with Two Centers. ISAAC 2011: 50-59 - [c27]Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron:
Generating Realistic Roofs over a Rectilinear Polygon. ISAAC 2011: 60-69 - [c26]Yoonho Hwang, Hee-Kap Ahn:
Convergent Bounds on the Euclidean Distance. NIPS 2011: 388-396 - [c25]Wanbin Son, Seung-won Hwang, Hee-Kap Ahn:
MSSQ: Manhattan Spatial Skyline Queries. SSTD 2011: 313-329 - 2010
- [j16]Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin:
Covering a simple polygon by monotone directions. Comput. Geom. 43(5): 514-523 (2010) - [j15]Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles. Int. J. Comput. Geom. Appl. 20(1): 69-87 (2010) - [c24]Hee-Kap Ahn, Yoshio Okamoto:
Adaptive Algorithms for Planar Convex Hull Problems. FAW 2010: 316-326 - [c23]Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher:
Maximum Overlap of Convex Polytopes under Translation. ISAAC (2) 2010: 97-108 - [c22]Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron:
Computing the Discrete Fréchet Distance with Imprecise Input. ISAAC (2) 2010: 422-433 - [i5]Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron:
Reachability by Paths of Bounded Curvature in a Convex Polygon. CoRR abs/1008.4244 (2010)
2000 – 2009
- 2009
- [j14]Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa:
Casting an Object with a Core. Algorithmica 54(1): 72-88 (2009) - [j13]Hee-Kap Ahn, Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
On the minimum total length of interval systems expressing all intervals, and range-restricted queries. Comput. Geom. 42(3): 207-213 (2009) - [j12]Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa:
Computing minimum-area rectilinear convex hull and L-shape. Comput. Geom. 42(9): 903-912 (2009) - [j11]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20(1): 3-23 (2009) - [c21]Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher:
Optimal Empty Pseudo-Triangles in a Point Set. CCCG 2009: 5-8 - [c20]Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son:
Square and Rectangle Covering with Outliers. FAW 2009: 132-140 - [c19]Wanbin Son, Mu-Woong Lee, Hee-Kap Ahn, Seung-won Hwang:
Spatial Skyline Queries: An Efficient Geometric Algorithm. SSTD 2009: 247-264 - [i4]Wanbin Son, Mu-Woong Lee, Hee-Kap Ahn, Seung-won Hwang:
Spatial Skyline Queries: An Efficient Geometric Algorithm. CoRR abs/0903.3072 (2009) - [i3]Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son:
Covering Points by Disjoint Boxes with Outliers. CoRR abs/0910.1643 (2009) - 2008
- [j10]Hee-Kap Ahn, Peter Brass, Chan-Su Shin:
Maximum overlap and minimum convex hull of two convex polyhedra under translations. Comput. Geom. 40(2): 171-177 (2008) - [j9]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-Angle and Hausdorff-Approximation of Convex Figures. Discret. Comput. Geom. 40(3): 414-429 (2008) - [c18]Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin:
Covering a Simple Polygon by Monotone Directions. ISAAC 2008: 668-679 - [c17]Hee-Kap Ahn, Sang Won Bae:
Covering a Point Set by Two Disjoint Rectangles. ISAAC 2008: 728-739 - 2007
- [j8]Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron:
Maximizing the overlap of two planar convex sets under rigid motions. Comput. Geom. 37(1): 3-15 (2007) - [c16]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. CATS 2007: 7-14 - [c15]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-angle and Hausdorff-approximation of convex figures. SCG 2007: 37-45 - [c14]Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang:
Dilation-Optimal Edge Deletion in Polygonal Cycles. ISAAC 2007: 88-99 - [c13]Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa:
Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations. ISAAC 2007: 788-799 - [i2]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-Angle and Hausdorff-Approximation of Convex Figures. CoRR abs/cs/0702090 (2007) - [i1]Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. CoRR abs/cs/0703037 (2007) - 2006
- [j7]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong:
Casting with Skewed Ejection Direction. Algorithmica 44(4): 325-342 (2006) - [j6]Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. Comput. Geom. 33(3): 152-164 (2006) - 2005
- [c12]Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron:
Maximizing the overlap of two planar convex sets under rigid motions. SCG 2005: 356-363 - [c11]Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa:
Casting an Object with a Core. ISAAC 2005: 40-49 - [c10]Hee-Kap Ahn, Otfried Cheong:
Stacking and Bundling Two Convex Polygons. ISAAC 2005: 882-891 - 2004
- [j5]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink:
The reflex-free hull. Int. J. Comput. Geom. Appl. 14(6): 453-474 (2004) - [j4]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum:
Competitive facility location: the Voronoi game. Theor. Comput. Sci. 310(1-3): 457-467 (2004) - [c9]Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. COCOON 2004: 259-267 - 2003
- [j3]Hee-Kap Ahn, Otfried Cheong, Chan-Su Shin:
Building bridges between convex region. Comput. Geom. 25(1-2): 161-170 (2003) - [j2]Hee-Kap Ahn, Otfried Cheong, René van Oostrum:
Casting a polyhedron with directional uncertainty. Comput. Geom. 26(2): 129-141 (2003) - 2002
- [j1]Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an object from its cast. Comput. Aided Des. 34(8): 547-559 (2002) - [c8]Hee-Kap Ahn, Otfried Cheong, René van Oostrum:
Casting a Polyhedron with Directional Uncertainty. ISAAC 2002: 274-285 - 2001
- [c7]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink:
The reflex-free hull. CCCG 2001: 9-12 - [c6]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum:
Competitive Facility Location along a Highway. COCOON 2001: 237-246 - 2000
- [c5]Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin:
Flipping your Lid. CCCG 2000 - [c4]Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron:
Reachability by paths of bounded curvature in convex polygons. SCG 2000: 251-259
1990 – 1999
- 1999
- [c3]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong:
Casting with skewed ejection direction revisited. CCCG 1999 - 1998
- [c2]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong:
Casting with Skewed Ejection Direction. ISAAC 1998: 139-148 - 1997
- [c1]Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an Object from its Cast. SCG 1997: 221-230
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
