Work

Near Optimal Line Segment Weak Visibility Queries in Simple Polygons

Year: 2013

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1309.7803

Authors: Bygi, Mojtaba Nouri, Ghodsi, Mohammad

Institutions: Sharif University of Technology, Institute for Research in Fundamental Sciences

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1506581758

Cites: 10

Cited by: 1

Related to: 20