Research

Domestic Journal Papers

• 단순다각형의 별다각형 분할, 정보과학회논문지, , 51, 1037-1042 (2024 )
• 직사각형 장애물을 피하는 선분 최단경로, 정보과학회논문지, , 50, 204-209 (2023 )
• 히스토그램을 직사각형들로 분할하는 알고리즘, 정보과학회 컴퓨팅의 실제 논문지, , 28, 128-133 (2022 )
• 볼록다각형의 최대 겹침, 정보과학회 컴퓨팅의 실제 논문지, , 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 CAVELIKE SYSTEMS, KSES JOURNAL, , 5, - (2002 )

General Journal Journal

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

Conference Proceedings

• Guarding Points on a Terrain by Watchtowers , , 0, 0, - (2024)
• MinimumWidth DoubleSlabs and Widest Empty Slabs in High Dimensions, Lecture Notes in Computer Science including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 0, 0, 303-317 (2024)
• Parallel Line Centers with Guaranteed Separation, , 0, 0, - (2023)
• Universal convex covering problems under affine dihedral group actions, , 0, 0, - (2023)
• Efficient kCenter Algorithms for Planar Points in Convex Position, Lecture Notes in Computer Science including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 0, 0, 262-274 (2023)
• Inscribing or Circumscribing a Histogon to a Convex Polygon, , 0, 0, 13:1-13:16 (2022)
• Uniformly Monotone Partitioning of Polygons Revisited, , 0, 0, - (2022)
• Approximating Convex Polygons by Histogons, , 0, 0, - (2022)
• Farthestpoint Voronoi diagrams in the presence of rectangular obstacles, , 0, 0, - (2022)
• 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)
• MaximumArea 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 DistancetoSight, 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)
• MinimumWidth Square Annulus Intersecting Polygons, Lecture Notes in Computer Science LNCS 10755, 0, 0, - (2018)
• MinimumWidth 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 ThirtySecond AAAI Conference on Artificial Intelligence AAAI18, 0, 0, - (2018)
• 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 TimeSpace Tradeoff Algorithms, Proceedings of 28th International Symposium on Algorithms and Computation ISAAC 2017, 0, 0, - (2017)
• Faster Algorithms for Growing Prioritized Disks and Rectangles, Proceedings of the 28th International Symposium on Algorithms and Computation ISAAC 2017, 0, 0, - (2017)
• A TimeSpace Tradeoff for Triangulations of Points in the Plane, Lecture Notes in Computer Science 10392, 0, 0, - (2017)
• Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons, Proceedings of 33rd International Symposium on Computational Geometry SoCG 2017, 0, 0, - (2017)
• Voronoi Diagrams for a ModerateSized PointSet in a Simple Polygon, Proceedings of 33rd International Symposium on Computational Geometry SoCG 2017, 0, 0, 521-5215 (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 NearOptimal 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 farthestpoint geodesic Voronoi diagram of points on the boundary of a simple polygon, PROCEEDINGS OF SOCG 2016 LIPICS, 0, 0, - (2016)
• Computing a Geodesic TwoCenter of Points in a Simple Polygon, PROCEEDINGS OF LATIN 2016 LNCS, 0, 0, - (2016)
• A Middle Curve Based on Discrete Fréchet Distance, PROCEEDINGS OF LATIN 2016 LNCS, 0, 0, - (2016)
• Geometric Matching Algorithms for Two Realistic Terrains, LNCS, 0, 0, - (2015)
• The 2center problem in a simple polygon, LNCS, 0, 0, - (2015)
• A lineartime 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)
• Topk 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 kcenter 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)
• Generating Realistic Roofs over a Rectilinear Polygon, IN PROC 22ND INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION, 0, 0, 60-69 (2011)
• Covering and Piercing Disks with Two Centers, IN PROC 22ND INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION, 0, 0, 50-59 (2011)
• MSSQ Manhattan Spatial Skyline Queries, PROC 12TH SYMPOSIUM ON SPATIAL AND TEMPORAL DATABASES, 0, 0, 313-329 (2011)
• Computing the Discrete Frechet Distance with Imprecise Input, ALGORITHMS AND COMPUTATION ISAAC 2010, 0, 0, 422-433 (2010)
• Maximum Overlap of Convex Polytopes under Translation, ALGORITHMS AND COMPUTATION - ISAAC 2010, 0, 0, 97-108 (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 PseudoTriangles 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 JapanKorea Joint Workshop on Algorithms and Computation, 0, 0, 181-188 (2008)
• Spatial Skyline을 계산하는 기하 알고리즘, 2008 한국컴퓨터종합학술대회 논문집, 0, 0, 588-591 (2008)
• Optimal Disjoint Twobox Covering of Points, 1st AAAC Annual Meeting, 0, 0, - (2008)
• Translation Algorithms for Overlaying Convex Polyhedra, 1st AAAC Annual Meeting, 0, 0, - (2008)
• Dilationoptimal 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 KoreaJapan Joint Workshop on Algorithms and Computation, 0, 0, 64-71 (2007)
• ApertureAngle and HausdorffApproximation 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권 제 34호, 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권 제 12호, 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 Musical Composition Environment, Proc Virtual Systems and MultiMedia, 0, 0, 809-814 (2002)
• NAVER design and implementation of XMLbased VR Framework on a PC cluster, Proc Virtual Systems and MultiMedia, 0, 0, 967-975 (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 ReflexFree 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)
• Covering a Simple Polygon by Monotone Directions, 19th Annual International Symposium on Algorithms and Computation, 0, 0, 668-679 (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)
• Casting with Skewed Ejection Direction., Proc. 9th Ann. International Symposium on Algorithms and Computation, 0, 0, 139-148 (0000)

IP

• 안희갑,엄태강,강병욱,송민주, 감시탑 배치방법, USA, 18/959,939 (P202)
• 안희갑,엄태강,안태훈,송민주, 해상 다리 위치 설정 방법, USA, 18/963,934 (P202)
• 안희갑,이재건,정재훈,정채윤,송민주, 야드 시뮬레이터를 이용한 슬라브 운반 스케줄링 시스템, 한국, 10-2024-0201787 (IP24)
• 안희갑,엄태강,안태훈,송민주, 해상 다리 위치 설정 방법, 한국, 10-2024-0121617 (IP24)
• 안희갑,엄태강,강병욱,송민주, 감시탑 배치방법, 한국, 10-2024-0118811 (IP24)
• 안희갑,엄태강,김휘,안효정,정묵권, 장애물 환경에서의 최단 경로 탐색, USA, 18/494,671 (2023)
• 안희갑,최종민,이재건,엄태강, 볼록 위치 수요지에 대한 효율적인 최적 시설 위치 결정 방법, USA, 18/496,700 (2023)
• 안희갑,엄태강,최종민,이재건, 볼록 위치 수요지에 대한 효율적인 최적 시설 위치 결정 방법, 한국, 10-2023-0107614 (2023)
• 안희갑,엄태강,최종민,이재건, 볼록 위치 수요지에 대한 효율적인 최적 시설 위치 결정 방법, 한국, 10-2023-0107614 (2023)
• 안희갑,엄태강,김휘,정묵권,안효정, 장애물 환경에서의 최단 경로 탐색, 한국, 10-2023-0127659 (2023)
• 안희갑,이승준,안태훈,박지우, 궤적 평가 방법 및 장치, USA, 18/500,041 (2023)
• 안희갑,엄태강,김민철,김휘, 직교 다각 장애물 환경에서 건물 사이의 최소 링크를 가진 최단 경로 탐색 방법, USA, 18/318,663 (2023)
• 안희갑,엄태강,김민철,김휘, 직교 다각 장애물 환경에서 건물 사이의 최소 링크를 가진 최단 경로 탐색 방법, 한국, 10-2023-0044712 (2022)
• 안희갑,엄태강,김민철,김휘, 직교 다각 장애물 환경에서 건물 사이의 최소 링크를 가진 최단 경로 탐색 방법, 한국, 10-2023-0044712 (2022)
• 안희갑,김휘,엄태강,김민철, 직교 다각 장애물 환경에서 건물 사이의 최소 링크를 가진 최단 경로 탐색 방법, -, 63/356,005 (2022)
• 안희갑,정재훈,엄태강,김휘,이승준, 장애물 환경에서 동적 k-근접 이웃 탐색 알고리즘을 활용한 GIS의 지리정보 탐색 방법, USA, 18/084,536 (2022)
• 안희갑,이승준,안태훈,박지우, 궤적 평가 방법 및 장치, 한국, 10-2022-0145868 (2022)
• 안희갑,이승준,안태훈,박지우, 궤적 평가 방법 및 장치, 한국, 10-2022-0145868 (2022)
• 안희갑,엄태강,김휘,김민철, 직교 다각 장애물 환경에서 건물 사이의 최소 링크를 가진 최단 경로 탐색 방법, 한국, 10-2022-0071234 (2022)
• 안희갑,정재훈,엄태강,김휘,이승준, 장애물 환경에서 동적 k-근접 이웃 탐색 알고리즘을 활용한 GIS의 지리정보 탐색 방법, 한국, 10-2022-0056332 (2022)
• 안희갑,정재훈,엄태강,김휘,이승준, 장애물 환경에서 동적 k-근접 이웃 탐색 알고리즘을 활용한 GIS의 지리정보 탐색 방법, 한국, 10-2022-0056332 (2022)
• 안희갑,이승준,정재훈,김휘,엄태강, 장애물 환경에서 동적 k-근접 이웃 탐색 알고리즘을 활용한 GIS의 지리 정보 탐색방법, -, 63/294,069 (2021)
• 안희갑,정재훈,김휘,엄태강,이승준, 장애물 환경에서 동적 k-근접 이웃 탐색 알고리즘을 활용한 GIS의 지리정보 탐색 방법, 한국, 10-2021-0185237 (2021)

Book

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

Research Activities

• , 포항공과대학교 (2007-2015)
• , 포항공과대학교 (2007-2016)
• GEOMETRIC SHAPE MATCHING BETWEEN 3D POLYHEDRAL SURFACES, 포항공과대학교 (2007-2008)
• GEOMETRIC SHAPE MATCHING IN 3D: DESIGN OF EFFICIENT MATCHING ALGORITHMS UNDER RIGID MOTIONS, 한국학술진흥재단 (2007-2008)
• , 포항공과대학교 (2007-2008)
• GEOMETRIC SHAPE APPROXIMATION, 한국학술진흥재단 (2008-2008)
• GEOMETRIC SHARPE MATCHING BETWEEN 3D POLYHEDRAL SURFACES, 포항공과대학교 (2008-2009)
• , 포항공과대학교 (2008-2009)
• , 포항공과대학교 (2008-2008)
• 3차원 기하물체의 매칭에 관한연구: 강체이동을 고려한 효율적인 매칭 알고리즘 설계, 한국학술진흥재단 (2008-2009)
• , 한국학술진흥재단 (2008-2009)
• GEOMETRIC SHAPE APPROXIMATION, 한국학술진흥재단 (2009-2009)
• ADAPTIVE ALGORITHMS FOR FUNDAMENTAL GEOMETRIC PROBLEMS, 한국과학재단 (2009-2010)
• , 포항공대산학협력단 (2009-2022)
• , 포항공과대학교 (2009-2010)
• , 현대모비스(주) (2009-2010)
• GEOMETRIC SHAPE APPROXIMATION, 재단법인한국연구재단 (2010-2010)
• ALGORITHMIC ASPECTS OF GEOMETRIC UNCERTAINTY, 재단법인한국연구재단 (2010-2011)
• ADAPTIVE ALGORITHMS FOR FUNDAMENTAL GEOMETRIC PROBLEMS, 재단법인한국연구재단 (2010-2011)
• FINDING OBJECTS IN GEOMETRIC DATA: THEORETICAL ALGORITHMS FOR GEOMETRIC MATCHING, SEGMENTATION AND COVERING., 재단법인한국연구재단 (2010-2011)
• , 재단법인한국연구재단 (2011-2012)
• ADAPTIVE ALGORITHMS FOR FUNDAMENTAL GEOMETRIC PROBLEMS, 재단법인한국연구재단 (2011-2012)
• ALGORITHMIC ASPECTS OF GEOMETRIC UNCERTAINTY, 재단법인한국연구재단 (2011-2012)
• , 재단법인한국연구재단 (2011-2012)
• FINDING OBJECTS IN GEOMETRIC DATA: THEORETICAL ALGORITHMS FOR GEOMETRIC MATCHING, SEGMENTATION AND COVERING, 재단법인한국연구재단 (2011-2012)
• , 재단법인한국연구재단 (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-2020)
• , 재단법인한국연구재단 (2014-2015)
• , 현대엘리베이터(주) (2014-2015)
• , 포항공과대학교 (2015-2038)
• ., ETRI부설국가보안기술연구소 (2016-2016)
• SOFTWARE STAR LAB (OPTIMAL DATA STRUCTURE AND ALGORITHMIC APPLICATIONS IN DYNAMIC GEOMETRIC ENVIRONMENT), 정보통신기술진흥센터 (2017-2017)
• , ETRI부설국가보안기술연구소 (2017-2017)
• SOFTWARE STAR LAB (OPTIMAL DATA STRUCTURE AND ALGORITHMIC APPLICATIONS IN DYNAMIC GEOMETRIC ENVIRONMENT), 정보통신기술진흥센터 (2018-2018)
• SOFTWARE STAR LAB (OPTIMAL DATA STRUCTURE AND ALGORITHMIC APPLICATIONS IN DYNAMIC GEOMETRIC ENVIRONMENT), 정보통신기획평가원 (2019-2019)
• PCB DESIGN AUTOMATION(CPU-MEMORY WIRING), 삼성전자(주) (2019-2019)
• SOFTWARE STAR LAB (OPTIMAL DATA STRUCTURE AND ALGORITHMIC APPLICATIONS IN DYNAMIC GEOMETRIC ENVIRONMENT), 정보통신기획평가원 (2020-2020)
• , 포항공과대학교 (2020-2021)
• PCB DESIGN AUTOMATION (CHIP,BOARD OPTIMAL PATH DESIGN), 삼성전자(주) (2020-2020)
• SOFTWARE STAR LAB (OPTIMAL DATA STRUCTURE AND ALGORITHMIC APPLICATIONS IN DYNAMIC GEOMETRIC ENVIRONMENT), 정보통신기획평가원 (2021-2021)
• POSTECH-APPLE DEVELOPER ACADEMY AND APPLE MANUFACTURING R&D ACCELERATOR, 애플코리아유한회사 (2021-2031)
• POSTECH-APPLE DEVELOPER ACADEMY AND APPLE MANUFACTURING R&D ACCELERATOR, 포항공과대학교 (2021-2031)
• SOFTWARE STAR LAB (OPTIMAL DATA STRUCTURE AND ALGORITHMIC APPLICATIONS IN DYNAMIC GEOMETRIC ENVIRONMENT), 정보통신기획평가원 (2022-2022)
• , 정보통신기획평가원 (2022-2022)
• AI-BASED PCB ROUTING AUTOMATION(CPU-MEMORY), 삼성전자(주) (2022-2022)
• , 포항공과대학교 (2022-2023)
• DATA STRUCTURES FOR RANGE CLOSEST PAIR QUERIES, 재단법인한국연구재단 (2022-2023)
• AI ADVISORY COUNCIL, (주)포스코알텍 (2022-2023)
• SOFTWARE STAR LAB (OPTIMAL DATA STRUCTURE AND ALGORITHMIC APPLICATIONS IN DYNAMIC GEOMETRIC ENVIRONMENT), 정보통신기획평가원 (2023-2023)
• AI-BASED PCB ROUTING AUTOMATION(DIRECT), 삼성전자(주) (2023-2023)
• , 포항공과대학교 (2023-2024)
• , (주)포스코디엑스 (2023-2024)
• MODELING AN OPTIMAL ALGORITHM TO CUT BLOOMS IN THE 3RD BLOOMERY, 주식회사 세아창원특수강 (2023-2023)
• SOFTWARE STAR LAB (OPTIMAL DATA STRUCTURE AND ALGORITHMIC APPLICATIONS IN DYNAMIC GEOMETRIC ENVIRONMENT), 정보통신기획평가원 (2024-2024)
• , 정보통신기획평가원 (2024-2024)
• PCB DESIGN AUTOMATION (CPU-MEMORY AUTO-ROUTING), 삼성전자(주) (2024-2024)
• , 포항공과대학교 (2024-2025)
• , 포항공과대학교 (2024-2025)
• , 포항공과대학교 (2024-2025)