Visibility and ray shooting queries in polygonal domains

Authors:
Danny Z. Chen;Haitao Wang
Affiliations:
Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Department of Computer Science, Utah State University, Logan, UT
Venue:
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Year:
2013

Citing 12
Cited 0

Visibility and intersection problems in plane geometry

Discrete & Computational Geometry
A pedestrian approach to ray shooting: shoot a ray, take a walk

SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Pseudo-triangulations: theory and applications

Proceedings of the twelfth annual symposium on Computational geometry
Ray shooting amidst convex polygons in 2D

Journal of Algorithms
Graphics in Flatland Revisited

SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
Efficient visibility queries in simple polygons

Computational Geometry: Theory and Applications
Query point visibility computation in polygons with holes

Computational Geometry: Theory and Applications
Visibility queries in a polygonal region

Computational Geometry: Theory and Applications
Planar rectilinear shortest path computation using corridors

Computational Geometry: Theory and Applications
Space---Query-Time Tradeoff for Computing the Visibility Polygon

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
A nearly optimal algorithm for finding L1shortest paths among polygonal obstacles in the plane

ESA'11 Proceedings of the 19th European conference on Algorithms
Computing the visibility polygon of an island in a polygonal domain

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.