POSTECH

교원프로필

교원에 대한 정보를 나타내는 표입니다.
성명	안희갑
소속	인공지능대학원
전화번호	054-279-2387
E-mail	heekap@postech.ac.kr
Homepage	http://algo.postech.ac.kr/~heekap

학력

2000.09 ~ 2001.12 UNIVERSITEIT UTRECHT (박사-전산학과)
1997.09 ~ 2001.02 香港科技大學(The Hong Kong University of Science and Technology) (박사-전산학과)
1996.03 ~ 1998.02 포항공과대학교 (석사-전자계산학과)
1992.03 ~ 1996.02 경북대학교 (학사-컴퓨터공학과)

주요경력

2006.03 ~ 2007.07 : 세종대학교 전자정보공학대학 컴퓨터공학전공
2004.02 ~ 2006.02 : 한국과학기술원 정보전자연구소
2001.10 ~ 2004.01 : 한국과학기술연구원 시스템연구부장실

전문분야

Theoretical Computer Science
Algorithms
Computational & Discrete Geometry

펼쳐보기

학술지

국제전문학술지

Minimum-link shortest paths for polygons amidst rectilinear obstacles, Computational Geometry: Theory and Applications, , 103, - (2022)
Maximum-area and maximum-perimeter rectangles in polygons, Computational Geometry: Theory and Applications, , 94, - (2021)
Efficient planar two-center algorithms, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 97, - (2021)
Largest triangles in a polygon, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 98, - (2021)
Intersecting Disks Using Two Congruent Disks, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), , 12757, 400-413 (2021)
Covering Convex Polygons by Two Congruent Disks, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), , 12757, 165-178 (2021)
Shortest rectilinear path queries to rectangles in a rectangular domain, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 99, - (2021)
Maximizing Dominance in the Plane and its Applications, Algorithmica, , 83, 3491-3513 (2021)
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon, DISCRETE & COMPUTATIONAL GEOMETRY, , 63, 418-454 (2020)
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon, ALGORITHMICA, , 82, 1434-1473 (2020)
Middle curves based on discrete Frechet distance, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 89, - (2020)
The minimum convex container of two convex polytopes under translations, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 77, 40-50 (2019)
Minimum-width annulus with outliers: Circular, square, and rectangular cases, INFORMATION PROCESSING LETTERS, , 145, 16-23 (2019)
Assigning weights to minimize the covering radius in the plane, Computational Geometry: Theory and Applications, , 81, 22-32 (2019)
Faster algorithms for growing prioritized disks and rectangles, Computational Geometry: Theory and Applications, , 80, 23-39 (2019)
Computing a geodesic two-center of points in a simple polygon, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 82, 45-59 (2019)
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms, ALGORITHMICA, , 81, 2829-2856 (2019)
Finding pairwise intersections of rectangles in a query rectangle, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 85, - (2019)
On Romeo and Juliet problems: Minimizing distance-to-sight, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 84, 12-21 (2019)
Geometric matching algorithms for two realistic terrains, THEORETICAL COMPUTER SCIENCE, , 715, 60-70 (2018)
The geodesic 2-center problem in a simple polygon, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 74, 21-37 (2018)
Top-k Manhattan spatial skyline queries, Information Processing Letters, , 123, 27-35 (2017)
Realistic roofs without local minimum edges over a rectilinear polygon, Theoretical Computer Science, , 675, 15-26 (2017)
Computing the center region and its variants, Lecture Notes in Computer Science, , 10167, 254-265 (2017)
Bundling two simple polygons to minimize their convex hull, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), , 10167, 66-77 (2017)
A time-space trade-off for triangulations of points in the plane, Lecture Notes in Computer Science, , 10392, 3-12 (2017)
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)
Guest Editor's Foreword, Algorithmica, , 76, 1158-1159 (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)
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)
MAXIMIZING THE OVERLAP OF TWO PLANAR CONVEX SETS UNDER RIGID MOTIONS, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, , 37, 3-15 (2007)
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)
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)

국내전문학술지

볼록다각형의 최대 겹침, 정보과학회 컴퓨팅의 실제 논문지, , 27, 400-405 (2021)
제한된 곡률을 갖는 최단경로에 대한 기하학적 증명, 정보과학회논문지 : 시스템 및 이론, , 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)

일반학술지

FLIPPING YOUR LID, GEOMBINATORICS, , 10, 57-63 (2000)

학술회의논문

Largest Similar Copies of Convex Polygons in Polygonal Domains, Leibniz International Proceedings in Informatics, LIPIcs, 0, 0, - (2021)
Covering Convex Polygons by Two Congruent Disks, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 0, 0, 165-178 (2021)
Intersecting Disks Using Two Congruent Disks, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 0, 0, 400-413 (2021)
Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain, LNCS 12118, 0, 0, 271-282 (2021)
Maximum-Area Rectangles in a Simple Polygon, LIPIcs 150, 0, 0, 12:1-12:14 (2019)
Maximizing Dominance in the Plane and its Applications, Lecture Notes in Computer Science 11646, 0, 0, 325-338 (2019)
Statistical Similarity of Critical Infrastructure Network Traffic based on Nearest Neighbor Distances, Lecture Notes in Computer Science series (LNCS, volume 11050), 0, 0, - (2018)
Polygon Queries for Convex Hulls of Points, Lecture Notes in Computer Science (LNCS 10976), 0, 0, - (2018)
On Romeo and Juliet Problems: Minimizing Distance-to-Sight, Leibniz International Proceedings in Informatics for SWAT 2018, 0, 0, - (2018)
Approximate Range Queries for Clustering, Leibniz International Proceedings in Informatics for SoCG 2018, 0, 0, - (2018)
Point Location in Dynamic Planar Subdivisions, Leibniz International Proceedings in Informatics for SoCG 2018, 0, 0, - (2018)
Minimum-Width Square Annulus Intersecting Polygons, Lecture Notes in Computer Science (LNCS 10755), 0, 0, - (2018)
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases, Lecture Notes in Computer Science (LNCS 10755), 0, 0, 44-55 (2018)
Product Quantized Translation for Fast Nearest Neighbor Search, Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18), 0, 0, - (2018)
Faster Algorithms for Growing Prioritized Disks and Rectangles, Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), 0, 0, - (2017)
Finding Pairwise Intersections of Rectangles in a Query Rectangle, Proceedings of 28th International Symposium on Algorithms and Computation (ISAAC 2017), 0, 0, - (2017)
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms, Proceedings of 28th International Symposium on Algorithms and Computation (ISAAC 2017), 0, 0, - (2017)
A Time-Space Tradeoff for Triangulations of Points in the Plane, Lecture Notes in Computer Science 10392, 0, 0, - (2017)
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon, Proceedings of 33rd International Symposium on Computational Geometry (SoCG 2017), 0, 0, 521-5215 (2017)
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons, Proceedings of 33rd International Symposium on Computational Geometry (SoCG 2017), 0, 0, - (2017)
Computing the Center Region and Its Variants, Proceedings of 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), 0, 0, - (2017)
Bundling Two Simple Polygons to Minimize Their Convex Hull, Proceedings of 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), 0, 0, - (2017)
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)

학회발표

Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles, , 0, 0, - (2021)
Rearranging a Sequence of Points onto a Line, , 0, 0, - (2021)
Intersecting Disks using Two Congruent Disks, , 0, 0, 66:1-66:7 (2021)
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)
Maximum Overlap of Convex Polytopes under Translation, ALGORITHMS AND COMPUTATION - ISAAC 2010, 0, 0, 97-108 (2010)
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)

단행본

Algorithms and Computation, Springer, 781, (2014)
Algorithms and Computation, Springer, 781, (2014)
Geometric Aspects of the Casting Process, Utrecht University, , 안희갑 (2001)

연구실적

3차원 기하물체의 매칭에 관한 연구:강체이동을 고려한 효율적인 매칭 알고리즘 설계, 한국학술진흥재단 (2007-2008)
인건비풀링과제, 포항공과대학교 (2007-2015)
연구개발과제, 포항공과대학교 (2007-2016)
3차원 다각면의 형체 매칭에 관한 연구, 포항공과대학교 (2007-2008)
기하물체의 매칭에 관한연구:강제이동을 고려한 효율적 알고리즘 설계, 포항공과대학교 (2007-2008)
기하 형체 근사화에 관한연구, 한국학술진흥재단 (2008-2008)
3차원 다각면의 형체 매칭에 관한연구, 포항공과대학교 (2008-2009)
기하 형체의 근사와매칭에 관한 연구, 포항공과대학교 (2008-2009)
MAXIMUM OVERLAB OF TWO CONVEX POLYHEDRA UNDER RIGID MOTION, 포항공과대학교 (2008-2008)
3차원 기하물체의 매칭에 관한연구: 강체이동을 고려한 효율적인 매칭 알고리즘 설계, 한국학술진흥재단 (2008-2009)
4.1932_1차년도의 이월과제, 한국학술진흥재단 (2008-2009)
기하 형체 근사화에 관한 연구, 한국학술진흥재단 (2009-2009)
기하 문제들에 대한 효율적인 ADAPTIVE 알고리즘 연구, 한국과학재단 (2009-2010)
기하 그래프의 조합 및 계산에 관한 연구, 포항공과대학교 (2009-2010)
학생인건비풀링적립과제, 포항공대산학협력단 (2009-2022)
기하 형체 근사화에 관한 연구, 재단법인한국연구재단 (2010-2010)
네비게이션 시스템 성능 개선 알고리즘 개발, 현대모비스(주) (2009-2010)
기하 문제들에 대한 효율적인 ADAPTIVE 알고리즘 연구, 재단법인한국연구재단 (2010-2011)
기하 불확실성에 관한 알고리즘 연구, 재단법인한국연구재단 (2010-2011)
기하 매칭, 세분화 및 덮음 등의 기하문제 대한 이론 알고리즘에 관한 연구, 재단법인한국연구재단 (2010-2011)
기하 문제들에 대한 효율적인 ADAPTIVE 알고리즘 연구, 재단법인한국연구재단 (2011-2012)
기하 불확실성에 관한 알고리즘 연구, 재단법인한국연구재단 (2011-2012)
기하 매칭, 세분화 및 덮음 등의 기하문제 대한 이론 알고리즘에 관한 연구, 재단법인한국연구재단 (2011-2012)
4.5777 이월과제(한-일 국제협력사업), 재단법인한국연구재단 (2011-2012)
4.5448_1차년도 이월과과제, 재단법인한국연구재단 (2011-2012)
4.5442_1차년도 이월과제, 재단법인한국연구재단 (2011-2012)
기하 불확실성에 관한 알고리즘 연구, 재단법인한국연구재단 (2012-2013)
기하 최적화의 일반화에 관한 연구 : 최적의 다각형 덮음을 위한 배치 연구, 재단법인한국연구재단 (2013-2014)
기하 최적화의 일반화에 관한 연구 : 최적의 다각형 덮음을 위한 배치 연구, 재단법인한국연구재단 (2014-2015)
기계학습연구센터 부서연구관리비, 포항공대산학협력단 (2014-2020)
차세대 인공지능 군관리 소프트웨어 개발, 현대엘리베이터(주) (2014-2015)
4.0009985 이월과제, 재단법인한국연구재단 (2014-2015)
연구개발과제[2015년 신설], 포항공과대학교 (2015-2038)
머신러닝 기법을 활용한 제어트래픽 분석기법 연구, ETRI부설국가보안기술연구소 (2016-2016)
SW스타랩 (동적기하환경에서의 최적의 자료구조 및 응용 알고리즘), 정보통신기술진흥센터 (2017-2017)
머신러닝을 활용한 제어시스템 네트워크 트랜잭션 분석 방안 연구, ETRI부설국가보안기술연구소 (2017-2017)
SW스타랩 (동적기하환경에서의 최적의 자료구조 및 응용 알고리즘), 정보통신기술진흥센터 (2018-2018)
SW스타랩 (동적기하환경에서의 최적의 자료구조 및 응용 알고리즘), 정보통신기획평가원 (2019-2019)
PCB 설계 자동화(CPU-MEMORY 간 배선), 삼성전자(주) (2019-2019)
SW스타랩 (동적기하환경에서의 최적의 자료구조 및 응용 알고리즘), 정보통신기획평가원 (2020-2020)
[BSRI-ISP]데이터과학의 과학적 방법론과 알고리즘 및 공학적 시스템을 통합하는 학제간 연구, 포항공과대학교 (2020-2021)
PCB설계자동화(CHIP, BOARD 최적PATH), 삼성전자(주) (2020-2020)
SW스타랩 (동적기하환경에서의 최적의 자료구조 및 응용 알고리즘), 정보통신기획평가원 (2021-2021)
애플 디벨로퍼 아카데미 및 제조업 RND 지원센터, 애플코리아유한회사 (2021-2023)
애플 디벨로퍼 아카데미 및 제조업 RND 지원센터 부서운영비, 포항공과대학교 (2021-2024)
SW스타랩 (동적기하환경에서의 최적의 자료구조 및 응용 알고리즘), 정보통신기획평가원 (2022-2022)
AI 기반 PCB 배선 설계 자동화(CPU-MEMORY), 삼성전자(주) (2022-2022)
4.0021154_이월과제, 정보통신기획평가원 (2022-2022)
[UGRP]AI 알고리즘을 활용한 MATCHING PLATFORM 연구, 포항공과대학교 (2022-2023)
RANGE CLOSEST PAIR 문제를 위한 최적 데이터구조, 재단법인한국연구재단 (2022-2023)
AI 자문, (주)포스코알텍 (2022-2023)
SW스타랩 (동적기하환경에서의 최적의 자료구조 및 응용 알고리즘), 정보통신기획평가원 (2023-2023)
AI 기반 PCB 배선 설계 자동화(DIRECT), 삼성전자(주) (2023-2023)
(UGRP)추천 알고리즘 기반 배달 공유 플랫폼 개발, 포항공과대학교 (2023-2024)
포항공대 AI산학협력 슬라브 야드 최적화 기술 컨설팅 용역, (주)포스코디엑스 (2023-2024)
3제강 블룸절단 스케줄링 최적화 알고리즘 모델링, 주식회사 세아창원특수강 (2023-2023)

IP

안희갑,엄태강,최종민,이재건, 볼록 위치 수요지에 대한 효율적인 최적 시설 위치 결정 방법, 한국, 10-2023-0107614 (2023)
안희갑,엄태강,김민철,김휘, 직교 다각 장애물 환경에서 건물 사이의 최소 링크를 가진 최단 경로 탐색 방법, USA, 18/318,663 (2023)
안희갑,엄태강,김민철,김휘, 직교 다각 장애물 환경에서 건물 사이의 최소 링크를 가진 최단 경로 탐색 방법, 한국, 10-2023-0044712 (2022)
안희갑,김휘,엄태강,김민철, 직교 다각 장애물 환경에서 건물 사이의 최소 링크를 가진 최단 경로 탐색 방법, -, 63/356,005 (2022)
안희갑,정재훈,엄태강,김휘,이승준, 장애물 환경에서 동적 k-근접 이웃 탐색 알고리즘을 활용한 GIS의 지리정보 탐색 방법, USA, 18/084,536 (2022)
안희갑,이승준,안태훈,박지우, 궤적 평가 방법 및 장치, 한국, 10-2022-0145868 (2022)
안희갑,엄태강,김휘,김민철, 직교 다각 장애물 환경에서 건물 사이의 최소 링크를 가진 최단 경로 탐색 방법, 한국, 10-2022-0071234 (2022)
안희갑,정재훈,엄태강,김휘,이승준, 장애물 환경에서 동적 k-근접 이웃 탐색 알고리즘을 활용한 GIS의 지리정보 탐색 방법, 한국, 10-2022-0056332 (2022)
안희갑,이승준,정재훈,김휘,엄태강, 장애물 환경에서 동적 k-근접 이웃 탐색 알고리즘을 활용한 GIS의 지리 정보 탐색방법, -, 63/294,069 (2021)
안희갑,정재훈,김휘,엄태강,이승준, 장애물 환경에서 동적 k-근접 이웃 탐색 알고리즘을 활용한 GIS의 지리정보 탐색 방법, 한국, 10-2021-0185237 (2021)