Loading...

Visibility maintenance of a moving segment observer inside polygons with holes

Akbari, H ; Sharif University of Technology | 2010

263 Viewed
  1. Type of Document: Article
  2. Publisher: 2010
  3. Abstract:
  4. We analyze how to efficiently maintain and update the visibility polygons for a segment observer moving in a polygonal domain. The space and time requirements for preprocessing are O(n2) and after preprocessing, visibil- ity change events for weak and strong visibility can be handled in O(log VP) and O(log(VP1 + VP2)) re- spectively, or O(log n) in which VP is the size of the line segment's visibility polygon and VP 1 and VP2 represent the number of vertices in the visibility poly- gons of the line segment endpoints
  5. Keywords:
  6. Line segment ; Polygonal domain ; Polygons with holes ; Space and time ; Computational geometry ; Visibility
  7. Source: Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010, 9 August 2010 through 11 August 2010, Winnipeg, MB ; 2010 , Pages 117-120
  8. URL: http://cccg.ca/proceedings/2010/paper33.pdf