Skip to main content

Hee Kap Ahn

Pohang University of Science and Technology · Computer Science

About the Lab

Professor Hee Kap Ahn's research lab specializes in computational geometry and geometric algorithms, focusing on efficient algorithms for spatial data structures, geometric optimization, and motion planning. The lab investigates fundamental problems related to proximity queries, Fréchet distance under uncertainty, and transportation networks with speed-dependent metrics. Current work emphasizes the design of efficient algorithms for imprecise geometric data and motion-constrained robots in polygonal environments.

computational geometrygeometric algorithmsFréchet distancemotion planningspatial data structures

Research Overview

Papers
196
Total Citations
1,223
Papers (5y)
48
Primary Field
Computer Science

Research Output Trend

Figures are computed from collected data and may differ slightly.

Publications per year (5y)
48total
2022
2023
2024
2025
2026
Citations per year (5y)
101total
20222023202420252026

Selected Papers

15
1
Article|117 citations·2003
Competitive facility location: the Voronoi game
Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum
SJR Q2Theoretical Computer ScienceOA
Organizational Behavior and Human Resource ManagementBusiness, Management and Accounting
2
Article|51 citations·2002
Separating an object from its cast
Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jiřı́ Matoušek, Otfried Schwarzkopf
SJR Q1Computer-Aided Design
Computer Graphics and Computer-Aided DesignComputer Science
3
Article|42 citations·2001
A survey on multidimensional access methods
Hee-Kap Ahn, Nikos Mamoulis, Ho Min Wong
Data Archiving and Networked Services (DANS)OA

The extraordinary format of spatial data and the fact that there is no straightforward mapping of spatial
\nobjects from the multidimensional space to the 1-dimensional space, stimulated various researchers
\nduring the past two decades to develop multidimensional access methods that facilitate efficient
\nindexing of spatial objects in large databases. This survey paper tries a classification of existing
\nmultidimensional access methods, according to the types of data they are

Signal ProcessingComputer Science
4
Article|30 citations·2013
MSSQ: Manhattan Spatial Skyline Queries
Wanbin Son, Seung-won Hwang, Hee-Kap Ahn
SJR Q1Information Systems
Signal ProcessingComputer Science
5
Book Chapter|27 citations·2001
Competitive Facility Location along a Highway
Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum
SJR Q2Lecture notes in computer science
Organizational Behavior and Human Resource ManagementBusiness, Management and Accounting
6
Article|26 citations·2006
Maximizing the overlap of two planar convex sets under rigid motions
Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron
SJR Q3Computational Geometry
Computer Graphics and Computer-Aided DesignComputer Science
7
Article|24 citations·2016
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh
SJR Q2Discrete & Computational Geometry
Computer Graphics and Computer-Aided DesignComputer Science
8
Article|23 citations·2012
COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT
Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
SJR Q4International Journal of Computational Geometry & Applications

We consider the problem of computing the discrete Fréchet distance between two polygonal curves when their vertices are imprecise. An imprecise point is given by a region and this point could lie anywhere within this region. By modelling imprecise points as balls in dimension d, we present an algorithm for this problem that returns in time 2 O(d 2 ) m 2 n 2 log 2 (mn) the minimum Fréchet distance between two imprecise polygonal curves with n and m vertices, respectively. We give an improved algo

Computer Graphics and Computer-Aided DesignComputer Science
9
Article|22 citations·2009
Computing minimum-area rectilinear convex hull and L-shape
Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung‐Yong Chwa
SJR Q3Computational Geometry
Computer Graphics and Computer-Aided DesignComputer Science
10
Article|21 citations·2010
Covering points by disjoint boxes with outliers
Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son
SJR Q3Computational Geometry
Computer Graphics and Computer-Aided DesignComputer Science
11
Article|21 citations·2005
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
SJR Q3Computational Geometry
Computer Graphics and Computer-Aided DesignComputer Science
12
Article|20 citations·2010
Aligning Two Convex Figures to Minimize Area or Perimeter
Hee-Kap Ahn, Otfried Cheong
SJR Q1Algorithmica
Computer Graphics and Computer-Aided DesignComputer Science
13
Article|19 citations·2007
Maximum overlap and minimum convex hull of two convex polyhedra under translations
Hee-Kap Ahn, Peter Braß, Chan-Su Shin
SJR Q3Computational Geometry
Computer Graphics and Computer-Aided DesignComputer Science
14
Article|15 citations·2011
Reachability by paths of bounded curvature in a convex polygon
Hee-Kap Ahn, Otfried Cheong, Jiřı́ Matoušek, Antoine Vigneron
SJR Q3Computational Geometry
Computer Vision and Pattern RecognitionComputer Science
15
Article|15 citations·2017
Top-k Manhattan spatial skyline queries
Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn
SJR Q3Information Processing Letters
Signal ProcessingComputer Science

Research Areas

Computer Graphics and Computer-Aided DesignSignal ProcessingApplied MathematicsComputer Vision and Pattern RecognitionComputational Theory and MathematicsIndustrial and Manufacturing Engineering

Dive deeper into Hee Kap Ahn's research on Nubint

Open this lab's papers in the app to read with AI, summarize, and cite in your writing.