23 citations · 31 across the 16 of their papers we have counts for
30 papers
Universal convex covering problems under translation and discrete rotations
Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn +1
We consider the smallest-area universal covering of planar objects of perimeter 2 (or equivalently closed curves of length 2) allowing translation and discrete rotations. In partic…
Farthest-point Voronoi diagrams in the presence of rectangular obstacles
Mincheol Kim, Chanyang Seo, Taehoon Ahn +1
We present an algorithm to compute the geodesic farthest-point Voronoi diagram of point sites in the presence of rectangular obstacles in the plane. It takes $O(nm+n…
Rectangular Partitions of a Rectilinear Polygon
Hwi Kim, Jaegun Lee, Hee-Kap Ahn
We investigate the problem of partitioning a rectilinear polygon with vertices and no holes % with no holes into rectangles using disjoint line segments drawn inside un…
Minimum-Link Shortest Paths for Polygons amidst Rectilinear Obstacles
Mincheol Kim, Hee-Kap Ahn
Consider two axis-aligned rectilinear simple polygons in the domain consisting of axis-aligned rectilinear obstacles in the plane such that the bounding boxes, one for each obstacl…
Covering Convex Polygons by Two Congruent Disks
Jongmin Choi, Dahye Jeong, Hee-Kap Ahn
We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We…
Largest similar copies of convex polygons amidst polygonal obstacles
Taekang Eom, Seungjun Lee, Hee-Kap Ahn
Given a convex polygon with vertices and a polygonal domain consisting of polygonal obstacles with total size in the plane, we study the optimization problem of fin…