International Journal articles

  1. Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn.
    Inscribing or Circumscribing a Histogon to a Convex Polygon.
    Submitted.
  2. Taehoon Ahn, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Sang Duk Yoon.
    Minimum-Width Double-Slabs and Widest Empty Slabsin High Dimensions.
    Submitted.
  3. Byeonguk Kang, Junhyeok Choi, Jeesun Han, Hee-Kap Ahn.
    Guarding Points on a Terrain by Watchtowers.
    Submitted.
  4. Chaeyoon Chung, Taehoon Ahn, Hee-Kap Ahn, Sang Won Bae.
    Parallel Line Centers with Guaranteed Separation.
    Submitted.
  5. Taekang Eom, Seungjun Lee, Hee-Kap Ahn.
    Largest similar copies of convex polygons amidst polygonal obstacles.
    Submitted.
    arXiv:2012.06978
  6. Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn.
    Largest Unit Rectangles Inscribed in a Convex Polygon. (ShareLink)
    Computational Geometry, 124-125, 102135, 2025.
  7. Hee-Kap Ahn, Seung Joon Lee, Sang Duk Yoon.
    Stacking Monotone Polytopes.
    Symmetry 16(9), 2024.
  8. Hwi Kim, Jaegun Lee, Hee-Kap Ahn.
    Uniformly monotone partitioning of polygons.
    Theoretical Computer Science, 1012, 114724, 2024.
  9. Taekang Eom, Hee-Kap Ahn.
    A linear-time algorithm for the center problem in weighted cycle graphs. (ShareLink)
    Information Processing Letters. 186, 106495, 2024.
  10. Chaeyoon Chung, Antoine Vigneron, Hee-Kap Ahn.
    Maximum Coverage by k Lines.
    Symmetry, 16(2), 206, 2024.
  11. Jung-Yul Cha, Jaewook Huh, Jing Liu, Jae-Hun Yu, Yoon Jeong Choi, Hee-Kap Ahn, Chooryung J Chung, Kyung-Ho Kim.
    Three-dimensional evaluation of a virtual setup considering the roots and alveolar bone in molar distalization cases.
    Scientific Reports, 13, 14955, 2023.
  12. Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama.
    Universal convex covering problems under translation and discrete rotations.
    Advances in Geometry, 23(4), pages 481–500, 2023.
  13. Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn.
    Farthest-point Voronoi diagrams in the presence of rectangular obstacles.
    Algorithmica. (Online first)
    arXiv:2203.03198
  14. Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn.
    Intersecting Disks using Two Congruent Disks.
    Computational Geometry, 110, 101966, 2023.
  15. Hwi Kim, Jaegun Lee, Hee-Kap Ahn.
    Rectangular Partitions of a Rectilinear Polygon.
    Computational Geometry, 110, 101965, 2023.
    arXiv:2111.01970
  16. Jongmin Choi, Dahye Jeong, Hee-Kap Ahn.
    Covering Convex Polygons by Two Congruent Disks.
    Computational Geometry, 110, 101936, 2023.
    arXiv:2105.02483
  17. Joon Im, Ju-Yeong Kim, Hyung-Seog Yu, Kee-Joon Lee, Sung-Hwan Choi, Ji-Hoi- Kim, Hee-Kap Ahn, Jung-Yul Cha.
    Accuracy and efficiency of automatic tooth segmentation in digital dental models using deep learning.
    Scientific Reports, 12, 9429, 2022.
  18. Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon.
    Rearranging a Sequence of Points onto a Line.
    Computational Geometry: Theory and Applications, 107, 1018887, 2022.
  19. Mincheol Kim, Hee-Kap Ahn.
    Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles.
    Computational Geometry: Theory and Applications, 103, 101858, 2022.
  20. Jongmin Choi, Sergio Cabello, Hee-Kap Ahn.
    Maximizing Dominance in the Plane and its Applications.
    Accepted for publications in Algorithmica.
  21. Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn.
    Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain.
    Computational Geometry: Theory and Applications, 99, 101796, 2021.
  22. Seungjun Lee, Taekang Eom, Hee-Kap Ahn.
    Largest triangles in a polygon.
    Computational Geometry: Theory and Applications, 98, 101792, 2021.
    arXiv:2007.12330
  23. Jongmin Choi, Hee-Kap Ahn.
    Efficient Planar Two-Center Algorithms.
    Computational Geometry: Theory and Applications, 97, 101768, 2021.
    arXiv:2006.10365
  24. Yujin Choi, Seungjun Lee, Hee-Kap Ahn.
    Maximum-Area Rectangles in Simple Polygons.
    Computational Geometry: Theory and Applications, 94, 101710, 2020.
    arXiv:1910.08686
  25. Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk.
    A Middle Curve Based on Discrete Fréchet Distance.
    Computational Geometry: Theory and Applications, 89, 101621, 2020.
    Manuscript available.
  26. Eunjin Oh, Luis Barba, Hee-Kap Ahn.
    The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon.
    Algorithmica 82(5), pages 1434–1473, 2020.
    arXiv:1802.06223
  27. Eunjin Oh, Hee-Kap Ahn.
    Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. (Full-text view-only version)
    Discrete & Computational Geometry, 63(2), pages 418–454, 2020.
    arXiv:1801.02292
  28. Eunjin Oh, Hee-Kap Ahn.
    Finding Pairwise Intersections of Rectangles in a Query Rectangle.
    Computational Geometry: Theory and Applications. , 85, 101576, 2019.
    arXiv:1801.07362
  29. Eunjin Oh, Hee-Kap Ahn.
    Computing the Center Region and Its Variants.
    Theoretical Computer Science, 789, pages 2-12, 2019.
    arXiv:1910.12169
  30. Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash.
    On Romeo and Juliet Problems: Minimizing Distance-to-Sight.
    Computational Geometry: Theory and Applications (on invitation, EuroCG 2018), 84, pages 12-21, 2019.
    arXiv:1906.01114
  31. Eunjin Oh, Sang Won Bae, Hee-Kap Ahn.
    Computing a Geodesic Two-Center of Points in a Simple Polygon.
    Computational Geometry: Theory and Applications, 82, pages 45-59, 2019.
    arXiv:1910.12177
  32. Eunjin Oh, Hee-Kap Ahn.
    A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms.
    Algorithmica, 81(7), pages 2829-2856, 2019.
  33. Eunjin Oh, Hee-Kap Ahn.
    Assigning Weights to Minimize the Covering Radius in the Plane.
    Computational Geometry: Theory and Applications, 81, pages 22-32, 2019.
    arXiv:1802.06223
  34. Hee-Kap Ahn, Sang Won Bae, Jongmin Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-Won Park, André van Renssen, Antoine Vigneron.
    Faster Algorithms for Growing Prioritized Disks and Rectangles.
    Computational Geometry: Theory and Applications, 80, pages 23-39, 2019.
    arXiv:1704.07580
  35. 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.
    Computational Geometry: Theory and Applications, 77, pages 40-50, 2019. (on invitation, CCCG 2014)
    Manuscript available.
  36. Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jongmin Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon.
    The Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases.
    Information Processing Letters, 145, pages 16-23, 2019.
    Manuscript available.
  37. Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn.
    The geodesic 2-center problem in a simple polygon.
    Computational Geometry: Theory and Applications 74, pages 60-70, 2018.
    arXiv:1710.09035
  38. Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn.
    The Geometric Matching Algorithms for Two Realistic Terrains.
    Theoretical Computer Science 715, pages 60-70, 2018.
    Manuscript available.
  39. Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn.
    Top-k Manhattan Spatial Skyline Queries.
    Information Processing Letters 123, pages 27-35, 2017.
  40. Sang Duk Yoon, Hee-Kap Ahn, Jessica Sherette.
    Realistic Roofs without Local Minimum Edges over a Rectilinear Polygon.
    Theoretical Computer Science 675, pages 15-26, 2017.
    Manuscript available.
  41. 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.
    Discrete & Computational Geometry 56(4), pages 836-859, 2016. (on invitation, SoCG 2015)
  42. Dongwoo Park, Sang Won Bae, Helmut Alt, Hee-Kap Ahn.
    Bundling Three Convex Polygons to Minimize Area or Perimeter.
    Computational Geometry: Theory and Applications 51(1), pages 1-14, 2016.
    Manuscript available.
  43. Wanbin Son, Sang Won Bae, Hee-Kap Ahn.
    Group Nearest-Neighbor Queries in the L1 Plane.
    Theoretical Computer Science 592, pages 39-48, 2015.
  44. Sang-Sub Kim, Hee-Kap Ahn.
    An Improved Data Stream Algorithm for Clustering.
    Computational Geometry: Theory and Applications 48(9), pages 635-645, 2015
  45. Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son.
    Computing k centers over Streaming Data for Small k.
    International Journal of Computational Geometry and Applications 24(02), pages 107-123, 2014.
  46. Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron.
    A Generalization of the Convex Kakeya Problem.
    Algorithmica 70(2), pages 152-170, 2014 (on invitation, LATIN 2012)
    arXiv:1209.2171
  47. Wanbin Son, Seung-won Hwang, Hee-Kap Ahn.
    MSSQ: Manhattan Spatial Skyline Queries.
    Information Systems 40, pages 67-83, 2014
  48. Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon.
    Overlap of Convex Polytopes under Rigid Motion.
    Computational Geometry: Theory and Applications 47(1), pages 15-24, 2014
  49. Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron.
    Realistic Roofs over a Rectilinear Polygon.
    Computational Geometry: Theory and Applications 46(9), pages 1042-1055, 2013
  50. Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher.
    Maximum Overlap of Convex Polytopes under Translation.
    Computational Geometry: Theory and Applications, a special issue on “Geometric Optimization”. 46(5), pages 552-565, 2013
  51. Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron.
    Covering and Piercing Disks with Two Centers.
    Computational Geometry: Theory and Applications, 46(3), pages 253-262, 2013
    arXiv:1201.1198
  52. Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron.
    Computing the Discrete Fréchet Distance with Imprecise Input.
    International Journal of Computational Geometry and Applications, 22(1), pages 27-44, 2012 (on invitation, ISAAC 2010)
    Manuscript available.
  53. Hee-Kap Ahn, Otfried Cheong.
    Aligning two convex figures to minimize area or perimeter.
    Algorithmica, 62(1-2), pages 464-479, 2012
    Manuscript available.
  54. Hee-Kap Ahn, Otfried Cheong, Jiri Matousek, Antoine Vigneron.
    Reachability by paths of bounded curvature in a convex polygon.
    Computational Geometry: Theory and Applications, 45(1-2), pages 21-32, 2012
    arXiv:1008.4244
  55. Hee-Kap Ahn, Sang Won Bae, Marc van Kreveld, Iris Reinbacher, Bettina Speckmann.
    Empty Pseudo-Triangles in Point Sets.
    Discrete Applied Mathematics, 159(18), pages 2205-2213, 2011
    Manuscript available.
  56. Mu-Woong Lee, Wanbin Son, Hee-Kap Ahn, Seung-won Hwang.
    Spatial Skyline Queries: Exact and Approximation Algorithms.
    GeoInformatica, 15(4), pages 665-697, 2011. (on invitation, SSTD 2009 Best Paper)
    arXiv:0903.3072
  57. Sang-Sub Kim, Sang Won Bae, Hee-Kap Ahn.
    Covering a Point Set by Two Disjoint Rectangles.
    International Journal of Computational Geometry and Applications, 21(3), pages 313-330, 2011. (on invitation, ISAAC 2008)
    Manuscript available.

  58. Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Mathias Korman, Iris Reinbacher, Wanbin Son.
    Covering Points by Disjoint Boxes with Outliers.
    Computational Geometry: Theory and Applications, 44(3), pages 178-190, 2011.
    arXiv:0910.1643
  59. Hee-Kap Ahn, Yoshio Okamoto.
    Adaptive Algorithms for Planar Convex Hull Problems.
    IEICE Transactions on Information and Systems E94-D(2), pages 182-189, 2011
    Manuscript available.
  60. Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin.
    Covering a Simple Polygon by Monotone Directions.
    Computational Geometry: Theory and Applications 43(5), pages 514-523, 2010
    Manuscript available.
  61. Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel Smid, Yajun Wang.
    Dilation-Optimal Edge Deletion in Polygonal Cycles.
    International Journal of Computational Geometry and Applications, 20(1), pages 69-87, 2010. (on invitation, ISAAC 2007)
    Manuscript available.
  62. Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa.
    Computing Minimum-Area Rectilinear Convex Hull and L-Shape.
    Computational Geometry: Theory and Applications, 42(9), pages 903-912, 2009
    Manuscript available.
  63. Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa.
    Casting an Object with a Core.
    Algorithmica 54(1), pages 72-88, 2009
    Manuscript available.
  64. 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.
    International Journal of Foundations of Computer Science 20(1), pages 3-23, 2009 (on invitation, CATS 2007)
    arxiv:cs.CG/0703037
  65. Hee-Kap Ahn, Peter Brass, Hyeon-Suk Na, Chan-Su Shin.
    On the Minimum Size of Systems of Building Blocks Expressing all Intervals, and Range-Restricted Queries.
    Computational Geometry: Theory and Applications 42(3), pages 207-213, 2009
    Manuscript available.
  66. Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson.
    Aperture-Angle and Hausdorff-Approximation of Convex Figures.
    Discrete & Computational Geometry 40(3), pages 414-429, 2008
    arxiv:cs.CG/0702090
  67. Hee-Kap Ahn, Peter Brass, Chan-Su Shin.
    Maximum Overlap and Minimum Convex Hull of Two Convex Polyhedra under Translations.
    Computational Geometry: Theory and Applications 40, pages 171-177, 2008
  68. Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron.
    Maximizing the Overlap of Two Planar Convex Sets under Rigid Motions.
    Computational Geometry: Theory and Applications 37, pages 3-15, 2007 (on invitation, ACM SoCG 2005)
    Manuscript available.
  69. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong.
    Casting with Skewed Ejection Direction.
    Algorithmica 44(4), pages 325-342, 2006
    Manuscript available.
  70. Hee-Kap Ahn, Peter Brass, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron.
    Inscribing an Axially Symmetric Polygon and other Approximation Algorithms for Planar Convex Sets.
    Computational Geometry: Theory and Applications 33(3), pages 152-164, 2006
    Manuscript available.
  71. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Jack Snoeyink.
    The Reflex-Free Hull.
    International Journal of Computational Geometry and Applications 14(6), pages 453-474, 2004
  72. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai Golin, René van Oostrum.
    Competitive Facility Location: The Voronoi Game.
    Theoretical Computer Science 310(1-3), pages 457-467, 2004
    Available as Technical Report UU-CS-2001-45.
  73. Hee-Kap Ahn, Otfried Cheong, René van Oostrum.
    Casting a Polyhedron with Directional Uncertainty.
    Computational Geometry: Theory and Applications 26(2), pages 129-141, 2003
    Available as Technical Report UU-CS-2001-48.
  74. Hee-Kap Ahn, Otfried Cheong, Chan-Su Shin.
    Building Bridges between Convex Regions.
    Computational Geometry: Theory and Applications 25(1/2), pages 161-170, 2003
    Available as Technical Report UU-CS-2001-46.
  75. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jiri Matousek, Otfried Schwarzkopf.
    Separating an Object from its Cast.
    Computer-Aided Design (CAD) 34(8), pages 547-559, 2002
  76. Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin.
    Flipping your Lid.
    Geombinatorics X(2), pages 57-63, 2000
    Available as Technical Report UU-CS-2001-13 at Utrecht university.

Refereed International Conference Proceedings

  1. Mook Kwon Jung, Seokyun Kang, Hee-Kap Ahn.
    Minimum Convex Hull and Maximum Overlap of Two Convex Polytopes.
    Accepted for presentation at 36th ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)
  2. Byeonguk Kang, Junhyeok Choi, Jeesun Han, Hee-Kap Ahn.
    Guarding Points on a Terrain by Watchtowers.
    36th Canadian Conference on Computational Geometry (CCCG 2024)
  3. 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 American Theoretical Informatics 2024 (LATIN 2024)
  4. Jongmin Choi, Jaegun Lee, Hee-Kap Ahn.
    Efficient k-center algorithms for planar points in convex position.
    Accepted for presentation at the 18th Algorithms and Data Structures Symposium (WADS 2023)., 2023.
  5. Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn.
    Inscribing or Circumscribing a Histogon to a Convex Polygon.
    In Proc. the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)., 13:1–13:16, 2022..
  6. Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn.
    Approximating Convex Polygons by Histogons.
    In Proc. the 34th Canadian Conference on Computational Geometry (CCCG 2022)., 2022.
  7. Hwi Kim, Jaegun Lee, Hee-Kap Ahn.
    Uniformly Monotone Partitioning of Polygons Revisited.
    In Proc. the 34th Canadian Conference on Computational Geometry (CCCG 2022)., 2022.
  8. Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn.
    Farthest-point Voronoi diagrams in the presence of rectangular obstacles.
    In Proc. the 38th International Symposium on Computational Geometry (SoCG 2022), 2022.
    arXiv:2203.03198
  9. Taekang Eom, Seungjun Lee, Hee-Kap Ahn.
    Largest similar copies of convex polygons in polygonal domains.
    In Proc. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), 2021.
  10. Mincheol Kim, Hee-Kap Ahn.
    Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles.
    In Proc. 33rd Canadian Conference on Computational Geometry (CCCG 2021), 2021.
  11. Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon.
    Rearranging a Sequence of Points onto a Line.
    In Proc. 33rd Canadian Conference on Computational Geometry (CCCG 2021), 2021.
  12. Jongmin Choi, Dahye Jeong, Hee-Kap Ahn.
    Covering Convex Polygons by Two Congruent Disks.
    In Proc. 32nd International Workshop on Combinatorial Algorithms (IWOCA 2021), 2021.
  13. Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn.
    Intersecting Disks using Two Congruent Disks.
    In Proc. 32nd International Workshop on Combinatorial Algorithms (IWOCA 2021), 2021.
  14. Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn.
    Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain.
    In Proc. 14th Latin American Theoretical Informatics Symposium (LATIN 2020), pages 271-282, 2020.
  15. Yujin Choi, Seungjun Lee, Hee-Kap Ahn.
    Maximum-Area Rectangles in a Simple Polygon.
    In Proc. 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), pages 12:1-12:14, 2019
  16. Jongmin Choi, Sergio Cabello, Hee-Kap Ahn.
    Maximizing Dominance in the Plane and its Applications.
    In Proc. 16th International Symposium on Algorithms and Data Structures Symposium (WADS 2019), 2019, pages 325-338, 2019.
  17. Yoonho Hwang, Sehoon Kim, Mooyeol Baek, Bohyung Han, Hee-Kap Ahn.
    Product Quantized Translation for Fast Nearest Neighbor Search.
    In Proc. 32nd AAAI Conference on Artificial Intelligence (AAAI-18), pages 3295–3301, 2018.
  18. 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.
    In Proc. 21st International Symposium on Research in Attacks, Intrusions and Defenses (RAID 2018), pages 577-599, 2018.
  19. Eunjin Oh, Hee-Kap Ahn.
    Approximate Range Queries for Clustering.
    In Proc. 34th International Symposium on Computational Geometry (SoCG 2018)
    arXiv:1803.03978 available.
  20. Eunjin Oh, Hee-Kap Ahn.
    Point Location in Dynamic Planar Subdivisions.
    In Proc. 34th International Symposium on Computational Geometry (SoCG 2018)
  21. Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, Sang Duk Yoon.
    The Reverse Kakeya Problem.
    In Proc. 34th International Symposium on Computational Geometry (SoCG 2018)
  22. Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash.
    Statistical On Romeo and Juliet Problems: Minimizing Distance-to-Sight.
    In Proc. 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), pages 6:1-6:13, 2018.
  23. Eunjin Oh, Hee-Kap Ahn.
    Polygon Queries for Convex Hulls of Points.
    In Proc. 24th International Computing and Combinatorics Conference (COCOON 2018), pages 143-155, 2018.
    arXiv:1910.08717
  24. Hee-Kap Ahn, Taehoon Ahn, Jongmin Choi, Mincheol Kim, Eunjin Oh.
    Minimum-Width Square Annulus Intersecting Polygons.
    In Proc. 12th International Conference and Workshops on Algorithms and Computation (WALCOM 2018)
  25. Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jongmin Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon.
    Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases.
    In Proc. 12th International Conference and Workshops on Algorithms and Computation (WALCOM 2018)
  26. Hee-Kap Ahn, Sang Won Bae, Jongmin Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron.
    Faster Algorithms for Growing Prioritized Disks and Rectangles.
    In Proc. 28th International Symposium on Algorithms and Computation (ISAAC 2017)
  27. Eunjin Oh, Hee-Kap Ahn
    Finding Pairwise Intersections of Rectangles in a Query Rectangle.
    In Proc. 28th International Symposium on Algorithms and Computation (ISAAC 2017)
  28. Eunjin Oh, Hee-Kap Ahn
    A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms.
    In Proc. 28th International Symposium on Algorithms and Computation (ISAAC 2017)
  29. Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri.
    A Time-Space Tradeoff for Triangulations of Points in the Plane.
    In Proc. 23rd Annual International Computing and Combinatorics Conference (COCOON 2017), pages 3-12, 2017
  30. Eunjin Oh, Hee-Kap Ahn.
    Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons.
    In Proc. 33rd International Symposium on Computational Geometry (SoCG 2017)
  31. Eunjin Oh, Hee-Kap Ahn.
    Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon.
    In Proc. 33rd International Symposium on Computational Geometry (SoCG 2017)
  32. Eunjin Oh, Hee-Kap Ahn.
    Computing the Center Region and Its Variants.
    In Proc. 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017)
  33. Jongmin Choi, Dongwoo Park, Hee-Kap Ahn.
    Bundling Two Simple Polygons to Minimize Their Convex Hull.
    In Proc. 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017)
  34. Eunjin Oh, Hee-Kap Ahn.
    Assigning Weights to Minimize the Covering Radius in the Plane.
    In Proc. 27th International Symposium on Algorithms and Computation (ISAAC 2016).
  35. Eunjin Oh, Hee-Kap Ahn.
    A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree.
    In Proc. 27th International Symposium on Algorithms and Computation (ISAAC 2016).
  36. Eunjin Oh, Wanbin Son, Hee-Kap Ahn.
    Constrained Geodesic Center of a Simple Polygon.
    In Proc. 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016).
  37. Eunjin Oh, Luis Barba, Hee-Kap Ahn.
    The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon.
    In Proc. 32nd International Symposium on Computational Geometry (SoCG 2016).
  38. Eunjin Oh, Sang Won Bae, Hee-Kap Ahn.
    Computing a Geodesic Two-Center of Points in a Simple Polygon.
    In Proc. 12th Latin American Theoretical Informatics Symposium (LATIN 2016).

  39. Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk.
    A Middle Curve Based on Discrete Fréchet Distance.
    In Proc. 12th Latin American Theoretical Informatics Symposium (LATIN 2016).
  40. Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn.
    The 2-center problem in a simple polygon.
    In Proc. 26th International Symposium on Algorithms and Computation (ISAAC 2015).

  41. Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn.
    Geometric Matching Algorithms for Two Realistic Terrains.
    In Proc. 26th International Symposium on Algorithms and Computation (ISAAC 2015).
  42. 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.
    In Proc. 31st International Symposium on Computational Geometry (SoCG 2015), 2015.
  43. Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin.
    Minimum Convex Container of Two Convex Polytopes under Translations.
    In Proc. 26th Canadian Conference on Computational Geometry (CCCG 2014), 2014.
  44. Sang-Sub Kim, Hee-Kap Ahn.
    An Improved Data Stream Algorithm for Clustering.
    In Proc. 11th Latin American Theoretical Informatics Symposium (LATIN 2014), pages 273-284, 2014
  45. Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn.
    Top-k Manhattan Spatial Skyline Queries.
    In Proc. 8th International Workshop on Algorithms and Computation (WALCOM 2014), pages 22-33, 2014
  46. Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park.
    Bundling Three Convex Polygons to Minimize Area or Perimeter.
    In Proc. 13th Algorithms and Data Structures Symposium (WADS 2013), pages 13-24, 2013.
  47. Hee-Kap Ahn, Sang Won Bae, Wanbin Son.
    Group Nearest Neighbor Queries in the L1 Plane.
    In Proc. 10th Annual Conference on Theory and Applications of Models of Computation (TAMC 2013), pages 52-61, 2013.
  48. Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon.
    Overlap of Convex Polytopes under Rigid Motion.
    In Proc. 32nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), pages 498-509, 2012.
  49. Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son.
    Computing k-center over Streaming Data for Small k.
    In Proc. 23rd International Symposium on Algorithms and Computation (ISAAC 2012), pages 54-63, 2012.
  50. Hee-Kap Ahn, Sang Won Bae, Shin-Ichi Tanigawa.
    Rectilinear Covering for Imprecise Input Points.
    In Proc. 23rd International Symposium on Algorithms and Computation (ISAAC 2012), pages 309-318, 2012.
  51. Yoonho Hwang, Bohyung Han, Hee-Kap Ahn.
    A Fast Nearest Neighbor Search Algorithm by Nonlinear Embedding.
    In Proc. 25th IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2012), pages 3053-3060, 2012.
  52. Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama.
    A Generalization of the Convex Kakeya Problem.
    In Proc. 10th Latin American Theoretical Informatics Symposium (LATIN 2012), pages 1-12, 2012.
  53. Yoonho Hwang, Hee-Kap Ahn.
    Convergent Bounds on the Euclidean Distance.
    In Proc. 25th Annual Conference on Neural Information Processing Systems (NIPS 2011), pages 388-396, 2011
  54. Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron.
    Covering and Piercing Disks with Two Centers.
    In Proc. 22nd International Symposium on Algorithms and Computation (ISAAC 2011), pages 50-59, 2011.
  55. Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron.
    Generating Realistic Roofs over a Rectilinear Polygon.
    In Proc. 22nd International Symposium on Algorithms and Computation (ISAAC 2011), pages 60-69, 2011.
  56. Wanbin Son, Seung-won Hwang, Hee-Kap Ahn.
    MSSQ: Manhattan Spatial Skyline Queries., pages 313-329, 2011.
    In Proc. 12th Symposium on Spatial and Temporal Databases (SSTD 2011)
  57. Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron.
    Computing the Discrete Fréchet Distance with Imprecise Input.
    In Proc. 21st International Symposium on Algorithms and Computation (ISAAC 2010), LNCS 6507, pages 422-433, 2010.
  58. Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher.
    Maximum Overlap of Convex Polytopes under Translation.
    In Proc. 21st International Symposium on Algorithms and Computation (ISAAC 2010), LNCS 6507, pages 97-108, 2010.
  59. Hee-Kap Ahn, Yoshio Okamoto.
    Adaptive Algorithms for Planar Convex Hull Problems.
    In Proc. 4th International Frontiers of Algorithms Workshop (FAW 2010), LNCS 6213, pages 316-326, 2010.
  60. Wanbin Son, Mu-Woong Lee, Hee-Kap Ahn, Seung-won Hwang.
    Spatial Skyline Queries: An Efficient Geometric Algorithm. (Best Paper Award)
    In Proc. 11th International Symposium on Spatial and Temporal Databases (SSTD 2009), LNCS 5644, pages 247-264, 2009.
  61. Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son.
    Square and Rectangle Covering with Outliers.
    In Proc. 3rd International Frontiers of Algorithms Workshop (FAW 2009)., LNCS 5598, pages 132-140, 2009.
    A shorter version has been presented at 25th European Workshop on Computational Geometry 2009.
  62. Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher.
    Optimal Empty Pseudo-Triangles in a Point Set.
    In Proc. 21st Canadian Conference on Computational Geometry (CCCG 2009), 2009.
  63. Hee-Kap Ahn, Sang Won Bae.
    Covering a Point Set by Two Disjoint Rectangles.
    In Proc. 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008), LNCS 5369, pages 728-739, 2008
  64. Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin.
    Covering a Simple Polygon by Monotone Directions.
    In Proc. 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008), LNCS 5369, pages 668-679, 2008
  65. Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel Smid, Yajun Wang.
    Dilation-optimal edge deletion in polygonal cycles.
    In Proc. 18th Annual International Symposium on Algorithms and Computation (ISAAC 2007), LNCS 4835, pages 88-99, 2007
  66. Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa.
    Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations.
    In Proc. 18th Annual International Symposium on Algorithms and Computation (ISAAC 2007), LNCS 4835, pages 788-799, 2007
  67. Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson.
    Aperture-Angle and Hausdorff-Approximation of Convex Figures.
    In Proc. 23rd Annual ACM Symposium on Computational Geometry (SoCG 2007), pages 37-45, 2007
  68. 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.
    In Proc. Computing: The Australasian Theory Symposium (CATS 2007), CRPIT Vol.65, pages 7-14, 2007
  69. Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa.
    Casting an Object with a Core.
    In Proc. 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), LNCS 3827, pages 882-891, 2005
  70. Hee-Kap Ahn, Otfried Cheong.
    Stacking and Bundling two Convex Polygons.
    In Proc. 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), LNCS 3827, pages 40-49, 2005
  71. Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron.
    Maximizing the Overlap of Two Planar Convex Sets under Rigid Motions.
    In Proc. 21st Annu. ACM Symposium on Computational Geometry (SoCG 2005), pages 356-363, 2005
  72. Hee-Kap Ahn, Peter Brass, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron.
    Approximation algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.
    In Proc. 10th Annual International Computing and Combinatorics Conference (COCOON 2004) LNCS 3106, pages 259-267, 2004

  73. Hyun-Jhin Lee, Jinwook Kim, Hee-Kap Ahn, Sang Chul Ahn, Ik Jae Kim, Hyoung-Gon Kim, Heedong Ko.
    VR Experience Design in Tangible Space : Heritage Alive!
    In Proc. 15th Triennial Congress of International Ergonomics Association (IEA 2003) and 7th Joint Conference of the Ergonomics Society of Korea and the Japan Ergonomics Society, 2003
  74. Jinwook Kim, Hee-Kap Ahn, Heedong Ko.
    Description and Response Generation of Cyberspace.
    In Proc. Proc. 15th Triennial Congress of International Ergonomics Association (IEA 2003) and 7th Joint Conference of the Ergonomics Society of Korea and the Japan Ergonomics Society, 2003
  75. ChangHoon Park, HeeDong Ko, Changseok Cho, Hee-Kap Ahn, Yo-Sub Han, TaiYun Kim.
    NAVER: Design and Implementation of Networked Virtual Environments Based on PC Cluster.
    In Proc. 6th Joint Conference of the Ergonomics Society of Korea and the Japan Ergonomics Society, pages 221-228, 2002
  76. Jaeho Chang, Heedong Ko, Hee-Kap Ahn, Changhoon Park.
    NAVER Musical Composition Environment.
    In Proc. Virtual Systems and MultiMedia (VSMM 2002), pages 809-814, 2002
  77. ChangHoon Park, HeeDong Ko, Hee-Kap Ahn, Jinwook Kim.
    NAVER: design and implementation of XML-based VR Framework on a PC cluster.
    In Proc. Virtual Systems and MultiMedia (VSMM 2002) pages 967-975, 2002
  78. Hee-Kap Ahn, Otfried Cheong, René van Oostrum.
    Casting a Polyhedron with Directional Uncertainty.
    In Proc. 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002) LNCS 2518, pages 274-285, 2002
  79. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai Golin, René van Oostrum.
    Compatitive Facility Location along a Highway.
    In Proc. 7th Annual International Computing and Combinatorics Conference (COCOON 2001) LNCS 2108, pages 237-246, 2001
  80. Hee-Kap Ahn, Siu-wing Cheng, Otfried Cheong, Jack Snoeyink.
    The Reflex-Free Hull.
    In Proc. 13th Canadian Conference on Computational Geometry (CCCG 2001) pages 9-12, 2001

  81. Hee-Kap Ahn, Otfried Cheong, Jiri Matousek, Antoine Vigneron.
    Reachability by Paths of Bounded Curvature in Convex Polygons.
    In Proc. 16th Annu. ACM Symposium on Computational Geometry (SoCG 2000) pages 251-259, 2000
  82. H.-K. Ahn, P. Bose, J. Czyzowicz, N. Hanusse, E. Kranakis, P. Morin.
    Flipping your Lid.
    In Proc. 12th Canadian Conference on Computational Geometry (CCCG 2000) pages 13-16, 2000
  83. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong.
    Casting with Skewed Ejection Direction Revisited.
    In Proc. 11th Canadian Conference on Computational Geometry (CCCG 1999) pages 128-131, 1999
  84. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong.
    Casting with Skewed Ejection Direction.
    In Proc. 9th Ann. International Symposium on Algorithms and Computation (ISAAC 1998) LNCS 1533, pages 139-148, 1998
  85. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jiri Matousek, Otfried Schwarzkopf.
    Separating an Object from its Cast.
    In Proc. 13th Annu. ACM Symposium on Computational Geometry (SoCG 1997) pages 221-230, 1997

Others – presentations and talks at workshops

  1. Taekang Eom, Hee-Kap Ahn.
    An Optimal Algorithm for Weighted Center Problem on Cycle Graphs.
    In Proc. 38th European Workshop on Computational Geometry (EuroCG 2022), 2022
  2. Hwi Kim, Hee-Kap Ahn.
    Rectangualr Partitioning Algorithm for Histogons.
    KIISE Transactions on Computing Practices, 28(2), pages 128-133, 2022.
  3. Garam Kim, Jongmin Choi, Hee-Kap Ahn.
    Maximum Overlap of Two Convex Polygons.
    KIISE Transactions on Computing Practices, 27(8), pages 400-405, 2021.
  4. Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn.
    Intersecting Disks using Two Congruent Disks.
    In Proc. 37th European Workshop on Computational Geometry (EuroCG 2021), 2021
  5. Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn and Darren Strash.
    On Romeo and Juliet Problems: Minimizing Distance-to-Sight.
    In Proc. 34th European Workshop on Computational Geometry (EuroCG 2018), 2018
  6. 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.
    In Proc. 31st European Workshop on Computational Geometry (EuroCG 2015), 2015
  7. Hee-Kap Ahn, Helmut Alt, Maike Buchin, Ludmila Scharf, Carola Wenk.
    A Middle Curve Based on Discrete Fréchet Distance.
    In Proc. 31st European Workshop on Computational Geometry (EuroCG 2015), 2015
  8. Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon.
    Overlap of Convex Polytopes under Rigid Motion.
    In Proc. 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012), 2012.
  9. Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa.
    Rectilinear Covering for Imprecise Input Points.
    In Proc. 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012), 2012.
  10. Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son.
    Computing Euclidean 2-centers over Streaming Data.
    In Proc. 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012), 2012.
  11. Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Hyeon-Suk Na, Lena Schlipf, Chan-Su Shin, Antoine Vigneron.
    Covering and Piercing Disks with Two Centers.
    In Proc. 27th European Workshop on Computational Geometry (EuroCG 2011), 2011.
  12. Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron.
    Computing the Discrete Fréchet Distance with Imprecise Input.
    In Proc. 26th European Workshop on Computational Geometry (EuroCG 2010), pages 13-16, 2010.
  13. Hee-Kap Ahn, Yoshio Okamoto, Iris Reinbacher.
    Tracing a Virus.
    In Proc. 3rd AAAC Annual Meeting, 2010.
  14. Wanbin Son, Hee-Kap Ahn.
    Skyline Queries in Metric Space.
    In Proc. 3rd AAAC Annual Meeting, 2010.
  15. Hee-Kap Ahn, Yoshio Okamoto.
    Adaptive Computational Geometry.
    In RIMS Proceedings of Workshop, pages 114-125, 2009.
  16. Hee-Kap Ahn, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron.
    Computing the Discrete Fréchet Distance with Imprecise Input.
    In Proc. 12th Korea-Japan Joint Workhop on Algorithms and Computation (WAAC 2009), pages 132-137, 2009.
  17. Hee-Kap Ahn, Yoshio Okamoto.
    An Adaptive Algorithm for the Planar Convex Hull.
    In Proc. 2nd AAAC Annual Meeting, 2009.
  18. Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son.
    Square and Rectangle Covering with Outliers.
    In Proc. 25th European Workshop on Computational Geometry, pages 273-276, 2009.
  19. Hee-Kap Ahn, Yoshio Okamoto.
    Adaptive Computational Geometry.
    In Proc. Workshop on Computational Geometry and Discrete Mathematics, Gyoto, Japan, pages 51-54, 2008
  20. Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher.
    Maximum Overlap of Convex Polytopes under Translation.
    In Proc. 11th Japan-Korea Joint Workshop on Algorithms and Computation, pages 181-188, 2008.
  21. Sang Won Bae, Hee-Kap Ahn.
    Optimal Disjoint Two-box Covering of Points.
    In Proc. 1st AAAC Annual Meeting, 2008.
  22. Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher.
    Translation Algorithms for Overlaying Convex Polyhedra.
    In Proc. 1st AAAC Annual Meeting, 2008
  23. Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa.
    Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations.
    In Proc. 10th Korea-Japan Joint Workshop on Algorithms and Computation, pages 64-71, 2007.
  24. Hee-Kap Ahn, Mark de Berg, Otfried Cheong, Herman Haverkort, Frank van der Stappen, Laura Toma.
    River Networks and Watershed Maps of Triangulated Terrains Revisited.
    In Proc. 22nd European Workshop on Computational Geometry (EWCG 2006), pages 173-176, 2006
  25. Hee-Kap Ahn, Sang Won Bae, Otfried Cheong.
    A New Geometric Proof on Shortest Paths with Bounded Curvature.
    In Proc. 32nd KISS fall conference, pages 958-960, 2005
  26. Chong-Dae Park, Chan-Su Shin, Hee-Kap Ahn, Otfried Cheong, Antoine Vigneron.
    Approximation algorithms for maximizing the overlap of two planar convex sets under rigid motions.
    In Proc. Korea Computer Congress 2005, pages 901-903, 2005
  27. Hyeon-Suk Na, Chan-Su Shin, Hee-Kap Ahn.
    Geometric properties of roofs of rectilinear polygons.
    In Proc. Korea Computer Congress 2005, pages 895-897, 2005
  28. Hee-Kap Ahn, Yo-Sub Han, Chan-Su Shin.
    Approximating a Minimum-Diameter Spanning Tree with Bounded Degree.
    In Proc. Japan Conference on Discrete and Computational Geometry (JCDCG 2004)
  29. Yong Hee Park, Sang Won Bae, Hee-Kap Ahn, Kyung-Yong Chwa.
    Casting an Object with a Core.
    In Proc. 31st KISS fall conference, pages 706-708, 2004
  30. Chong-Dae Park, Chan-Su Shin, Hee-Kap Ahn, Hyunsub Lee, Kyung-Yong Chwa, Otfried Cheong.
    Approximating the Largest Empty and Fat Rectangle.
    In Proc. 31st KISS spring conference, pages 718-720, 2004
  31. Hee-Kap Ahn, Yo-Sub Han, Chan-Su Shin.
    Minimum Diameter Spanning Tree with Bounded Degree.
    In Proc. 30th KISS spring conference pages 806-808, 2003.
  32. Heedong Ko, Hee-Kap Ahn, Jin-Wook Kim, Jong-Guk Kim, Jae-Bok Song, Hong-Jun Eu, Myung-Whan Yun, In-Su Woo, Yeon-Dong Park.
    Evaluation of Car Prototype using CAVE-like Systems.
    In Proc. 30th KSES spring conference pages 66-73, 2002.
  33. Hee-Kap Ahn.
    Geometric Aspects of the Casting Process.
    Ph.D. Thesis, ISBN 90-393-2869-2, Utrecht University.
  34. Hee-Kap Ahn, Nikos Mamoulis, Ho Min Wong.
    A Survey on Multidimensional Access Methods.
    Tech.Report, UU-CS-2001-14, May 2001, Institute of Information and Computing Sciences, Utrecht University
  35. Hee-Kap Ahn, Otfried Cheong, Chan-Su Shin.
    Bridging Convex Regions and Related Problems.
    In Proc. 17th European Workshop on Computational Geometry (CG 2001) pages 53-56, 2001.
    Invited to Computational Geometry: Theory and Applications
  36. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong.
    Casting with Skewed Ejection Direction (extended abstract).
    In Proc. First ACM HongKong Postgraduate Research Day (1998)
  37. Hee-Kap Ahn.
    Casting with two-part cast: Opposite and Non-opposite cast removal.
    Master Thesis, POSTECH.
  38. Hee-Kap Ahn, Otfried Schwarzkopf.
    Castable Polyhedra in General Setting.
    In Proc. 24th KISS spring conference pages 703-706, 1997.