Hee-Kap Ahn

Citée par

	Toutes	Depuis 2019
Citations	1493	593
indice h	20	12
indice i10	43	21

140

105

20002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320244 7 16 15 22 35 38 35 38 47 43 58 59 69 71 63 75 81 85 101 80 100 88 133 84

Accès public

Tout afficher

11 articles

1 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Sang Won BaeKyonggi UniversityAdresse e-mail validée de kgu.ac.kr
Chan-Su Shin (신찬수)Professor of Division of Computer Engineering, Hankuk University of Foreign StuidesAdresse e-mail validée de hufs.ac.kr
Siu-Wing ChengProfessor, Department of Computer Science and Engineering, HKUSTAdresse e-mail validée de cse.ust.hk
Wanbin SonPOSTECH, Republic of KoreaAdresse e-mail validée de postech.ac.kr
Antoine VigneronAssociate Professor of Computer Science, Ulsan National Institute of Science and TechnologyAdresse e-mail validée de unist.ac.kr
Christian KnauerInstitut für Informatik, Universität BayreuthAdresse e-mail validée de uni-bayreuth.de
Prosenjit BoseCarleton UniversityAdresse e-mail validée de scs.carleton.ca
René van OostrumAMDAdresse e-mail validée de 59bits.nl
Seung-won HwangSeoul National UniversityAdresse e-mail validée de snu.ac.kr
Peter BrassProfessor of Computer Science, City College of New YorkAdresse e-mail validée de cs.ccny.cuny.edu
Yoonho HwangPOSETCHAdresse e-mail validée de postech.ac.kr
Kyung-Yong Chwaprofessor of computer science, KAISTAdresse e-mail validée de kaist.ac.kr
Mark de BergProfessor of Computer Science, TU EindhovenAdresse e-mail validée de win.tue.nl
Jean-Lou De CarufelAssistant Professor of Computer Science, University of OttawaAdresse e-mail validée de uottawa.ca
Bohyung HanProfessor, Seoul National UniversityAdresse e-mail validée de snu.ac.kr
Sunghee ChoiAssociate Professor of School of Computing, KAISTAdresse e-mail validée de kaist.edu
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgAdresse e-mail validée de uni-wuerzburg.de
Tetsuo AsanoProfessor of School of Information Science, JAISTAdresse e-mail validée de jaist.ac.jp
Nikos MamoulisUniversity of IoanninaAdresse e-mail validée de cs.uoi.gr
Heedong KoKorea Institute of Science and Technology (KIST)Adresse e-mail validée de kist.re.kr

Suivre

Hee-Kap Ahn

Professor, Graduate School of Artificial Intelligence, Dept. Computer Science and Engineering

Adresse e-mail validée de postech.ac.kr - Page d'accueil

Computational Geometry Discrete and Computational Geometry Algorithms


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
Competitive facility location: the Voronoi game HK Ahn, SW Cheng, O Cheong, M Golin, R Van Oostrum Theoretical Computer Science 310 (1), 457-467, 2004	176	2004
A fast nearest neighbor search algorithm by nonlinear embedding Y Hwang, B Han, HK Ahn Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on …, 2012	81	2012
Separating an object from its cast HK Ahn, M De Berg, P Bose, SW Cheng, D Halperin, J Matoušek, ... Computer-Aided Design 34 (8), 547-559, 2002	68	2002
A survey on multidimensional access methods HK Ahn, N Mamoulis, HM Wong	60	2001
Spatial skyline queries: An efficient geometric algorithm W Son, MW Lee, HK Ahn, SW Hwang Advances in Spatial and Temporal Databases, 247-264, 2009	57	2009
Computing the discrete Fréchet distance with imprecise input HK Ahn, C Knauer, M Scherfenberg, L Schlipf, A Vigneron International Journal of Computational Geometry & Applications 22 (01), 27-44, 2012	52	2012
Competitive facility location along a highway HK Ahn, SW Cheng, O Cheong, M Golin, R Van Oostrum International Computing and Combinatorics Conference, 237-246, 2001	48	2001
MSSQ: Manhattan spatial skyline queries W Son, S Hwang, HK Ahn Information Systems 40, 67-83, 2014	47	2014
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon HK Ahn, L Barba, P Bose, JLD Carufel, M Korman, E Oh 31st International Symposium on Computational Geometry (SoCG 2015) 34, 209--223, 2015	43	2015
Reachability by paths of bounded curvature in convex polygons HK Ahn, O Cheong, J Matoušek, A Vigneron Proceedings of the sixteenth annual symposium on Computational geometry, 251-259, 2000	42	2000
Maximizing the overlap of two planar convex sets under rigid motions HK Ahn, O Cheong, CD Park, CS Shin, A Vigneron Proceedings of the twenty-first annual symposium on Computational geometry …, 2005	37	2005
Computing minimum-area rectilinear convex hull and L-shape SW Bae, C Lee, HK Ahn, S Choi, KY Chwa Computational Geometry 42 (9), 903-912, 2009	35	2009
Accuracy and efficiency of automatic tooth segmentation in digital dental models using deep learning J Im, JY Kim, HS Yu, KJ Lee, SH Choi, JH Kim, HK Ahn, JY Cha Scientific reports 12 (1), 9429, 2022	33	2022
Covering points by disjoint boxes with outliers HK Ahn, SW Bae, ED Demaine, ML Demaine, SS Kim, M Korman, ... Computational Geometry 44 (3), 178-190, 2011	28	2011
Constructing optimal highways HK Ahn, H Alt, T Asano, SW Bae, P Brass, O Cheong, C Knauer, HS Na, ... International Journal of Foundations of Computer Science 20 (01), 3-23, 2009	27	2009
Maximum overlap and minimum convex hull of two convex polyhedra under translations HK Ahn, P Brass, CS Shin Computational Geometry 40 (2), 171-177, 2008	26	2008
Voronoi diagrams for a moderate-sized point-set in a simple polygon E Oh, HK Ahn Discrete & Computational Geometry 63 (2), 418-454, 2020	25	2020
Aligning two convex figures to minimize area or perimeter HK Ahn, O Cheong Algorithmica 62 (1-2), 464-479, 2012	21	2012
Convergent bounds on the euclidean distance Y Hwang, HK Ahn Advances in neural information processing systems 24, 2011	21	2011
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets HK Ahn, P Brass, O Cheong, HS Na, CS Shin, A Vigneron Computational Geometry 33 (3), 152-164, 2006	21	2006

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs