Yet Another Simple Characterization of Searchable Polygons by 1-Searcher

John Z. Zhang, Ben Burnett · 2006

We revisit the polygon search problem by a boundary searcher holding a flashlight. We provide a simple characterization of searchable polygons under such a search model. Compared with the previous characterizations, the one we present is simpler and more concise in terms of its understandability and representation.

Read the paper · More papers on PaperTik