2 papers
cs.CG2025
Minimum Partition of Polygons under Width and Cut Constraints
Jaehoon Chung, Kazuo Iwama, Chung-Shou Liao +1
We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given w…
cs.DS2025
Waiting is not easy but worth it: the online TSP on the line revisited
Pei-Chuan Chen, Erik D. Demaine, Chung-Shou Liao +1
We consider the online traveling salesman problem on the real line (OLTSPL) in which a salesman begins at the origin, traveling at no faster than unit speed along the real line, an…