


default search action
Hee-Kap Ahn
Person information
- affiliation: POSTECH, Pohang, Korea
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [c80]Mook Kwon Jung, Seokyun Kang, Hee-Kap Ahn:
Minimum Convex Hull and Maximum Overlap of Two Convex Polytopes. SODA 2025: 3547-3561 - 2024
- [j69]Taekang Eom
, Hee-Kap Ahn:
A linear-time algorithm for the center problem in weighted cycle graphs. Inf. Process. Lett. 186: 106495 (2024) - [j68]Chaeyoon Chung
, Antoine Vigneron
, Hee-Kap Ahn
:
Maximum Coverage by k Lines. Symmetry 16(2): 206 (2024) - [j67]Hee-Kap Ahn
, Seung Joon Lee, Sang Duk Yoon
:
Stacking Monotone Polytopes. Symmetry 16(9): 1246 (2024) - [j66]Hwi Kim, Jaegun Lee, Hee-Kap Ahn
:
Uniformly monotone partitioning of polygons. Theor. Comput. Sci. 1012: 114724 (2024) - [c79]Taehoon Ahn
, Chaeyoon Chung
, Hee-Kap Ahn
, Sang Won Bae
, Otfried Cheong
, Sang Duk Yoon
:
Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions. LATIN (1) 2024: 303-317 - 2023
- [j65]Mincheol Kim, Chanyang Seo, Taehoon Ahn
, Hee-Kap Ahn
:
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. Algorithmica 85(8): 2214-2237 (2023) - [j64]Jongmin Choi
, Dahye Jeong, Hee-Kap Ahn
:
Covering convex polygons by two congruent disks. Comput. Geom. 109: 101936 (2023) - [j63]Hwi Kim, Jaegun Lee, Hee-Kap Ahn
:
Rectangular partitions of a rectilinear polygon. Comput. Geom. 110: 101965 (2023) - [j62]Byeonguk Kang, Jongmin Choi
, Hee-Kap Ahn
:
Intersecting disks using two congruent disks. Comput. Geom. 110: 101966 (2023) - [c78]Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn:
Parallel Line Centers with Guaranteed Separation. CCCG 2023: 153-159 - [c77]Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama:
Universal convex covering problems under affine dihedral group actions. CCCG 2023: 299-305 - [c76]Jongmin Choi, Jaegun Lee, Hee-Kap Ahn
:
Efficient k-Center Algorithms for Planar Points in Convex Position. WADS 2023: 262-274 - 2022
- [j61]Mincheol Kim, Hee-Kap Ahn
:
Minimum-link shortest paths for polygons amidst rectilinear obstacles. Comput. Geom. 103: 101858 (2022) - [j60]Taehoon Ahn
, Jongmin Choi
, Chaeyoon Chung, Hee-Kap Ahn
, Sang Won Bae
, Sang Duk Yoon
:
Rearranging a sequence of points onto a line. Comput. Geom. 107: 101887 (2022) - [j59]Hee-Kap Ahn
, Tamara Mtsentlintze, Jörg-Rüdiger Sack:
CGTA Awards. Comput. Geom. 107: 101896 (2022) - [c75]Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn:
Approximating Convex Polygons by Histogons. CCCG 2022: 75-82 - [c74]Hwi Kim, Jaegun Lee, Hee-Kap Ahn:
Uniformly Monotone Partitioning of Polygons Revisited. CCCG 2022: 212-218 - [c73]Mincheol Kim, Chanyang Seo, Taehoon Ahn
, Hee-Kap Ahn:
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. SoCG 2022: 51:1-51:15 - [c72]Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn:
Inscribing or Circumscribing a Histogon to a Convex Polygon. FSTTCS 2022: 13:1-13:16 - [i31]Mincheol Kim, Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn:
Farthest-point Voronoi diagrams in the presence of rectangular obstacles. CoRR abs/2203.03198 (2022) - [i30]Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama:
Universal convex covering problems under translation and discrete rotations. CoRR abs/2211.14807 (2022) - 2021
- [j58]Jongmin Choi
, Sergio Cabello, Hee-Kap Ahn
:
Maximizing Dominance in the Plane and its Applications. Algorithmica 83(11): 3491-3513 (2021) - [j57]Yujin Choi, Seungjun Lee, Hee-Kap Ahn
:
Maximum-area and maximum-perimeter rectangles in polygons. Comput. Geom. 94: 101710 (2021) - [j56]Jongmin Choi
, Hee-Kap Ahn
:
Efficient planar two-center algorithms. Comput. Geom. 97: 101768 (2021) - [j55]Seungjun Lee, Taekang Eom
, Hee-Kap Ahn
:
Largest triangles in a polygon. Comput. Geom. 98: 101792 (2021) - [j54]Mincheol Kim, Sang Duk Yoon
, Hee-Kap Ahn
:
Shortest rectilinear path queries to rectangles in a rectangular domain. Comput. Geom. 99: 101796 (2021) - [c71]Taehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon:
Rearranging a Sequence of Points onto a Line. CCCG 2021: 36-46 - [c70]Mincheol Kim, Hee-Kap Ahn:
Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles. CCCG 2021: 200-210 - [c69]Taekang Eom
, Seungjun Lee, Hee-Kap Ahn
:
Largest Similar Copies of Convex Polygons in Polygonal Domains. FSTTCS 2021: 19:1-19:13 - [c68]Jongmin Choi
, Dahye Jeong, Hee-Kap Ahn
:
Covering Convex Polygons by Two Congruent Disks. IWOCA 2021: 165-178 - [c67]Byeonguk Kang, Jongmin Choi
, Hee-Kap Ahn
:
Intersecting Disks Using Two Congruent Disks. IWOCA 2021: 400-413 - [e2]Hee-Kap Ahn
, Kunihiko Sadakane
:
32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan. LIPIcs 212, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-214-3 [contents] - [i29]Jongmin Choi, Dahye Jeong, Hee-Kap Ahn:
Covering Convex Polygons by Two Congruent Disks. CoRR abs/2105.02483 (2021) - [i28]Mincheol Kim, Hee-Kap Ahn:
Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles. CoRR abs/2106.14185 (2021) - [i27]Hwi Kim, Jaegun Lee, Hee-Kap Ahn:
Rectangular Partitions of a Rectilinear Polygon. CoRR abs/2111.01970 (2021) - 2020
- [j53]Eunjin Oh, Luis Barba, Hee-Kap Ahn
:
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon. Algorithmica 82(5): 1434-1473 (2020) - [j52]Hee-Kap Ahn
, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
:
Middle curves based on discrete Fréchet distance. Comput. Geom. 89: 101621 (2020) - [j51]Eunjin Oh, Hee-Kap Ahn
:
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. Discret. Comput. Geom. 63(2): 418-454 (2020) - [c66]Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn
:
Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain. LATIN 2020: 271-282 - [i26]Jong Min Choi, Hee-Kap Ahn:
Efficient Planar Two-Center Algorithms. CoRR abs/2006.10365 (2020) - [i25]Seungjun Lee, Taekang Eom, Hee-Kap Ahn:
Largest triangles in a polygon. CoRR abs/2007.12330 (2020) - [i24]Taekang Eom, Seungjun Lee, Hee-Kap Ahn:
Largest similar copies of convex polygons amidst polygonal obstacles. CoRR abs/2012.06978 (2020)
2010 – 2019
- 2019
- [j50]Eunjin Oh, Hee-Kap Ahn
:
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms. Algorithmica 81(7): 2829-2856 (2019) - [j49]Hee-Kap Ahn
, Judit Abardia, Sang Won Bae
, Otfried Cheong, Susanna Dann, Dongwoo Park, Chan-Su Shin
:
The minimum convex container of two convex polytopes under translations. Comput. Geom. 77: 40-50 (2019) - [j48]Hee-Kap Ahn
, Sang Won Bae
, Jong Min Choi
, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron:
Faster algorithms for growing prioritized disks and rectangles. Comput. Geom. 80: 23-39 (2019) - [j47]Eunjin Oh, Hee-Kap Ahn
:
Assigning weights to minimize the covering radius in the plane. Comput. Geom. 81: 22-32 (2019) - [j46]Eunjin Oh, Sang Won Bae
, Hee-Kap Ahn
:
Computing a geodesic two-center of points in a simple polygon. Comput. Geom. 82: 45-59 (2019) - [j45]Hee-Kap Ahn
, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
:
On Romeo and Juliet problems: Minimizing distance-to-sight. Comput. Geom. 84: 12-21 (2019) - [j44]Eunjin Oh, Hee-Kap Ahn
:
Finding pairwise intersections of rectangles in a query rectangle. Comput. Geom. 85 (2019) - [j43]Hee-Kap Ahn
, Taehoon Ahn
, Sang Won Bae
, Jong Min Choi
, Mincheol Kim
, Eunjin Oh, Chan-Su Shin
, Sang Duk Yoon:
Minimum-width annulus with outliers: Circular, square, and rectangular cases. Inf. Process. Lett. 145: 16-23 (2019) - [j42]Eunjin Oh, Hee-Kap Ahn
:
Computing the center region and its variants. Theor. Comput. Sci. 789: 2-12 (2019) - [c65]Yujin Choi, Seungjun Lee, Hee-Kap Ahn
:
Maximum-Area Rectangles in a Simple Polygon. FSTTCS 2019: 12:1-12:14 - [c64]Jong Min Choi
, Sergio Cabello
, Hee-Kap Ahn
:
Maximizing Dominance in the Plane and Its Applications. WADS 2019: 325-338 - [i23]Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. CoRR abs/1906.01114 (2019) - [i22]Yujin Choi, Seungjun Lee, Hee-Kap Ahn:
Maximum-Area Rectangles in a Simple Polygon. CoRR abs/1910.08686 (2019) - [i21]Eunjin Oh, Hee-Kap Ahn:
Polygon Queries for Convex Hulls of Points. CoRR abs/1910.08717 (2019) - [i20]Eunjin Oh, Hee-Kap Ahn:
Computing the Center Region and Its Variants. CoRR abs/1910.12169 (2019) - [i19]Eunjin Oh, Sang Won Bae, Hee-Kap Ahn:
Computing a Geodesic Two-Center of Points in a Simple Polygon. CoRR abs/1910.12177 (2019) - 2018
- [j41]Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
:
The geodesic 2-center problem in a simple polygon. Comput. Geom. 74: 21-37 (2018) - [j40]Sang Duk Yoon, Min-Gyu Kim
, Wanbin Son, Hee-Kap Ahn
:
Geometric matching algorithms for two realistic terrains. Theor. Comput. Sci. 715: 60-70 (2018) - [c63]Yoonho Hwang, Mooyeol Baek, Saehoon Kim, Bohyung Han, Hee-Kap Ahn:
Product Quantized Translation for Fast Nearest Neighbor Search. AAAI 2018: 3295-3301 - [c62]Eunjin Oh, Hee-Kap Ahn
:
Polygon Queries for Convex Hulls of Points. COCOON 2018: 143-155 - [c61]Eunjin Oh, Hee-Kap Ahn
:
Approximate Range Queries for Clustering. SoCG 2018: 62:1-62:14 - [c60]Eunjin Oh, Hee-Kap Ahn
:
Point Location in Dynamic Planar Subdivisions. SoCG 2018: 63:1-63:14 - [c59]Jeong-Han Yun, Yoonho Hwang, Woomyo Lee, Hee-Kap Ahn
, Sin-Kyu Kim:
Statistical Similarity of Critical Infrastructure Network Traffic Based on Nearest Neighbor Distances. RAID 2018: 577-599 - [c58]Hee-Kap Ahn
, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash
:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. SWAT 2018: 6:1-6:13 - [c57]Hee-Kap Ahn
, Taehoon Ahn
, Sang Won Bae
, Jong Min Choi
, Mincheol Kim, Eunjin Oh, Chan-Su Shin
, Sang Duk Yoon:
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. WALCOM 2018: 44-55 - [c56]Hee-Kap Ahn
, Taehoon Ahn
, Jong Min Choi
, Mincheol Kim, Eunjin Oh:
Minimum-Width Square Annulus Intersecting Polygons. WALCOM 2018: 56-67 - [i18]Eunjin Oh, Hee-Kap Ahn:
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. CoRR abs/1801.02292 (2018) - [i17]Eunjin Oh, Hee-Kap Ahn:
Finding Pairwise Intersections of Rectangles in a Query Rectangle. CoRR abs/1801.07362 (2018) - [i16]Eunjin Oh, Luis Barba, Hee-Kap Ahn:
The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon. CoRR abs/1802.06223 (2018) - [i15]Eunjin Oh, Hee-Kap Ahn:
Approximate Range Queries for Clustering. CoRR abs/1803.03978 (2018) - [i14]Eunjin Oh, Hee-Kap Ahn:
Point Location in Dynamic Planar Subdivisions. CoRR abs/1803.04325 (2018) - [i13]Eunjin Oh, Hee-Kap Ahn:
Assigning Weights to Minimize the Covering Radius in the Plane. CoRR abs/1804.00241 (2018) - 2017
- [j39]Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn
:
Top-k Manhattan spatial skyline queries. Inf. Process. Lett. 123: 27-35 (2017) - [j38]Sang Duk Yoon, Hee-Kap Ahn
, Jessica Sherette:
Realistic roofs without local minimum edges over a rectilinear polygon. Theor. Comput. Sci. 675: 15-26 (2017) - [c55]Hee-Kap Ahn
, Nicola Baraldo, Eunjin Oh, Francesco Silvestri
:
A Time-Space Trade-Off for Triangulations of Points in the Plane. COCOON 2017: 3-12 - [c54]Eunjin Oh, Hee-Kap Ahn
:
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons. SoCG 2017: 51:1-51:15 - [c53]Eunjin Oh, Hee-Kap Ahn
:
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. SoCG 2017: 52:1-52:15 - [c52]Hee-Kap Ahn
, Sang Won Bae
, Jong Min Choi
, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen
, Antoine Vigneron
:
Faster Algorithms for Growing Prioritized Disks and Rectangles. ISAAC 2017: 3:1-3:13 - [c51]Eunjin Oh, Hee-Kap Ahn
:
Finding Pairwise Intersections of Rectangles in a Query Rectangle. ISAAC 2017: 60:1-60:12 - [c50]Eunjin Oh, Hee-Kap Ahn
:
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. ISAAC 2017: 61:1-61:12 - [c49]Jong Min Choi
, Dongwoo Park, Hee-Kap Ahn
:
Bundling Two Simple Polygons to Minimize Their Convex Hull. WALCOM 2017: 66-77 - [c48]Eunjin Oh, Hee-Kap Ahn
:
Computing the Center Region and Its Variants. WALCOM 2017: 254-265 - [i12]Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron:
Faster Algorithms for Growing Prioritized Disks and Rectangles. CoRR abs/1704.07580 (2017) - [i11]Eunjin Oh, Hee-Kap Ahn:
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. CoRR abs/1709.09932 (2017) - [i10]Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn:
The Geodesic 2-center Problem in a Simple Polygon. CoRR abs/1710.09035 (2017) - [i9]Naoki Katoh, Hee-Kap Ahn, Subhas C. Nandy:
Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [j37]Hee-Kap Ahn
, Chan-Su Shin
:
Guest Editor's Foreword. Algorithmica 76(4): 1158-1159 (2016) - [j36]Dongwoo Park, Sang Won Bae
, Helmut Alt, Hee-Kap Ahn
:
Bundling three convex polygons to minimize area or perimeter. Comput. Geom. 51: 1-14 (2016) - [j35]Hee-Kap Ahn
, Luis Barba, Prosenjit Bose
, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. 56(4): 836-859 (2016) - [c47]Eunjin Oh, Luis Barba, Hee-Kap Ahn
:
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon. SoCG 2016: 56:1-56:15 - [c46]Eunjin Oh, Hee-Kap Ahn
:
Assigning Weights to Minimize the Covering Radius in the Plane. ISAAC 2016: 58:1-58:12 - [c45]Eunjin Oh, Hee-Kap Ahn
:
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree. ISAAC 2016: 59:1-59:12 - [c44]Hee-Kap Ahn
, Helmut Alt, Maike Buchin
, Eunjin Oh, Ludmila Scharf, Carola Wenk:
A Middle Curve Based on Discrete Fréchet Distance. LATIN 2016: 14-26 - [c43]Eunjin Oh, Sang Won Bae
, Hee-Kap Ahn
:
Computing a Geodesic Two-Center of Points in a Simple Polygon. LATIN 2016: 646-658 - [c42]Eunjin Oh, Wanbin Son, Hee-Kap Ahn
:
Constrained Geodesic Centers of a Simple Polygon. SWAT 2016: 29:1-29:13 - 2015
- [j34]Sang-Sub Kim, Hee-Kap Ahn
:
An improved data stream algorithm for clustering. Comput. Geom. 48(9): 635-645 (2015) - [j33]Wanbin Son, Sang Won Bae
, Hee-Kap Ahn
:
Group nearest-neighbor queries in the L1 plane. Theor. Comput. Sci. 592: 39-48 (2015) - [c41]Hee-Kap Ahn
, Luis Barba, Prosenjit Bose
, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. SoCG 2015: 209-223 - [c40]Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn
:
Geometric Matching Algorithms for Two Realistic Terrains. ISAAC 2015: 285-295 - [c39]Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
:
The 2-Center Problem in a Simple Polygon. ISAAC 2015: 307-317 - [i8]Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A linear-time algorithm for the geodesic center of a simple polygon. CoRR abs/1501.00561 (2015) - 2014
- [j32]Hee-Kap Ahn
, Sang Won Bae
, Otfried Cheong
, Joachim Gudmundsson
, Takeshi Tokuyama
, Antoine Vigneron
:
A Generalization of the Convex Kakeya Problem. Algorithmica 70(2): 152-170 (2014) - [j31]Hee-Kap Ahn
, Siu-Wing Cheng
, Hyuk Jun Kweon
, Juyoung Yon:
Overlap of convex polytopes under rigid motion. Comput. Geom. 47(1): 15-24 (2014) - [j30]Hee-Kap Ahn
, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son:
Computing k Centers over Streaming Data for Small k. Int. J. Comput. Geom. Appl. 24(2): 107-124 (2014) - [j29]Hee-Kap Ahn
, Antoine Vigneron
:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 24(4): 259-260 (2014) - [j28]Wanbin Son, Seung-won Hwang, Hee-Kap Ahn
:
MSSQ: Manhattan Spatial Skyline Queries. Inf. Syst. 40: 67-83 (2014) - [c38]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin:
Minimum Convex Container of Two Convex Polytopes under Translations. CCCG 2014 - [c37]Sang-Sub Kim, Hee-Kap Ahn
:
An Improved Data Stream Algorithm for Clustering. LATIN 2014: 273-284 - [c36]Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn
:
Top-k Manhattan Spatial Skyline Queries. WALCOM 2014: 22-33 - [e1]Hee-Kap Ahn, Chan-Su Shin:
Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings. Lecture Notes in Computer Science 8889, Springer 2014, ISBN 978-3-319-13074-3 [contents] - 2013
- [j27]Hee-Kap Ahn
, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin
, Antoine Vigneron
:
Covering and piercing disks with two centers. Comput. Geom. 46(3): 253-262 (2013) - [j26]Hee-Kap Ahn
, Siu-Wing Cheng
, Iris Reinbacher:
Maximum overlap of convex polytopes under translation. Comput. Geom. 46(5): 552-565 (2013) - [j25]Hee-Kap Ahn
, Sang Won Bae
, Christian Knauer, Mira Lee, Chan-Su Shin
, Antoine Vigneron
:
Realistic roofs over a rectilinear polygon. Comput. Geom. 46(9): 1042-1055 (2013) - [c35]Hee-Kap Ahn
, Sang Won Bae
, Wanbin Son:
Group Nearest Neighbor Queries in the L 1 Plane. TAMC 2013: 52-61 - [c34]Hee-Kap Ahn
, Helmut Alt, Sang Won Bae
, Dongwoo Park:
Bundling Three Convex Polygons to Minimize Area or Perimeter. WADS 2013: 13-24 - 2012
- [j24]Hee-Kap Ahn
, Otfried Cheong
:
Aligning Two Convex Figures to Minimize Area or Perimeter. Algorithmica 62(1-2): 464-479 (2012) - [j23]