Near Optimal Line Segment Weak Visibility Queries in Simple Polygons
Computational Geometry
2013-10-01 v1
Abstract
This paper considers the problem of computing the weak visibility polygon (WVP) of any query line segment pq (or WVP(pq)) inside a given simple polygon P. We present an algorithm that preprocesses P and creates a data structure from which WVP(pq) is efficiently reported in an output sensitive manner. Our algorithm needs O(n^2 log n) time and O(n^2) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(log^2 n + |WVP(pq)|). We improve the preprocessing time and space of current results for this problem at the expense of more query time.
Cite
@article{arxiv.1309.7803,
title = {Near Optimal Line Segment Weak Visibility Queries in Simple Polygons},
author = {Mojtaba Nouri Bygi and Mohammad Ghodsi},
journal= {arXiv preprint arXiv:1309.7803},
year = {2013}
}