Hee-Kap Ahn - RankMe

197 papers A* 10A 1B 40C 5Misc 6Journal 108Unranked 27

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Guarding points on a terrain by watchtowers. Comput. Geom. Byeonguk Kang, Junhyeok Choi, Jeesun Han, Hee-Kap Ahn
2026	J	`jnl`	Inscribed and circumscribed histogons of a convex polygon. Comput. Geom. Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn
2026	J	`jnl`	Largest similar copies of convex polygons in polygonal domains. Theor. Comput. Sci. Taekang Eom, Seungjun Lee, Hee-Kap Ahn
2026	B	`conf`	Shortcutting the Diameter of a Polygon. WALCOM Taekang Eom, Taehoon Ahn, Minju Song, Hee-Kap Ahn
2025	B	`conf`	Covering Weighted Points Using Unit Squares. ISAAC Chaeyoon Chung, Jaegun Lee, Hee-Kap Ahn
2025	B	`conf`	Farthest-Point Voronoi Diagrams in the Hilbert Metric. WADS Minju Song, Mook Kwon Jung, Hee-Kap Ahn
2025	C	`conf`	Guarding Terrains with Guards on a Line. IWOCA Byeonguk Kang, Hwi Kim, Hee-Kap Ahn
2025	J	`jnl`	Guarding Terrains with Guards on a Line. CoRR Byeonguk Kang, Hwi Kim, Hee-Kap Ahn
2025	J	`jnl`	Largest unit rectangles inscribed in a convex polygon. Comput. Geom. Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn
2025	A*	`conf`	Minimum Convex Hull and Maximum Overlap of Two Convex Polytopes. SODA Mook Kwon Jung, Seokyun Kang, Hee-Kap Ahn
2025	B	`conf`	Minimum Partition of Polygons Under Width and Cut Constraints. ISAAC Jaehoon Chung, Kazuo Iwama, Chung-Shou Liao, Hee-Kap Ahn
2025	J	`jnl`	Minimum Partition of Polygons under Width and Cut Constraints. CoRR Jaehoon Chung, Kazuo Iwama, Chung-Shou Liao, Hee-Kap Ahn
2025	J	`jnl`	Minimum-width double-slabs and widest empty slabs in high dimensions. Comput. Geom. Taehoon Ahn, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Sang Duk Yoon
2025	C	`conf`	Monotone Partitions of Simple Polygons. IWOCA Jaegun Lee, Hyojeong An, Hwi Kim, Hee-Kap Ahn
2025	J	`jnl`	Parallel line centers with guaranteed separation. Comput. Geom. Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn
2024	J	`jnl`	A linear-time algorithm for the center problem in weighted cycle graphs. Inf. Process. Lett. Taekang Eom, Hee-Kap Ahn
2024	—	`conf`	Guarding Points on a Terrain by Watchtowers. CCCG Byeonguk Kang, Junhyeok Choi, Jeesun Han, Hee-Kap Ahn
2024	J	`jnl`	Maximum Coverage by k Lines. Symmetry Chaeyoon Chung, Antoine Vigneron, Hee-Kap Ahn
2024	—	`conf`	Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions. LATIN (1) Taehoon Ahn, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Sang Duk Yoon
2024	J	`jnl`	Stacking Monotone Polytopes. Symmetry Hee-Kap Ahn, Seung Joon Lee, Sang Duk Yoon
2024	J	`jnl`	Uniformly monotone partitioning of polygons. Theor. Comput. Sci. Hwi Kim, Jaegun Lee, Hee-Kap Ahn
2023	J	`jnl`	Covering convex polygons by two congruent disks. Comput. Geom. Jongmin Choi, Dahye Jeong, Hee-Kap Ahn
2023	B	`conf`	Efficient k-Center Algorithms for Planar Points in Convex Position. WADS Jongmin Choi, Jaegun Lee, Hee-Kap Ahn
2023	J	`jnl`	Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. Algorithmica Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn
2023	J	`jnl`	Intersecting disks using two congruent disks. Comput. Geom. Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn
2023	—	`conf`	Parallel Line Centers with Guaranteed Separation. CCCG Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn
2023	J	`jnl`	Rectangular partitions of a rectilinear polygon. Comput. Geom. Hwi Kim, Jaegun Lee, Hee-Kap Ahn
2023	—	`conf`	Universal convex covering problems under affine dihedral group actions. CCCG Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama
2022	—	`conf`	Approximating Convex Polygons by Histogons. CCCG Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn
2022	J	`jnl`	CGTA Awards. Comput. Geom. Hee-Kap Ahn, Tamara Mtsentlintze, Jörg-Rüdiger Sack
2022	A*	`conf`	Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. SoCG Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn
2022	J	`jnl`	Farthest-point Voronoi diagrams in the presence of rectangular obstacles. CoRR Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn
2022	—	`conf`	Inscribing or Circumscribing a Histogon to a Convex Polygon. FSTTCS Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn
2022	J	`jnl`	Minimum-link shortest paths for polygons amidst rectilinear obstacles. Comput. Geom. Mincheol Kim, Hee-Kap Ahn
2022	J	`jnl`	Rearranging a sequence of points onto a line. Comput. Geom. Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon
2022	—	`conf`	Uniformly Monotone Partitioning of Polygons Revisited. CCCG Hwi Kim, Jaegun Lee, Hee-Kap Ahn
2022	J	`jnl`	Universal convex covering problems under translation and discrete rotations. CoRR Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama
2021	B	`ed.`	32nd International Symposium on Algorithms and Computation, ISAAC 2021, Fukuoka, Japan, December 6-8, 2021 ISAAC Hee-Kap Ahn, Kunihiko Sadakane
2021	C	`conf`	Covering Convex Polygons by Two Congruent Disks. IWOCA Jongmin Choi, Dahye Jeong, Hee-Kap Ahn
2021	J	`jnl`	Covering Convex Polygons by Two Congruent Disks. CoRR Jongmin Choi, Dahye Jeong, Hee-Kap Ahn
2021	J	`jnl`	Efficient planar two-center algorithms. Comput. Geom. Jongmin Choi, Hee-Kap Ahn
2021	C	`conf`	Intersecting Disks Using Two Congruent Disks. IWOCA Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn
2021	—	`conf`	Largest Similar Copies of Convex Polygons in Polygonal Domains. FSTTCS Taekang Eom, Seungjun Lee, Hee-Kap Ahn
2021	J	`jnl`	Largest triangles in a polygon. Comput. Geom. Seungjun Lee, Taekang Eom, Hee-Kap Ahn
2021	J	`jnl`	Maximizing Dominance in the Plane and its Applications. Algorithmica Jongmin Choi, Sergio Cabello, Hee-Kap Ahn
2021	J	`jnl`	Maximum-area and maximum-perimeter rectangles in polygons. Comput. Geom. Yujin Choi, Seungjun Lee, Hee-Kap Ahn
2021	—	`conf`	Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles. CCCG Mincheol Kim, Hee-Kap Ahn
2021	J	`jnl`	Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles. CoRR Mincheol Kim, Hee-Kap Ahn
2021	—	`conf`	Rearranging a Sequence of Points onto a Line. CCCG Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon
2021	J	`jnl`	Rectangular Partitions of a Rectilinear Polygon. CoRR Hwi Kim, Jaegun Lee, Hee-Kap Ahn
2021	J	`jnl`	Shortest rectilinear path queries to rectangles in a rectangular domain. Comput. Geom. Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn
2020	J	`jnl`	Efficient Planar Two-Center Algorithms. CoRR Jong Min Choi, Hee-Kap Ahn
2020	J	`jnl`	Largest similar copies of convex polygons amidst polygonal obstacles. CoRR Taekang Eom, Seungjun Lee, Hee-Kap Ahn
2020	J	`jnl`	Largest triangles in a polygon. CoRR Seungjun Lee, Taekang Eom, Hee-Kap Ahn
2020	J	`jnl`	Middle curves based on discrete Fréchet distance. Comput. Geom. Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
2020	B	`conf`	Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain. LATIN Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn
2020	J	`jnl`	The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon. Algorithmica Eunjin Oh, Luis Barba, Hee-Kap Ahn
2020	J	`jnl`	Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. Discret. Comput. Geom. Eunjin Oh, Hee-Kap Ahn
2019	J	`jnl`	A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms. Algorithmica Eunjin Oh, Hee-Kap Ahn
2019	J	`jnl`	Assigning weights to minimize the covering radius in the plane. Comput. Geom. Eunjin Oh, Hee-Kap Ahn
2019	J	`jnl`	Computing a Geodesic Two-Center of Points in a Simple Polygon. CoRR Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
2019	J	`jnl`	Computing a geodesic two-center of points in a simple polygon. Comput. Geom. Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
2019	J	`jnl`	Computing the Center Region and Its Variants. CoRR Eunjin Oh, Hee-Kap Ahn
2019	J	`jnl`	Computing the center region and its variants. Theor. Comput. Sci. Eunjin Oh, Hee-Kap Ahn
2019	J	`jnl`	Faster algorithms for growing prioritized disks and rectangles. Comput. Geom. Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
2019	J	`jnl`	Finding pairwise intersections of rectangles in a query rectangle. Comput. Geom. Eunjin Oh, Hee-Kap Ahn
2019	B	`conf`	Maximizing Dominance in the Plane and Its Applications. WADS Jong Min Choi, Sergio Cabello, Hee-Kap Ahn
2019	—	`conf`	Maximum-Area Rectangles in a Simple Polygon. FSTTCS Yujin Choi, Seungjun Lee, Hee-Kap Ahn
2019	J	`jnl`	Maximum-Area Rectangles in a Simple Polygon. CoRR Yujin Choi, Seungjun Lee, Hee-Kap Ahn
2019	J	`jnl`	Minimum-width annulus with outliers: Circular, square, and rectangular cases. Inf. Process. Lett. Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon
2019	J	`jnl`	On Romeo and Juliet Problems: Minimizing Distance-to-Sight. CoRR Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
2019	J	`jnl`	On Romeo and Juliet problems: Minimizing distance-to-sight. Comput. Geom. Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
2019	J	`jnl`	Polygon Queries for Convex Hulls of Points. CoRR Eunjin Oh, Hee-Kap Ahn
2019	J	`jnl`	The minimum convex container of two convex polytopes under translations. Comput. Geom. Hee-Kap Ahn, Judit Abardia, Sang Won Bae, Otfried Cheong, Susanna Dann, Dongwoo Park, Chan-Su Shin
2018	A*	`conf`	Approximate Range Queries for Clustering. SoCG Eunjin Oh, Hee-Kap Ahn
2018	J	`jnl`	Approximate Range Queries for Clustering. CoRR Eunjin Oh, Hee-Kap Ahn
2018	J	`jnl`	Assigning Weights to Minimize the Covering Radius in the Plane. CoRR Eunjin Oh, Hee-Kap Ahn
2018	J	`jnl`	Finding Pairwise Intersections of Rectangles in a Query Rectangle. CoRR Eunjin Oh, Hee-Kap Ahn
2018	J	`jnl`	Geometric matching algorithms for two realistic terrains. Theor. Comput. Sci. Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn
2018	B	`conf`	Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. WALCOM Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon
2018	B	`conf`	Minimum-Width Square Annulus Intersecting Polygons. WALCOM Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh
2018	—	`conf`	On Romeo and Juliet Problems: Minimizing Distance-to-Sight. SWAT Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
2018	A*	`conf`	Point Location in Dynamic Planar Subdivisions. SoCG Eunjin Oh, Hee-Kap Ahn
2018	J	`jnl`	Point Location in Dynamic Planar Subdivisions. CoRR Eunjin Oh, Hee-Kap Ahn
2018	Misc	`conf`	Polygon Queries for Convex Hulls of Points. COCOON Eunjin Oh, Hee-Kap Ahn
2018	A*	`conf`	Product Quantized Translation for Fast Nearest Neighbor Search. AAAI Yoonho Hwang, Mooyeol Baek, Saehoon Kim, Bohyung Han, Hee-Kap Ahn
2018	A	`conf`	Statistical Similarity of Critical Infrastructure Network Traffic Based on Nearest Neighbor Distances. RAID Jeong-Han Yun, Yoonho Hwang, Woomyo Lee, Hee-Kap Ahn, Sin-Kyu Kim
2018	J	`jnl`	The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon. CoRR Eunjin Oh, Luis Barba, Hee-Kap Ahn
2018	J	`jnl`	The geodesic 2-center problem in a simple polygon. Comput. Geom. Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
2018	J	`jnl`	Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. CoRR Eunjin Oh, Hee-Kap Ahn
2017	B	`conf`	A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. ISAAC Eunjin Oh, Hee-Kap Ahn
2017	J	`jnl`	A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. CoRR Eunjin Oh, Hee-Kap Ahn
2017	Misc	`conf`	A Time-Space Trade-Off for Triangulations of Points in the Plane. COCOON Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri
2017	B	`conf`	Bundling Two Simple Polygons to Minimize Their Convex Hull. WALCOM Jong Min Choi, Dongwoo Park, Hee-Kap Ahn
2017	B	`conf`	Computing the Center Region and Its Variants. WALCOM Eunjin Oh, Hee-Kap Ahn
2017	A*	`conf`	Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons. SoCG Eunjin Oh, Hee-Kap Ahn
2017	B	`conf`	Faster Algorithms for Growing Prioritized Disks and Rectangles. ISAAC Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
2017	J	`jnl`	Faster Algorithms for Growing Prioritized Disks and Rectangles. CoRR Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron
2017	B	`conf`	Finding Pairwise Intersections of Rectangles in a Query Rectangle. ISAAC Eunjin Oh, Hee-Kap Ahn
2017	J	`jnl`	Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16). NII Shonan Meet. Rep. Naoki Katoh, Hee-Kap Ahn, Subhas C. Nandy
2017	J	`jnl`	Realistic roofs without local minimum edges over a rectilinear polygon. Theor. Comput. Sci. Sang Duk Yoon, Hee-Kap Ahn, Jessica Sherette
2017	J	`jnl`	The Geodesic 2-center Problem in a Simple Polygon. CoRR Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
2017	J	`jnl`	Top-k Manhattan spatial skyline queries. Inf. Process. Lett. Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn
2017	A*	`conf`	Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. SoCG Eunjin Oh, Hee-Kap Ahn
2016	J	`jnl`	A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
2016	B	`conf`	A Middle Curve Based on Discrete Fréchet Distance. LATIN Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
2016	B	`conf`	A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree. ISAAC Eunjin Oh, Hee-Kap Ahn
2016	B	`conf`	Assigning Weights to Minimize the Covering Radius in the Plane. ISAAC Eunjin Oh, Hee-Kap Ahn
2016	J	`jnl`	Bundling three convex polygons to minimize area or perimeter. Comput. Geom. Dongwoo Park, Sang Won Bae, Helmut Alt, Hee-Kap Ahn
2016	B	`conf`	Computing a Geodesic Two-Center of Points in a Simple Polygon. LATIN Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
2016	—	`conf`	Constrained Geodesic Centers of a Simple Polygon. SWAT Eunjin Oh, Wanbin Son, Hee-Kap Ahn
2016	J	`jnl`	Guest Editor's Foreword. Algorithmica Hee-Kap Ahn, Chan-Su Shin
2016	A*	`conf`	The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon. SoCG Eunjin Oh, Luis Barba, Hee-Kap Ahn
2015	A*	`conf`	A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. SoCG Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
2015	J	`jnl`	A linear-time algorithm for the geodesic center of a simple polygon. CoRR Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
2015	J	`jnl`	An improved data stream algorithm for clustering. Comput. Geom. Sang-Sub Kim, Hee-Kap Ahn
2015	B	`conf`	Geometric Matching Algorithms for Two Realistic Terrains. ISAAC Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn
2015	J	`jnl`	Group nearest-neighbor queries in the Theor. Comput. Sci. Wanbin Son, Sang Won Bae, Hee-Kap Ahn
2015	B	`conf`	The 2-Center Problem in a Simple Polygon. ISAAC Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
2014	J	`jnl`	A Generalization of the Convex Kakeya Problem. Algorithmica Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron
2014	B	`ed.`	Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings ISAAC Hee-Kap Ahn, Chan-Su Shin
2014	B	`conf`	An Improved Data Stream Algorithm for Clustering. LATIN Sang-Sub Kim, Hee-Kap Ahn
2014	J	`jnl`	Computing Int. J. Comput. Geom. Appl. Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son
2014	J	`jnl`	Guest Editors' Foreword. Int. J. Comput. Geom. Appl. Hee-Kap Ahn, Antoine Vigneron
2014	J	`jnl`	MSSQ: Manhattan Spatial Skyline Queries. Inf. Syst. Wanbin Son, Seung-won Hwang, Hee-Kap Ahn
2014	—	`conf`	Minimum Convex Container of Two Convex Polytopes under Translations. CCCG Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin
2014	J	`jnl`	Overlap of convex polytopes under rigid motion. Comput. Geom. Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon
2014	B	`conf`	Top-k Manhattan Spatial Skyline Queries. WALCOM Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn
2013	B	`conf`	Bundling Three Convex Polygons to Minimize Area or Perimeter. WADS Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park
2013	J	`jnl`	Covering and piercing disks with two centers. Comput. Geom. Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
2013	C	`conf`	Group Nearest Neighbor Queries in the TAMC Hee-Kap Ahn, Sang Won Bae, Wanbin Son
2013	J	`jnl`	Maximum overlap of convex polytopes under translation. Comput. Geom. Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher
2013	J	`jnl`	Realistic roofs over a rectilinear polygon. Comput. Geom. Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron
2012	J	`jnl`	A Generalization of the Convex Kakeya Problem CoRR Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron
2012	B	`conf`	A Generalization of the Convex Kakeya Problem. LATIN Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron
2012	A*	`conf`	A fast nearest neighbor search algorithm by nonlinear embedding. CVPR Yoonho Hwang, Bohyung Han, Hee-Kap Ahn
2012	J	`jnl`	Aligning Two Convex Figures to Minimize Area or Perimeter. Algorithmica Hee-Kap Ahn, Otfried Cheong
2012	B	`conf`	Computing k-center over Streaming Data for Small k. ISAAC Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son
2012	J	`jnl`	Computing the Discrete FRéChet Distance with Imprecise Input. Int. J. Comput. Geom. Appl. Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
2012	J	`jnl`	Covering and Piercing Disks with Two Centers CoRR Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
2012	—	`conf`	Overlap of Convex Polytopes under Rigid Motion. FSTTCS Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon
2012	J	`jnl`	Reachability by paths of bounded curvature in a convex polygon. Comput. Geom. Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron
2012	B	`conf`	Rectilinear Covering for Imprecise Input Points - (Extended Abstract). ISAAC Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa
2011	J	`jnl`	Adaptive Algorithms for Planar Convex Hull Problems. IEICE Trans. Inf. Syst. Hee-Kap Ahn, Yoshio Okamoto
2011	—	`conf`	Convergent Bounds on the Euclidean Distance. NIPS Yoonho Hwang, Hee-Kap Ahn
2011	J	`jnl`	Covering a Point Set by Two Disjoint Rectangles. Int. J. Comput. Geom. Appl. Sang-Sub Kim, Sang Won Bae, Hee-Kap Ahn
2011	B	`conf`	Covering and Piercing Disks with Two Centers. ISAAC Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
2011	J	`jnl`	Covering points by disjoint boxes with outliers. Comput. Geom. Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son
2011	J	`jnl`	Empty pseudo-triangles in point sets. Discret. Appl. Math. Hee-Kap Ahn, Sang Won Bae, Marc J. van Kreveld, Iris Reinbacher, Bettina Speckmann
2011	B	`conf`	Generating Realistic Roofs over a Rectilinear Polygon. ISAAC Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron
2011	B	`conf`	MSSQ: Manhattan Spatial Skyline Queries. SSTD Wanbin Son, Seung-won Hwang, Hee-Kap Ahn
2011	J	`jnl`	Spatial skyline queries: exact and approximation algorithms. GeoInformatica Mu-Woong Lee, Wanbin Son, Hee-Kap Ahn, Seung-won Hwang
2010	Misc	`conf`	Adaptive Algorithms for Planar Convex Hull Problems. FAW Hee-Kap Ahn, Yoshio Okamoto
2010	—	`conf`	Computing the Discrete Fréchet Distance with Imprecise Input. ISAAC (2) Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
2010	J	`jnl`	Covering a simple polygon by monotone directions. Comput. Geom. Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin
2010	J	`jnl`	Dilation-Optimal Edge Deletion in Polygonal Cycles. Int. J. Comput. Geom. Appl. Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang
2010	—	`conf`	Maximum Overlap of Convex Polytopes under Translation. ISAAC (2) Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher
2010	J	`jnl`	Reachability by Paths of Bounded Curvature in a Convex Polygon CoRR Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron
2009	J	`jnl`	Casting an Object with a Core. Algorithmica Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa
2009	J	`jnl`	Computing minimum-area rectilinear convex hull and L-shape. Comput. Geom. Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa
2009	J	`jnl`	Constructing Optimal Highways. Int. J. Found. Comput. Sci. Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
2009	J	`jnl`	Covering Points by Disjoint Boxes with Outliers CoRR Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son
2009	J	`jnl`	On the minimum total length of interval systems expressing all intervals, and range-restricted queries. Comput. Geom. Hee-Kap Ahn, Peter Brass, Hyeon-Suk Na, Chan-Su Shin
2009	—	`conf`	Optimal Empty Pseudo-Triangles in a Point Set. CCCG Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher
2009	J	`jnl`	Spatial Skyline Queries: An Efficient Geometric Algorithm CoRR Wanbin Son, Mu-Woong Lee, Hee-Kap Ahn, Seung-won Hwang
2009	B	`conf`	Spatial Skyline Queries: An Efficient Geometric Algorithm. SSTD Wanbin Son, Mu-Woong Lee, Hee-Kap Ahn, Seung-won Hwang
2009	Misc	`conf`	Square and Rectangle Covering with Outliers. FAW Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son
2008	J	`jnl`	Aperture-Angle and Hausdorff-Approximation of Convex Figures. Discret. Comput. Geom. Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson
2008	B	`conf`	Covering a Point Set by Two Disjoint Rectangles. ISAAC Hee-Kap Ahn, Sang Won Bae
2008	B	`conf`	Covering a Simple Polygon by Monotone Directions. ISAAC Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin
2008	J	`jnl`	Maximum overlap and minimum convex hull of two convex polyhedra under translations. Comput. Geom. Hee-Kap Ahn, Peter Brass, Chan-Su Shin
2007	J	`jnl`	Aperture-Angle and Hausdorff-Approximation of Convex Figures CoRR Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson
2007	—	`conf`	Aperture-angle and Hausdorff-approximation of convex figures. SCG Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson
2007	J	`jnl`	Constructing Optimal Highways CoRR Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
2007	—	`conf`	Constructing Optimal Highways. CATS Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff
2007	B	`conf`	Dilation-Optimal Edge Deletion in Polygonal Cycles. ISAAC Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel H. M. Smid, Yajun Wang
2007	B	`conf`	Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations. ISAAC Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa
2007	J	`jnl`	Maximizing the overlap of two planar convex sets under rigid motions. Comput. Geom. Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
2006	J	`jnl`	Casting with Skewed Ejection Direction. Algorithmica Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
2006	J	`jnl`	Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. Comput. Geom. Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
2005	B	`conf`	Casting an Object with a Core. ISAAC Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa
2005	—	`conf`	Maximizing the overlap of two planar convex sets under rigid motions. SCG Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
2005	B	`conf`	Stacking and Bundling Two Convex Polygons. ISAAC Hee-Kap Ahn, Otfried Cheong
2004	Misc	`conf`	Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. COCOON Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
2004	J	`jnl`	Competitive facility location: the Voronoi game. Theor. Comput. Sci. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum
2004	J	`jnl`	The reflex-free hull. Int. J. Comput. Geom. Appl. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink
2003	J	`jnl`	Building bridges between convex region. Comput. Geom. Hee-Kap Ahn, Otfried Cheong, Chan-Su Shin
2003	J	`jnl`	Casting a polyhedron with directional uncertainty. Comput. Geom. Hee-Kap Ahn, Otfried Cheong, René van Oostrum
2002	B	`conf`	Casting a Polyhedron with Directional Uncertainty. ISAAC Hee-Kap Ahn, Otfried Cheong, René van Oostrum
2002	J	`jnl`	Separating an object from its cast. Comput. Aided Des. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
2001	Misc	`conf`	Competitive Facility Location along a Highway. COCOON Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum
2001	—	`conf`	The reflex-free hull. CCCG Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink
2000	—	`conf`	Flipping your Lid. CCCG Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin
2000	—	`conf`	Reachability by paths of bounded curvature in convex polygons. SCG Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron
1999	—	`conf`	Casting with skewed ejection direction revisited. CCCG Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
1998	B	`conf`	Casting with Skewed Ejection Direction. ISAAC Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
1997	—	`conf`	Separating an Object from its Cast. SCG Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf