Abstract
A hierarchical decomposition of a simple polygon is introduced. The hierarchy has logarithmic depth, linear size, and its regions have at most three neighbors. Using this hierarchy, circular ray shooting queries in a simple polygon on n vertices can be answered in O(log2 n) query time and O(n log n) space. If the radius of the circle is fixed, the query time can be improved to O(log n) and the space to O(n).
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Cheng, SW., Cheong, O., Everett, H. et al. Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. Discrete Comput Geom 32, 401–415 (2004). https://doi.org/10.1007/s00454-004-1098-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-004-1098-2