Profile

 Hee-Kap Ahn 사진
Profile.
Name Hee-Kap Ahn
Organization Dept of Mathematics
Telephone 279-2387
E-mail HEEKAP@POSTECH.AC.KR
Homepage http://tcs.postech.ac.kr/~heekap

Education

  • 2000~2001 UNIVERSITEIT UTRECHT (졸업-전산학과)
  • 1997~2000 香港科技大學 (수료-전산학과)
  • 1996~1998 POSTECH (졸업-전자계산학과)
  • 1992~1996 경북대학교 (졸업-컴퓨터공학과)

Career

  • 2006~2007 : 세종대학교 전자정보공학대학 컴퓨터공학전공
  • 2004~2006 : 한국과학기술원 정보전자연구소
  • 2001~2004 : 한국과학기술연구원 시스템연구부장실

Profession

  • Theoretical Computer Science
  • Algorithms
  • Computational & Discrete Geometry

Journal Papers

International

  • Bundling three convex polygons to minimize area or perimeter, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 51, 1-14 (2016)
  • A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon, DISCRETE & COMPUTATIONAL GEOMETRY, , 56, 836-859 (2016)
  • An improved data stream algorithm for clustering, Computational Geometry, , 48, 635-645 (2015)
  • Group nearest-neighbor queries in the L-1 plane, THEORETICAL COMPUTER SCIENCE, , 592, 39-48 (2015)
  • MSSQ: Manhattan Spatial Skyline Queries, INFORMATION SYSTEMS, , 40, 67-83 (2014)
  • Overlap of convex polytopes under rigid motion, Computational Geometry, , 47, 15-24 (2014)
  • A Generalization of the Convex Kakeya Problem, ALGORITHMICA, , 70, 152-170 (2014)
  • Computing k-center over streaming data for small k, International Journal of Computational Geometry and Applications, , 24, 107-123 (2014)
  • Covering and piercing disks with two centers, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 46, 253-262 (2013)
  • Realistic roofs over a rectilinear polygon, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 46, 1042-1055 (2013)
  • Maximum overlap of convex polytopes under translation, Computational Geometry, , 46, 552-565 (2013)
  • Reachability by paths of bounded curvature in a convex polygon, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 45, 21-32 (2012)
  • Aligning Two Convex Figures to Minimize Area or Perimeter, ALGORITHMICA, , 62, 464-479 (2012)
  • COMPUTING THE DISCRETE FRECHET DISTANCE WITH IMPRECISE INPUT, INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, , 22, 27-44 (2012)
  • Adaptive Algorithms for Planar Convex Hull Problems, IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, , E94D, 182-189 (2011)
  • COVERING A POINT SET BY TWO DISJOINT RECTANGLES, INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, , 21, 313-330 (2011)
  • Spatial skyline queries: exact and approximation algorithms, GEOINFORMATICA, , 15, 665-697 (2011)
  • Empty Pseudo-Triangles in Point Sets, DISCRETE APPLIED MATHEMATICS, , 159, 2205-2213 (2011)
  • Covering points by disjoint boxes with outliers, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 44, 178-190 (2011)
  • Covering a simple polygon by monotone directions, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 43, 514-523 (2010)
  • DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES, INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, , 20, 69-87 (2010)
  • Computing the Discrete Frechet Distance with Imprecise Input, LECTURE NOTES IN COMPUTER SCIENCE, , 6507, 422-433 (2010)
  • Maximum Overlap of Convex Polytopes under Translation, Lecture Notes in Computer Science, , 6507, 97-108 (2010)
  • CONSTRUCTING OPTIMAL HIGHWAYS, INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, , 20, 3-23 (2009)
  • On the minimum total length of interval systems expressing all intervals, and range-restricted queries, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 42, 207-213 (2009)
  • Casting an Object with a Core, ALGORITHMICA, , 54, 72-88 (2009)
  • COMPUTING MINIMUM-AREA RECTILINEAR CONVEX HULL AND L-SHAPE, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 42, 903-912 (2009)
  • Spatial Skyline Queries: An Efficient Geometric Algorithm, LECTURE NOTES IN COMPUTER SCIENCE, , 5644, 247-264 (2009)
  • Square and Rectangle Covering with Outliers, LECTURE NOTES IN COMPUTER SCIENCE, , 5598, 132-140 (2009)
  • Maximum overlap and minimum convex hull of two convex polyhedra under translations, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 40, 171-177 (2008)
  • Aperture-angle and Hausdorff-approximation of convex figures, DISCRETE & COMPUTATIONAL GEOMETRY, , 40, 414-429 (2008)
  • COVERING A POINT SET BY TWO DISJOINT RECTANGLES, LECTURE NOTES IN COMPUTER SCIENCE (INCLUDING SUBSERIES LECTURE NOTES IN ARTIFICIAL INTELLIGENCE AND LECTURE NOTES IN BIOINFORMATICS), , 5369, 728-739 (2008)
  • MAXIMIZING THE OVERLAP OF TWO PLANAR CONVEX SETS UNDER RIGID MOTIONS, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 37, 3-15 (2007)
  • INSCRIBING AN AXIALLY SYMMETRIC POLYGON AND OTHER APPROXIMATION ALGORITHMS FOR PLANAR CONVEX SETS, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 33, 152-164 (2006)
  • CASTING WITH SKEWED EJECTION DIRECTION, ALGORITHMICA, , 44, 325-342 (2006)
  • CASTING AN OBJECT WITH A CORE, LECTURE NOTES IN COMPUTER SCIENCE, , 3827, 882-891 (2005)
  • STACKING AND BUNDLING TWO CONVEX POLYGONS, LECTURE NOTES ON COMPUTER SCIENCE, , 3827, 40-49 (2005)
  • COMPETITIVE FACILITY LOCATION: THE VORONOI GAME, THEORETICAL COMPUTER SCIENCE, , 310, 457-467 (2004)
  • APPROXIMATION ALGORITHMS FOR INSCRIBING OR CIRCUMSCRIBING AN AXIALLY SYMMETRIC POLYGON TO A CONVEX POLYGON, LECTURE NOTES IN COMPUTER SCIENCE, , 3106, 259-267 (2004)
  • THE REFLEX-FREE HULL, INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, , 14, 453-474 (2004)
  • BUILDING BRIDGES BETWEEN CONVEX REGIONS, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 25, 161-170 (2003)
  • Casting a polyhedron with directional uncertainty, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 26, 129-141 (2003)
  • SEPARATING AN OBJECT FROM ITS CAST, COMPUTER-AIDED DESIGN, , 34, 547-559 (2002)
  • CASTING A POLYHEDRON WITH DIRECTIONAL UNCERTAINTY, LECTURE NOTES ON COMPUER SCIENCE, , 2518, 274-285 (2002)
  • COMPETITIVE FACILITY LOCATION ALONG A HIGHWAY, LECTURE NOTES IN COMPUTER SCIENCE, , 2108, 237-246 (2001)
  • CASTING WITH SKEWED EJECTION DIRECTION, LECTURE NOTES ON COMPUTER SCIENCE, , 1533, 139-148 (1998)

Domestic Journal Papers

  • 제한된 곡률을 갖는 최단경로에 대한 기하학적 증명, 정보과학회논문지 : 시스템 및 이론, , 34, 132-137 (2007)
  • A geometric proof on shortest paths of bounded curvature, JOURNAL OF KISS, , 34, 132-137 (2007)
  • MINIMUM DIAMETER SPANNING TREE WITH BOUNDED DEGREE, KISS JOURNAL, , 31, 78-85 (2004)
  • EVALUATION OF CAR PROTOTYPE USING CAVE-LIKE SYSTEMS, KSES JOURNAL, , 5, - (2002)

General Journal Papers

  • COVERING A POINT SET BY TWO DISJOINT RECTANGLES, LECTURE NOTES IN COMPUTER SCIENCE (INCLUDING SUBSERIES LECTURE NOTES IN ARTIFICIAL INTELLIGENCE AND LECTURE NOTES IN BIOINFORMATICS), , 5369, 728-739 (2008)
  • COVERING A SIMPLE POLYGON BY MONOTONE DIRECTIONS, LECTURE NOTES ON COMPUTER SCIENCE, , LNCS, 668-679 (2008)
  • Dilation-optimal edge deletion in polygonal cycles, Lecture Notes in Computer Science, , 4835, 88-99 (2007)
  • Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations, LECTURE NOTES IN COMPUTER SCIENCE, , 4835, 788-799 (2007)
  • FLIPPING YOUR LID, GEOMBINATORICS, , 10, 57-63 (2000)

Conference Proceedings

  • A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree., PROCEEDINGS OF ISAAC 2016 (LIPICS), 0, 0, - (2016)
  • Assigning Weights to Minimize the Covering Radius in the Plane, PROCEEDINGS OF ISAAC 2016 (LIPICS), 0, 0, - (2016)
  • Constrained Geodesic Center of a Simple Polygon, PROCEEDINGS OF SWAT 2016 (LIPICS), 0, 0, - (2016)
  • The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon., PROCEEDINGS OF SOCG 2016 (LIPICS), 0, 0, - (2016)
  • A Middle Curve Based on Discrete Fréchet Distance., PROCEEDINGS OF LATIN 2016 (LNCS), 0, 0, - (2016)
  • Computing a Geodesic Two-Center of Points in a Simple Polygon., PROCEEDINGS OF LATIN 2016 (LNCS), 0, 0, - (2016)
  • The 2-center problem in a simple polygon, LNCS, 0, 0, - (2015)
  • Geometric Matching Algorithms for Two Realistic Terrains, LNCS, 0, 0, - (2015)
  • A linear-time algorithm for the geodesic center of a simple polygon, LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS (LIPICS), 0, 0, 209-223 (2015)
  • Minimum Convex Container of Two Convex Polytopes under Translations, PROCEEDINGS OF 26TH CANADIAN CONFERENCE ON COMPUTATIONAL GEOMETRY, 0, 0, - (2014)
  • An Improved Data Stream Algorithm for Clustering, LNCS 8392, 0, 0, - (2014)
  • Top-k Manhattan Spatial Skyline Queries, LNCS 8344, 0, 0, - (2014)
  • Bundling Three Convex Polygons to Minimize Area or Perimeter, PROC. 13TH ALGORITHMS AND DATA STRUCTURES SYMPOSIUM (WADS 2013), 0, 0, - (2013)
  • Group Nearest Neighbor Queries in the L1 Plane, PROC. 10TH ANNUAL CONFERENCE ON THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2013), 0, 0, - (2013)
  • Rectilinear Covering for Imprecise Input Points, PROC. 23RD INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION, 0, 0, - (2012)
  • Computing k-center over streaming data for small k, PROC. 23RD INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION, 0, 0, - (2012)
  • Overlap of Convex Polytopes under Rigid Motion, PROC. 32ND ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 0, 0, - (2012)
  • A fast nearest neighbor search algorithm by nonlinear embedding, PROC. 25TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, 0, 0, - (2012)
  • A Generalization of the Convex Kakeya Problem, PROC. 10TH LATIN AMERICAN THEORETICAL INFORMATION SYMPOSIUM, 0, 0, - (2012)
  • Convergent Bounds on the Euclidean Distance, IN PROC. 25TH ANNUAL CONFERENCE ON NEURAL INFORMATION PROCESSING SYSTEMS, 0, 0, - (2011)
  • Covering and Piercing Disks with Two Centers, IN PROC. 22ND INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION, 0, 0, 50-59 (2011)
  • Generating Realistic Roofs over a Rectilinear Polygon, IN PROC. 22ND INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION, 0, 0, 60-69 (2011)
  • MSSQ: Manhattan Spatial Skyline Queries, PROC. 12TH SYMPOSIUM ON SPATIAL AND TEMPORAL DATABASES, 0, 0, 313-329 (2011)
  • Maximum Overlap of Convex Polytopes under Translation, ALGORITHMS AND COMPUTATION - ISAAC 2010, 0, 0, 97-108 (2010)
  • Computing the Discrete Frechet Distance with Imprecise Input, ALGORITHMS AND COMPUTATION - ISAAC 2010, 0, 0, 422-433 (2010)
  • Adaptive Algorithms for Planar Convex Hull Problems, FRONTIERS IN ALGORITHMICS - FAW 2010, 0, 0, 316-326 (2010)
  • Skyline Queries in Metric Space, PROC. 3RD AAAC ANNUAL MEETING, 0, 0, 52-52 (2010)
  • Tracing a virus, PROC. 3RD AAAC ANNUAL MEETING, 0, 0, 9-9 (2010)
  • City Metric에서 스카이라인을 계산하는 기하 알고리즘, 학술발표논문집 한국정보과학회 2009 가을 학술발표 논문집 제 36권 제 2호(A), 0, 0, 262-266 (2009)
  • Optimal Empty Pseudo-Triangles in a Point Set, PROC. 21ST CANADIAN CONFERENCE ON COMPUTATIONAL GEOMETRY, 0, 0, - (2009)
  • Spatial Skyline Queries: An Efficient Geometric Algorithm, PROC. 11TH INTERNATIONAL SYMPOSIUM ON SPATIAL AND TEMPORAL DATABASES, 0, 0, - (2009)
  • Square and Rectangle Covering with Outliers, PROC. 3RD INTERNATIONAL FRONTIERS OF ALGORITHMS WORKSHOP, 0, 0, - (2009)
  • 점을 포함하지 않는 최적 유사삼각형, 학술발표논문집 한국정보과학회 2009한국컴퓨터종합학술대회 논문집 제 36권 제1호(A), 0, 0, 367-370 (2009)
  • 최대 개수의 점을 포함하는 두 개의 겹치지 않는 단위 정사각형, 학술발표논문집 한국정보과학회 2009한국컴퓨터종합학술대회 논문집 제 36권 제1호(A), 0, 0, 362-366 (2009)
  • Covering a Point Set by Two Disjoint Rectangles, 19th Annual International Symposium on Algorithms and Computation, 0, 0, 729-740 (2008)
  • Covering a Simple Polygon by Monotone Directions, 19th Annual International Symposium on Algorithms and Computation, 0, 0, 668-679 (2008)
  • Adaptive Computational Geometry, Proc. Workshop on Computational Geometry and Discrete Mathematics, 0, 0, 51-54 (2008)
  • Maximum Overlap of Convex Polytopes under Translation, Proc. 11th Japan-Korea Joint Workshop on Algorithms and Computation, 0, 0, 181-188 (2008)
  • Spatial Skyline을 계산하는 기하 알고리즘, 2008 한국컴퓨터종합학술대회 논문집, 0, 0, 588-591 (2008)
  • Optimal Disjoint Two-box Covering of Points, 1st AAAC Annual Meeting, 0, 0, - (2008)
  • Translation Algorithms for Overlaying Convex Polyhedra, 1st AAAC Annual Meeting, 0, 0, - (2008)
  • Dilation-optimal edge deletion in polygonal cycles, Algorithms and Computation, 0, 0, 88-99 (2007)
  • Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations, Algorithms and Computation, 0, 0, 88-99 (2007)
  • Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations, Proc. 10th Korea-Japan Joint Workshop on Algorithms and Computation, 0, 0, 64-71 (2007)
  • Aperture-Angle and Hausdorff-Approximation of Convex Figures, Annual ACM Symposium on Computational Geometry, 0, 0, 37-45 (2007)
  • Aperture-Angle and Hausdorff-Approximation of Convex Figures, Annual ACM Symposium on Computational Geometry, 0, 0, 37-45 (2007)
  • 제한된 곡률을 갖는 최단경로에 대한 기하학적 증명, 정보과학회논문지 : 시스템 및 이론 제 34권 제 3,4호, 0, 0, 132-137 (2007)
  • Constructing Optimal Highways, Proc. Computing: The Australasian Theory Symposium, 0, 0, 7-14 (2007)
  • Constructing Optimal Highways, Proc. Computing: The Australasian Theory Symposium, 0, 0, 7-14 (2007)
  • River Networks and Watershed Maps of Triangulated Terrains Revisited, Proc. 22nd European Workshop on Computational Geometry, 0, 0, 173-176 (2006)
  • River Networks and Watershed Maps of Triangulated Terrains Revisited, Proc. 22nd European Workshop on Computational Geometry, 0, 0, 173-176 (2006)
  • Casting an Object with a Core., Proc. 16th Annual International Symposium on Algorithms and Computation, 0, 0, 882-891 (2005)
  • Stacking and Bundling two Convex Polygons., Proc. 16th Annual International Symposium on Algorithms and Computation, 0, 0, 40~49- (2005)
  • A New Geometric Proof on Shortest Paths of Bounded Curvature, 한국정보과학회 2008 종합학술대회 논문집 제35권 제1호(B), 0, 0, 958-960 (2005)
  • 직교다각형에 대한 지붕의 기하학적 성질, 학술발표논문집 한국정보과학회 2005한국컴퓨터 종합학술대회 논문집 (A), 0, 0, 895-897 (2005)
  • 두 평면 볼록집합의 겹치는 영역을 최대화하는 강체운동을 구하는 근사 알고리즘, 한국정보과학회 2005 한국컴퓨터종합학술대회 논문집, 0, 0, 901-903 (2005)
  • Maximizing the Overlap of Two Planar Convex Sets under Rigid Motions, Proc. 21st Annu. ACM Symposium on Computational Geometry, 0, 0, 356-363 (2005)
  • 코어를 포함한 주조에 대한 기하학적 접근, 학술발표논문집 한국정보과학회 2004년도 가을 학술발표논문집 제31권 제2호 (I), 0, 0, 706-708 (2004)
  • 내부에 점이 없는 크고 넓은 직사각형을 찾는 근사 알고리즘, 한국정보과학회 학술발표논문집 한국정보과학회 2004년도 가을학술발표논문집, 0, 0, 718-720 (2004)
  • Approximation algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon., Proc. 10th Annual International Computing and Combinatorics Conference, 0, 0, 259-267 (2004)
  • 제한된 분지수를 갖는 최소지름 신장 트리, 정보과학회논문지 : 시스템 및 이론 제 31권 제 1,2호, 0, 0, 78-85 (2004)
  • Description and Response Generation of Cyberspace, Proc. 7th Joint Conference of the Ergonomics Society of Korea and the Japan Ergonomics Society, 0, 0, - (2003)
  • VR Experience Design in Tangible Space : Heritage Alive !, Proc. XVth Triennial Congress International Ergonomics Association, 0, 0, - (2003)
  • 제한된 분지수를 갖는 최소 지름 신장 트리, 학술발표논문집 한국정보과학회 2003년도 봄 학술 발표논문집 제 30권 제1호(A), 0, 0, 806-808 (2003)
  • Casting a Polyhedron with Directional Uncertainty., Proc. 13th Annual International Symposium on Algorithms and Computation, 0, 0, 274-285 (2002)
  • NAVER : design and implementation of XML-based VR Framework on a PC cluster., Proc. Virtual Systems and MultiMedia, 0, 0, 967-975 (2002)
  • NAVER Musical Composition Environment., Proc. Virtual Systems and MultiMedia, 0, 0, 809-814 (2002)
  • NAVER: Design and Implementation of Networked Virtual Environments Based on PC Cluster., Proc. 6th Joint Conference of the Ergonomics Society of Korea and the Japan Ergonomics Society, 0, 0, 221-228 (2002)
  • Compatitive Facility Location along a Highway, Proc. 7th Annual International Computing and Combinatorics Conference, 0, 0, 237-246 (2001)
  • The Reflex-Free Hull, Proc. 13th Canadian Conference on Computational Geometry, 0, 0, 9-12 (2001)
  • Bridging Convex Regions and Related Problems, Proc. 17th European Workshop on Computational Geometry, 0, 0, 53-56 (2001)
  • Flipping your Lid., Proc. 12th Canadian Conference on Computational Geometry, 0, 0, 13-16 (2000)
  • Reachability by Paths of Bounded Curvature in Convex Polygons., Proc. 16th Annu. ACM Symposium on Computational Geometry, 0, 0, 251-259 (2000)
  • Casting with Skewed Ejection Direction Revisited, Proc. 11th Canadian Conference on Computational Geometry, 0, 0, 128-131 (1999)
  • Casting with Skewed Ejection Direction., Proc. 9th Ann. International Symposium on Algorithms and Computation, 0, 0, 139-148 (1998)
  • Separating an Object from its Cast., Proc. 13th Annu. ACM Symposium on Computational Geometry, 0, 0, 221-230 (1997)
  • 일반적 환경에서 다면체의 castability, 한국정보과학회 1997년도 봄학술 발표논문집, 0, 0, 703-706 (1997)
  • Separating an Object from its Cast., Proc. 13th Annu. ACM Symposium on Computational Geometry, 0, 0, 221-230 (0000)
  • Casting with Skewed Ejection Direction., Proc. 9th Ann. International Symposium on Algorithms and Computation, 0, 0, 139-148 (0000)
  • Casting with Skewed Ejection Direction Revisited, Proc. 11th Canadian Conference on Computational Geometry, 0, 0, 128-131 (0000)
  • Reachability by Paths of Bounded Curvature in Convex Polygons., Proc. 16th Annu. ACM Symposium on Computational Geometry, 0, 0, 251-259 (0000)
  • Flipping your Lid., Proc. 12th Canadian Conference on Computational Geometry, 0, 0, 13-16 (0000)
  • Bridging Convex Regions and Related Problems, Proc. 17th European Workshop on Computational Geometry, 0, 0, 53-56 (0000)
  • The Reflex-Free Hull, Proc. 13th Canadian Conference on Computational Geometry, 0, 0, 9-12 (0000)
  • Compatitive Facility Location along a Highway, Proc. 7th Annual International Computing and Combinatorics Conference, 0, 0, 237-246 (0000)
  • NAVER: Design and Implementation of Networked Virtual Environments Based on PC Cluster., Proc. 6th Joint Conference of the Ergonomics Society of Korea and the Japan Ergonomics Society, 0, 0, 221-228 (0000)
  • NAVER : design and implementation of XML-based VR Framework on a PC cluster., Proc. Virtual Systems and MultiMedia, 0, 0, 967-975 (0000)
  • NAVER Musical Composition Environment., Proc. Virtual Systems and MultiMedia, 0, 0, 809-814 (0000)
  • Casting a Polyhedron with Directional Uncertainty., Proc. 13th Annual International Symposium on Algorithms and Computation, 0, 0, 274-285 (0000)
  • Description and Response Generation of Cyberspace, Proc. 7th Joint Conference of the Ergonomics Society of Korea and the Japan Ergonomics Society, 0, 0, - (0000)
  • VR Experience Design in Tangible Space : Heritage Alive !, Proc. XVth Triennial Congress International Ergonomics Association, 0, 0, - (0000)
  • Approximation algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon., Proc. 10th Annual International Computing and Combinatorics Conference, 0, 0, 259-267 (0000)
  • Maximizing the Overlap of Two Planar Convex Sets under Rigid Motions, Proc. 21st Annu. ACM Symposium on Computational Geometry, 0, 0, 356-363 (0000)
  • Casting an Object with a Core., Proc. 16th Annual International Symposium on Algorithms and Computation, 0, 0, 882-891 (0000)
  • Stacking and Bundling two Convex Polygons., Proc. 16th Annual International Symposium on Algorithms and Computation, 0, 0, 40~49- (0000)
  • Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations, Proc. 10th Korea-Japan Joint Workshop on Algorithms and Computation, 0, 0, 64-71 (0000)
  • Dilation-optimal edge deletion in polygonal cycles, Algorithms and Computation, 0, 0, 88-99 (0000)
  • Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations, Algorithms and Computation, 0, 0, 88-99 (0000)
  • Optimal Disjoint Two-box Covering of Points, 1st AAAC Annual Meeting, 0, 0, - (0000)
  • Translation Algorithms for Overlaying Convex Polyhedra, 1st AAAC Annual Meeting, 0, 0, - (0000)
  • Spatial Skyline을 계산하는 기하 알고리즘, 2008 한국컴퓨터종합학술대회 논문집, 0, 0, 588-591 (0000)
  • Maximum Overlap of Convex Polytopes under Translation, Proc. 11th Japan-Korea Joint Workshop on Algorithms and Computation, 0, 0, 181-188 (0000)
  • Adaptive Computational Geometry, Proc. Workshop on Computational Geometry and Discrete Mathematics, 0, 0, 51-54 (0000)
  • Covering a Point Set by Two Disjoint Rectangles, 19th Annual International Symposium on Algorithms and Computation, 0, 0, 729-740 (0000)
  • Covering a Simple Polygon by Monotone Directions, 19th Annual International Symposium on Algorithms and Computation, 0, 0, 668-679 (0000)

Invited Talk or Presentations

  • A Middle Curve Based on Discrete Fréchet Distance, ., 0, 0, - (2015)
  • Covering and Piercing Disks with Two Centers, ., 0, 0, - (2011)
  • Covering and Piercing Disks with Two Centers, ., 0, 0, - (2011)
  • Computing the discrete Fréchet distance with imprecise input, ., 0, 0, - (2010)
  • Computing the Discrete Fréchet Distance with Imprecise Input, ., 0, 0, - (2009)
  • An Adaptive Algorithm for the Planar Convex Hull, ., 0, 0, - (2009)
  • Square and Rectangle Covering with Outliers, ., 0, 0, - (2009)

Books

  • Algorithms and Computation, Springer, 781, 안희갑(공동),신찬수(공동) (2014)
  • Algorithms and Computation, Springer, 781, 안희갑(공동),신찬수(공동) (2014)
  • Geometric Aspects of the Casting Process, Utrecht University, , 안희갑(책임) (2001)

Research Activities

  • GEOMETRIC SHAPE MATCHING IN 3D: DESIGN OF EFFICIENT MATCHING ALGORITHMS UNDER RIGID MOTIONS, 한국학술진흥재단 (2007-2008)
  • 인건비풀링과제, 포항공과대학교 (2007-2015)
  • 자체연구개발과제, 포항공과대학교 (2007-2016)
  • GEOMETRIC SHAPE MATCHING BETWEEN 3D POLYHEDRAL SURFACES, 포항공과대학교 (2007-2008)
  • 기하물체의 매칭에 관한연구:강제이동을 고려한 효율적 알고리즘 설계, 포항공과대학교 (2007-2008)
  • GEOMETRIC SHAPE APPROXIMATION, 한국학술진흥재단 (2008-2008)
  • GEOMETRIC SHARPE MATCHING BETWEEN 3D POLYHEDRAL SURFACES, 포항공과대학교 (2008-2009)
  • 기하 형체의 근사와매칭에 관한 연구, 포항공과대학교 (2008-2009)
  • MAXIMUM OVERLAB OF TWO CONVEX POLYHEDRA UNDER RIGID MOTION, 포항공과대학교 (2008-2008)
  • 3차원 기하물체의 매칭에 관한연구: 강체이동을 고려한 효율적인 매칭 알고리즘 설계, 한국학술진흥재단 (2008-2009)
  • 4.1932_1차년도의 이월과제, 한국학술진흥재단 (2008-2009)
  • GEOMETRIC SHAPE APPROXIMATION, 한국학술진흥재단 (2009-2009)
  • ADAPTIVE ALGORITHMS FOR FUNDAMENTAL GEOMETRIC PROBLEMS, 한국과학재단 (2009-2010)
  • 기하 그래프의 조합 및 계산에 관한 연구, 포항공과대학교 (2009-2010)
  • 학생인건비풀링적립과제, 포항공대산학협력단 (2009-2020)
  • GEOMETRIC SHAPE APPROXIMATION, 재단법인한국연구재단 (2010-2010)
  • 네비게이션 시스템 성능 개선 알고리즘 개발, 현대모비스(주) (2009-2010)
  • ADAPTIVE ALGORITHMS FOR FUNDAMENTAL GEOMETRIC PROBLEMS, 재단법인한국연구재단 (2010-2011)
  • ALGORITHMIC ASPECTS OF GEOMETRIC UNCERTAINTY, 재단법인한국연구재단 (2010-2011)
  • FINDING OBJECTS IN GEOMETRIC DATA: THEORETICAL ALGORITHMS FOR GEOMETRIC MATCHING, SEGMENTATION AND COVERING., 재단법인한국연구재단 (2010-2011)
  • ADAPTIVE ALGORITHMS FOR FUNDAMENTAL GEOMETRIC PROBLEMS, 재단법인한국연구재단 (2011-2012)
  • ALGORITHMIC ASPECTS OF GEOMETRIC UNCERTAINTY, 재단법인한국연구재단 (2011-2012)
  • FINDING OBJECTS IN GEOMETRIC DATA: THEORETICAL ALGORITHMS FOR GEOMETRIC MATCHING, SEGMENTATION AND COVERING, 재단법인한국연구재단 (2011-2012)
  • 4.5777 이월과제(한-일 국제협력사업), 재단법인한국연구재단 (2011-2012)
  • 4.5448_1차년도 이월과과제, 재단법인한국연구재단 (2011-2012)
  • 4.5442_1차년도 이월과제, 재단법인한국연구재단 (2011-2012)
  • ALGORITHMIC ASPECTS OF GEOMETRIC UNCERTAINTY, 재단법인한국연구재단 (2012-2013)
  • GENERAL OPTIMIZATION : POLYGON CONTAINMENT, PACKING, ALIGNMENT, 재단법인한국연구재단 (2013-2014)
  • GENERAL OPTIMIZATION : POLYGON CONTAINMENT, PACKING, ALIGNMENT, 재단법인한국연구재단 (2014-2015)
  • 차세대 인공지능 군관리 소프트웨어 개발, 현대엘리베이터(주) (2014-2015)
  • 4.0009985 이월과제, 재단법인한국연구재단 (2014-2015)
  • 자체연구개발과제[2015년 신설], 포항공과대학교 (2015-2038)
  • ., ETRI부설국가보안기술연구소 (2016-2016)

IP