Skip to main content

안희갑 교수

Hee Kap Ahn

포항공과대학교 컴퓨터공학과 · 컴퓨터과학

연구실 소개

안희갑 교수의 연구실은 공간 데이터 처리 및 기하 알고리즘 분야에서 핵심적인 연구를 수행하고 있습니다. 특히 다차원 인덱싱 기법, 불확실한 점을 포함한 곡선 간 거리 측정(예: 이산 프리에체 거리), 도로가 있는 도시 거리 모델링, 그리고 제약 조건이 있는 로봇 경로 탐색 등 기하학적 최적화 문제에 초점을 맞추고 있습니다. 이는 대규모 지도 데이터 처리, 지능형 이동체 경로 계획, 그리고 정밀 측정 기반의 지능형 시스템 설계 등 실생활 응용과도 密하게 연결되어 있습니다.

다차원 인덱싱불확실한 점도시 거리 모델링로봇 경로 최적화기하 알고리즘

연구 현황

논문 수
196
총 인용 수
1,223
최근 5년 논문
48
주요 분야
컴퓨터과학

연구 성과 추이

표시된 성과는 수집된 데이터 기준으로 산출되며, 일부 차이가 있을 수 있습니다.

5개년 연도별 논문 게재 수
48총합
2022
2023
2024
2025
2026
5개년 연도별 피인용 수
101총합
20222023202420252026

주요 논문

15
1
논문|인용수 117·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
논문|인용수 51·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
논문|인용수 42·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
논문|인용수 30·2013
MSSQ: Manhattan Spatial Skyline Queries
Wanbin Son, Seung-won Hwang, Hee-Kap Ahn
SJR Q1Information Systems
Signal ProcessingComputer Science
5
book chapter|인용수 27·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
논문|인용수 26·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
논문|인용수 24·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
논문|인용수 23·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
논문|인용수 22·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
논문|인용수 21·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
논문|인용수 21·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
논문|인용수 20·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
논문|인용수 19·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
논문|인용수 15·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
논문|인용수 15·2017
Top-k Manhattan spatial skyline queries
Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn
SJR Q3Information Processing Letters
Signal ProcessingComputer Science

대표 연구 분야

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

안희갑 교수의 연구를 Nubint에서 더 깊이 살펴보세요

이 연구실의 논문을 앱에서 열어 AI와 함께 읽고, 핵심을 요약하고, 내 글에 인용하세요.