Visibility queries in a polygonal region

DOI10.1016/j.comgeo.2009.02.004zbMath1170.65309OpenAlexW1994797107MaRDI QIDQ833709

Rajasekhar Inkulu, Sanjiv Kapoor

Publication date: 14 August 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.02.004

zbMATH Keywords

complexitypolygonal domainvisibility graphgraphical examplesvisibility polygon

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

Incremental Algorithms to Update Visibility Polygons ⋮ Dynamic Algorithms for Visibility Polygons in Simple Polygons ⋮ Visibility and ray shooting queries in polygonal domains ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane

Cites Work

• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• Visibility queries and maintenance in simple polygons
• Efficient visibility queries in simple polygons
• An Optimal Algorithm for Computing Visibility in the Plane
• TRIANGULATING DISJOINT JORDAN CHAINS
• The Robot Localization Problem
• Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• Efficient computation of query point visibility in polygons with holes
• THE VISIBILITY COMPLEX

This page was built for publication: Visibility queries in a polygonal region