A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Motivated by the k-center problem in location analysis, we consider the polygon burning (PB) problem: Given a polygonal domain P with h holes and n vertices, find a set S of k vertices of P that minimizes the maximum geodesic distance from any point in P to its nearest vertex in S. Alternatively, viewing each vertex in S as a site to start a fire, the goal is to select S such that fires burning simultaneously and uniformly from S, restricted to P, consume P entirely as quickly as possible. WearXiv:2111.09054v1 fatcat:3cd4gm25uvbw5ma2gsnqjcn5fe