Abstract
A new hierarchical decomposition of a simple polygon
is introduced. The hierarchy has depth O(log n), linear
size, and its regions have maximum degree three. Using
this hierarchy, circular ray shooting queries in a simple
polygon can be answered in O(log* n) query time and
O(nlogn) space. If the radius of the circle is fixed,
... read more