Hierarchical decompositions and circular ray shooting in simple polygons - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete and Computational Geometry Year : 2004

Hierarchical decompositions and circular ray shooting in simple polygons

Siu-Wing Cheng
  • Function : Author
Otfried Cheong
  • Function : Author
Rene van Oostrum
  • Function : Author

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).

Dates and versions

inria-00100017 , version 1 (26-09-2006)

Identifiers

Cite

Siu-Wing Cheng, Otfried Cheong, Hazel Everett, Rene van Oostrum. Hierarchical decompositions and circular ray shooting in simple polygons. Discrete and Computational Geometry, 2004, 32 (3), pp.401-415. ⟨10.1007/s00454-004-1098-2⟩. ⟨inria-00100017⟩
89 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More