3 papers
cs.CG2025
Guarding Terrains with Guards on a Line
Byeonguk Kang, Hwi Kim, Hee-Kap Ahn
Given an -monotone polygonal chain with vertices, and an integer , we consider the problem of finding the lowest horizontal line lying above with point gu…
cs.CG2025
Balanced TSP partitioning
Benjamin Aram Berendsohn, Hwi Kim, László Kozma
The traveling salesman problem (TSP) famously asks for a shortest tour that a salesperson can take to visit a given set of cities in any order. In this paper, we ask how much faste…
cs.CG2021
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…