E. Packer

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2023

Approximation Algorithms for the Two-Watchman Route in a Simple Polygon

Bengt J. Nilsson, Eli Packer

The two-watchman route problem is that of computing a pair of closed tours in an environment so that the two tours together see the whole environment and some length measure on the…

cs.CG2023

Minimum-link $C$ -Oriented Paths Visiting a Sequence of Regions in the Plane

Kerem Geva, Matthew J. Katz, Joseph S. B. Mitchell +1

Let $E = {e_{1}, \dots, e_{n}}$ be a set of $C$ -oriented disjoint segments in the plane, where $C$ is a given finite set of orientations that spans the plane, and let $s$ and $t$ be two…

Approximation Algorithms for the Two-Watchman Route in a Simple Polygon

Minimum-link C-Oriented Paths Visiting a Sequence of Regions in the Plane

Minimum-link $C$ -Oriented Paths Visiting a Sequence of Regions in the Plane