Work

Weak Visibility Queries of Line Segments in Simple Polygons

Year: 2012

Type: preprint

Abstract: Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P. We build a data structure in O(n) time and O(n) space that can compute the visibility polygon for any query line segment s in O(k log n) time, where k is the size of the visibility polygon of s and n is the number of vertices of P. Alternatively, we build a data structure in O(n^3) time and O(n^3) space that can compute the visibility polygon for any query line segment in O(k + log n) time.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1212.6039

Authors: Chen, Danny Z., Wang, Haitao

Institutions: University of Notre Dame, Utah State University

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

Funder: National Science Foundation

Awards: AF: Small: Applied and Theoretical Algorithm Problems in Computational Geometry, AF: Small: Algorithmic Problems in Applied Computational Geometry

OpenAlex ID: W2949269373

Cites: 15

Cited by:

Related to: 10