3 papers
cs.CG2020
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…
cs.CG2020
Largest triangles in a polygon
Seungjun Lee, Taekang Eom, Hee-Kap Ahn
We study the problem of finding maximum-area triangles that can be inscribed in a polygon in the plane. We consider eight versions of the problem: we use either convex polygons or…
cs.CG2019
Maximum-Area Rectangles in a Simple Polygon
Yujin Choi, Seungjun Lee, Hee-Kap Ahn
We study the problem of finding maximum-area rectangles contained in a polygon in the plane. There has been a fair amount of work for this problem when the rectangles have to be ax…