Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: Article
- Abstract:
- In this paper, we consider the problem of computing the weak visibility (WV ) of a query line segment in- side a simple polygon. Our algorithm first preprocesses the polygon and creates data structures from which any WV query is answered efficiently in an output sensitive manner. In our solution, the preprocessing is performed in time O(n3 log n) and the size of the constructed data structure is O(n3). It is then possible to report the WV polygon of any query line segment in time O(log n+k), where k is the size of the output. Our algorithm im- proves the current results for this problem
- Keywords:
- Line segment ; Output-sensitive ; Simple polygon ; Weak visibility ; Algorithms ; Data structures ; Visibility ; Computational geometry
- Source: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011 ; 2011
- URL: http://2011.cccg.ca/PDFschedule/papers/paper95.pdf