追蹤
Jongmin Choi
Jongmin Choi
Cryptolab inc
在 cryptolab.co.kr 的電子郵件地址已通過驗證 - 首頁
標題
引用次數
引用次數
年份
Efficient planar two-center algorithms
J Choi, HK Ahn
Computational Geometry 97, 101768, 2021
102021
Faster algorithms for growing prioritized disks and rectangles
HK Ahn, SW Bae, J Choi, M Korman, W Mulzer, E Oh, J Park, ...
Computational Geometry 80, 23-39, 2019
62019
Maximizing Dominance in the Plane and its Applications
J Choi, S Cabello, HK Ahn
Algorithmica 83 (11), 3491-3513, 2021
42021
Covering convex polygons by two congruent disks
J Choi, D Jeong, HK Ahn
Computational Geometry 109, 101936, 2023
32023
Minimum-width annulus with outliers: Circular, square, and rectangular cases
HK Ahn, T Ahn, SW Bae, J Choi, M Kim, E Oh, CS Shin, SD Yoon
Information Processing Letters 145, 16-23, 2019
22019
Efficient k-Center Algorithms for Planar Points in Convex Position
J Choi, J Lee, HK Ahn
Algorithms and Data Structures Symposium, 262-274, 2023
12023
Bundling Two Simple Polygons to Minimize Their Convex Hull
J Choi, D Park, HK Ahn
International Workshop on Algorithms and Computation, 66-77, 2017
12017
Intersecting disks using two congruent disks
B Kang, J Choi, HK Ahn
Computational Geometry 110, 101966, 2023
2023
Rearranging a Sequence of Points onto a Line
T Ahn, J Choi, C Chung, HK Ahn, SW Bae, SD Yoon
Computational Geometry 107, 101887, 2022
2022
Maximum Overlap of Two Convex Polygons
G Kim, J Choi, HK Ahn
정보과학회 컴퓨팅의 실제 논문지 27 (8), 400-405, 2021
2021
Minimum-Width Square Annulus Intersecting Polygons
HK Ahn, T Ahn, J Choi, M Kim, E Oh
International Workshop on Algorithms and Computation, 56-67, 2018
2018
系統目前無法執行作業，請稍後再試。
文章 1–11