Visibility queries in a polygonal region

DOI10.1016/J.COMGEO.2009.02.004MaRDI QIDQ833709zbMATH OpenOpenAlexFDO

Authors 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

complexitygraphical examplespolygonal domainvisibility polygonvisibility graph

Mathematics Subject Classification ID

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

Recommendations

• Visibility queries and maintenance in simple polygons
• Efficient visibility queries in simple polygons
• Visibility polygon queries among dynamic polygonal obstacles in plane
• Query point visibility computation in polygons with holes
• Visibility and ray shooting queries in polygonal domains
• Visibility and Ray Shooting Queries in Polygonal Domains
• Quickest visibility queries in polygonal domains
• Quickest visibility queries in polygonal domains
• Space/query-time tradeoff for computing the visibility polygon
• Computing the visibility graph of points within a polygon

Cites work

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

Cited in

(18)

• Efficient computation of query point visibility in polygons with holes
• Efficient visibility queries in simple polygons
• Reasoning about visibility
• Query point visibility computation in polygons with holes
• Visibility and ray shooting queries in polygonal domains
• Blocking visibility for points in general position
• Computing the \(k\)-visibility region of a point in a polygon
• Quickest visibility queries in polygonal domains
• Quickest visibility queries in polygonal domains
• Space–Query-Time Tradeoff for Computing the Visibility Polygon
• Visibility and Ray Shooting Queries in Polygonal Domains
• Computing the \(k\)-crossing visibility region of a point in a polygon
• Incremental algorithms to update visibility polygons
• Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
• Space/query-time tradeoff for computing the visibility polygon
• Dynamic algorithms for visibility polygons in simple polygons
• Visibility queries and maintenance in simple polygons
• Visibility of disjoint polygons

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833709)