Personal information

Websites & social links

Homepage

Other IDs

Scopus Author ID: 57192175400
Scopus Author ID: 57733512300

Keywords

Algorithms, Computational Geometry, Data Structures, Artificial Intelligence

Countries

South Korea

Biography

Professor at POSTECH

Activities

Collapse all

Employment (1)

Pohang University of Science and Technology (POSTECH): Pohang, Gyeongsangbuk-do, KR

2007-07-15 to present | Professor (Computer Science and Engineering)
Employment
Source: Self-asserted source
Hee-Kap Ahn

Works (50 of 163)

Items per page:
Page 1 of 4

Largest unit rectangles inscribed in a convex polygon

Computational Geometry
2025-01 | Journal article
DOI: 10.1016/j.comgeo.2024.102135
Contributors: Jaehoon Chung; Sang Won Bae; Chan-Su Shin; Sang Duk Yoon; Hee-Kap Ahn
Source: check_circle
Crossref

Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions

2024 | Book chapter
DOI: 10.1007/978-3-031-55598-5_20
Contributors: Taehoon Ahn; Chaeyoon Chung; Hee-Kap Ahn; Sang Won Bae; Otfried Cheong; Sang Duk Yoon
Source: check_circle
Crossref

Uniformly monotone partitioning of polygons

Theoretical Computer Science
2024-10 | Journal article
DOI: 10.1016/j.tcs.2024.114724
Part of ISSN: 0304-3975
Contributors: Hwi Kim; Jaegun Lee; Hee-Kap Ahn
Source: Self-asserted source
Hee-Kap Ahn

Stacking Monotone Polytopes

Symmetry
2024-09-23 | Journal article
DOI: 10.3390/sym16091246
Contributors: Hee-Kap Ahn; Seung Joon Lee; Sang Duk Yoon
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

A linear-time algorithm for the center problem in weighted cycle graphs

Information Processing Letters
2024-08 | Journal article
DOI: 10.1016/j.ipl.2024.106495
Part of ISSN: 0020-0190
Contributors: Taekang Eom; Hee-Kap Ahn
Source: Self-asserted source
Hee-Kap Ahn

Maximum Coverage by k Lines

Symmetry
2024-02-09 | Journal article
DOI: 10.3390/sym16020206
Contributors: Chaeyoon Chung; Antoine Vigneron; Hee-Kap Ahn
Source: check_circle
Crossref

Efficient k-Center Algorithms for Planar Points in Convex Position

2023 | Book chapter
DOI: 10.1007/978-3-031-38906-1_18
Contributors: Jongmin Choi; Jaegun Lee; Hee-Kap Ahn
Source: check_circle
Crossref

Universal convex covering problems under translations and discrete rotations

Advances in Geometry
2023-10-26 | Journal article
DOI: 10.1515/advgeom-2023-0021
Part of ISSN: 1615-7168
Part of ISSN: 1615-715X
Contributors: Mook Kwon Jung; Sang Duk Yoon; Hee-Kap Ahn; Takeshi Tokuyama
Source: Self-asserted source
Hee-Kap Ahn

Three-dimensional evaluation of a virtual setup considering the roots and alveolar bone in molar distalization cases

Scientific Reports
2023-09-11 | Journal article
DOI: 10.1038/s41598-023-41480-z
Part of ISSN: 2045-2322
Contributors: Jaewook Huh; Jing Liu; Jae-Hun Yu; Yoon Jeong Choi; Hee-Kap Ahn; Chooryung J. Chung; Jung-Yul Cha; Kyung-Ho Kim
Source: Self-asserted source
Hee-Kap Ahn

Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles

Algorithmica
2023-08 | Journal article
DOI: 10.1007/s00453-022-01094-9
Contributors: Mincheol Kim; Chanyang Seo; Taehoon Ahn; Hee-Kap Ahn
Source: check_circle
Crossref

Reliability and time-based efficiency of artificial intelligence-based automatic digital model analysis system

European Journal of Orthodontics
2023-07-07 | Journal article
DOI: 10.1093/ejo/cjad032
Part of ISSN: 0141-5387
Part of ISSN: 1460-2210
Contributors: Jae-Hun Yu; Ji-Hoi Kim; Jing Liu; Utkarsh Mangal; Hee-Kap Ahn; jung yul cha
Source: Self-asserted source
Hee-Kap Ahn

Intersecting disks using two congruent disks

Computational Geometry
2023-03 | Journal article
DOI: 10.1016/j.comgeo.2022.101966
Contributors: Byeonguk Kang; Jongmin Choi; Hee-Kap Ahn
Source: check_circle
Crossref

Rectangular partitions of a rectilinear polygon

Computational Geometry
2023-03 | Journal article
DOI: 10.1016/j.comgeo.2022.101965
Contributors: Hwi Kim; Jaegun Lee; Hee-Kap Ahn
Source: check_circle
Crossref

Covering convex polygons by two congruent disks

Computational Geometry
2023-02 | Journal article
DOI: 10.1016/j.comgeo.2022.101936
Contributors: Jongmin Choi; Dahye Jeong; Hee-Kap Ahn
Source: check_circle
Crossref

Accuracy and efficiency of automatic tooth segmentation in digital dental models using deep learning

Scientific Reports
2022 | Journal article
DOI: 10.1038/s41598-022-13595-2
EID:

2-s2.0-85131658455

Part of ISSN: 20452322
Contributors: Im, J.; Kim, J.-Y.; Yu, H.-S.; Lee, K.-J.; Choi, S.-H.; Kim, J.-H.; Ahn, H.-K.; Cha, J.-Y.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

CGTA Awards

Computational Geometry: Theory and Applications
2022 | Journal article
DOI: 10.1016/j.comgeo.2022.101896
EID:

2-s2.0-85130390943

Part of ISSN: 09257721
Contributors: Ahn, H.-K.; Mtsentlintze, T.; Sack, J.-R.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Farthest-point Voronoi diagrams in the presence of rectangular obstacles

arXiv
2022 | Other
EID:

2-s2.0-85126925494

Part of ISSN: 23318422
Contributors: Kim, M.; Seo, C.; Ahn, T.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Rearranging a sequence of points onto a line

Computational Geometry
2022-12 | Journal article
DOI: 10.1016/j.comgeo.2022.101887
Contributors: Taehoon Ahn; Jongmin Choi; Chaeyoon Chung; Hee-Kap Ahn; Sang Won Bae; Sang Duk Yoon
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Minimum-link shortest paths for polygons amidst rectilinear obstacles

Computational Geometry
2022-04 | Journal article
DOI: 10.1016/j.comgeo.2022.101858
Contributors: Mincheol Kim; Hee-Kap Ahn
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Covering convex polygons by two congruent disks

arXiv
2021 | Other
EID:

2-s2.0-85107880147

Part of ISSN: 23318422
Contributors: Choi, J.; Jeong, D.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Covering Convex Polygons by Two Congruent Disks

2021 | Book chapter
DOI: 10.1007/978-3-030-79987-8_12
Contributors: Jongmin Choi; Dahye Jeong; Hee-Kap Ahn
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Intersecting Disks Using Two Congruent Disks

2021 | Book chapter
DOI: 10.1007/978-3-030-79987-8_28
Contributors: Byeonguk Kang; Jongmin Choi; Hee-Kap Ahn
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Largest Similar Copies of Convex Polygons in Polygonal Domains

Leibniz International Proceedings in Informatics, LIPIcs
2021 | Conference paper
DOI: 10.4230/LIPIcs.FSTTCS.2021.19
EID:

2-s2.0-85122427989

Part of ISSN: 18688969
Contributors: Eom, T.; Lee, S.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Minimum-link shortest paths for polygons amidst rectilinear obstacles

arXiv
2021 | Other
EID:

2-s2.0-85109865802

Part of ISSN: 23318422
Contributors: Kim, M.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Preface

Leibniz International Proceedings in Informatics, LIPIcs
2021 | Conference paper
DOI: 10.4230/LIPIcs.ISAAC.2021.0
EID:

2-s2.0-85122475151

Part of ISSN: 18688969
Contributors: Ahn, H.-K.; Sadakane, K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Rectangular partitions of a rectilinear polygon

arXiv
2021 | Other
EID:

2-s2.0-85119576874

Part of ISSN: 23318422
Contributors: Kim, H.; Lee, J.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Shortest rectilinear path queries to rectangles in a rectangular domain

Computational Geometry
2021-12 | Journal article
DOI: 10.1016/j.comgeo.2021.101796
Contributors: Mincheol Kim; Sang Duk Yoon; Hee-Kap Ahn
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Maximizing Dominance in the Plane and its Applications

Algorithmica
2021-11-13 | Journal article
DOI: 10.1007/s00453-021-00863-2
Contributors: Jongmin Choi; Sergio Cabello; Hee-Kap Ahn
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Largest triangles in a polygon

Computational Geometry
2021-10 | Journal article
DOI: 10.1016/j.comgeo.2021.101792
Contributors: Seungjun Lee; Taekang Eom; Hee-Kap Ahn
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Efficient planar two-center algorithms

Computational Geometry
2021-08 | Journal article
DOI: 10.1016/j.comgeo.2021.101768
Contributors: Jongmin Choi; Hee-Kap Ahn
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Maximum-area and maximum-perimeter rectangles in polygons

Computational Geometry
2021-03 | Journal article
DOI: 10.1016/j.comgeo.2020.101710
Contributors: Yujin Choi; Seungjun Lee; Hee-Kap Ahn
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Efficient planar two-center algorithms<sup>∗</sup>

arXiv
2020 | Other
EID:

2-s2.0-85095518670

Part of ISSN: 23318422
Contributors: Choi, J.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Largest similar copies of convex polygons amidst polygonal obstacles

arXiv
2020 | Other
EID:

2-s2.0-85100227560

Part of ISSN: 23318422
Contributors: Eom, T.; Lee, S.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Largest triangles in a polygon

arXiv
2020 | Other
EID:

2-s2.0-85095335954

Part of ISSN: 23318422
Contributors: Lee, S.; Eom, T.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Middle curves based on discrete Fréchet distance

Computational Geometry: Theory and Applications
2020 | Journal article
DOI: 10.1016/j.comgeo.2020.101621
EID:

2-s2.0-85079184540

Part of ISSN: 09257721
Contributors: Ahn, H.-K.; Alt, H.; Buchin, M.; Oh, E.; Scharf, L.; Wenk, C.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain

2020 | Book chapter
DOI: 10.1007/978-3-030-61792-9_22
Contributors: Mincheol Kim; Sang Duk Yoon; Hee-Kap Ahn
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon

Algorithmica
2020-05-11 | Journal article
DOI: 10.1007/s00453-019-00651-z
Contributors: Eunjin Oh; Luis Barba; Hee-Kap Ahn
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon

Discrete & Computational Geometry
2020-03-01 | Journal article
DOI: 10.1007/s00454-019-00063-4
Contributors: Eunjin Oh; Hee-Kap Ahn
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Assigning weights to minimize the covering radius in the plane

Computational Geometry: Theory and Applications
2019 | Journal article
DOI: 10.1016/j.comgeo.2018.10.007
EID:

2-s2.0-85062383564

Part of ISSN: 09257721
Contributors: Oh, E.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Computing a geodesic two-center of points in a simple polygon

arXiv
2019 | Other
EID:

2-s2.0-85094267975

Part of ISSN: 23318422
Contributors: Oh, E.; Bae, S.W.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Computing a geodesic two-center of points in a simple polygon

Computational Geometry: Theory and Applications
2019 | Journal article
DOI: 10.1016/j.comgeo.2019.05.001
EID:

2-s2.0-85065601769

Part of ISSN: 09257721
Contributors: Oh, E.; Bae, S.W.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Computing the Center Region and Its Variants

arXiv
2019 | Other
EID:

2-s2.0-85094005726

Part of ISSN: 23318422
Contributors: Oh, E.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Faster algorithms for growing prioritized disks and rectangles

Computational Geometry: Theory and Applications
2019 | Journal article
DOI: 10.1016/j.comgeo.2019.02.001
EID:

2-s2.0-85062414647

Part of ISSN: 09257721
Contributors: Ahn, H.-K.; Bae, S.W.; Choi, J.; Korman, M.; Mulzer, W.; Oh, E.; Park, J.-W.; van Renssen, A.; Vigneron, A.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Finding pairwise intersections of rectangles in a query rectangle

Computational Geometry: Theory and Applications
2019 | Journal article
DOI: 10.1016/j.comgeo.2019.101576
EID:

2-s2.0-85072304205

Part of ISSN: 09257721
Contributors: Oh, E.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Maximizing Dominance in the Plane and Its Applications

2019 | Book chapter
DOI: 10.1007/978-3-030-24766-9_24
Contributors: Jongmin Choi; Sergio Cabello; Hee-Kap Ahn
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Maximum-area rectangles in a simple polygon

Leibniz International Proceedings in Informatics, LIPIcs
2019 | Conference paper
DOI: 10.4230/LIPIcs.FSTTCS.2019.12
EID:

2-s2.0-85077471312

Part of ISSN: 18688969
Contributors: Choi, Y.; Lee, S.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Maximum-Area Rectangles in a Simple Polygon

arXiv
2019 | Other
EID:

2-s2.0-85093568932

Part of ISSN: 23318422
Contributors: Choi, Y.; Lee, S.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

On Romeo and Juliet problems: Minimizing distance-to-sight

Computational Geometry: Theory and Applications
2019 | Journal article
DOI: 10.1016/j.comgeo.2019.07.003
EID:

2-s2.0-85069965926

Part of ISSN: 09257721
Contributors: Ahn, H.-K.; Oh, E.; Schlipf, L.; Stehn, F.; Strash, D.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

Polygon Queries for Convex Hulls of Points

arXiv
2019 | Other
EID:

2-s2.0-85094270655

Part of ISSN: 23318422
Contributors: Oh, E.; Ahn, H.-K.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier

The minimum convex container of two convex polytopes under translations

Computational Geometry: Theory and Applications
2019 | Journal article
DOI: 10.1016/j.comgeo.2018.02.004
EID:

2-s2.0-85042623144

Part of ISSN: 09257721
Contributors: Ahn, H.-K.; Abardia, J.; Bae, S.W.; Cheong, O.; Dann, S.; Park, D.; Shin, C.-S.
Source: Self-asserted source
Hee-Kap Ahn via Scopus - Elsevier
Items per page:
Page 1 of 4

Peer review (2 reviews for 2 publications/grants)

Review activity for Algorithmica. (1)
Review activity for Discrete & computational geometry. (1)
How many people are using ORCID?