Elsevier

Computational Geometry

Volume 48, Issue 2, February 2015, Pages 31-41
Computational Geometry

Visibility and ray shooting queries in polygonal domains☆

https://doi.org/10.1016/j.comgeo.2014.08.003Get rights and content
Under an Elsevier user license
open archive

Abstract

Given a polygonal domain (or polygon with holes) in the plane, we study the problem of computing the visibility polygon of any query point. As a special case of visibility problems, we also study the ray-shooting problem of finding the first point on the polygon boundaries that is hit by any query ray. These are fundamental problems in computational geometry and have been studied extensively. We present new algorithms and data structures that improve the previous results.

Keywords

Visibility polygons
Ray-shootings
Visibility queries
Polygonal domains
Algorithms

Cited by (0)

☆

A preliminary version of this paper appeared in the proceedings of the 13rd International Symposium on Algorithms and Data Structures (WADS 2013).

Copyright © 2014 Elsevier B.V. All rights reserved.