4 papers
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…
Vantage Point Selection Algorithms for Bottleneck Capacity Estimation
Vikrant Ashvinkumar, Rezaul Chowdhury, Jie Gao +3
Motivated by the problem of estimating bottleneck capacities on the Internet, we formulate and study the problem of vantage point selection. We are given a graph whose e…
Optimizing Visibility-based Search in Polygonal Domains
Kien C. Huynh, Joseph S. B. Mitchell, Linh Nguyen +1
Given a geometric domain , visibility-based search problems seek routes for one or more mobile agents ("watchmen") to move within in order to be able to see a portion (or al…
Contiguous Boundary Guarding
Ahmad Biniaz, Anil Maheshwari, Joseph S. B. Mitchell +3
We study the problem of guarding the boundary of a simple polygon with a minimum number of guards such that each guard covers a contiguous portion of the boundary. First, we presen…