3 papers
cs.CG2026
Decomposing a Simple Polygon with Geodesic Unit-Balls
Reilly Browne, Prahlad Narasimhan Kasthurirangan
We consider covering and partitioning a simple polygon into pieces which either have unit geodesic radius or unit geodesic diameter, using the -metric for distances. There…
cs.DS2026
Single-Criteria Metric -Dominating Set Problem via Minor-Preserving Support
Reilly Browne, Hsien-Chih Chang
Given an unweighted graph , the *minimum -dominating set problem* asks for the smallest-cardinality subset such that every vertex in is within radius of some vert…
cs.CG2026
Covering and Partitioning Complex Objects with Small Pieces
Anders Aamand, Mikkel Abrahamsen, Reilly Browne +6
We study the problems of covering or partitioning a polygon (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contain…