A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Jack and Jill want to play hide-and-seek on the boundary of a simple polygon. Given arbitrary paths for the two children along this boundary, our goal is to determine whether Jack can walk along his path without ever being seen by Jill. To solve this problem, we use a linear-sized skeleton invisibility diagram to implicitly represent invisibility information between pairs of points on the boundary of the simple polygon. This structure has additional applications for any polygon walk problemdoi:10.1007/978-3-642-20877-5_48 fatcat:qeajuyg3pbdqrn7oe7mqwrkkua