Efficient visibility queries in simple polygons
From MaRDI portal
Publication:1862134
DOI10.1016/S0925-7721(01)00070-0zbMath1019.65020OpenAlexW2004826883MaRDI QIDQ1862134
Prosenjit Bose, Anna Lubiw, J. Ian Munro
Publication date: 10 March 2003
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(01)00070-0
Related Items (26)
Simulation of pedestrian route choice with local view: a potential field approach ⋮ Visibility queries in a polygonal region ⋮ Randomized approximation algorithms for planar visibility counting problem ⋮ Near optimal line segment queries in simple polygons ⋮ Flipping edge-labelled triangulations ⋮ Improved approximation for guarding simple galleries from the perimeter ⋮ Incremental Algorithms to Update Visibility Polygons ⋮ Algorithm 966 ⋮ Dynamic Algorithms for Visibility Polygons in Simple Polygons ⋮ Visibility Testing and Counting ⋮ Query point visibility computation in polygons with holes ⋮ Planar lower envelope of monotone polygonal chains ⋮ Weak visibility queries of line segments in simple polygons and polygonal domains ⋮ An exact algorithm for minimizing vertex guards on art galleries ⋮ Approximation algorithms for art gallery problems in polygons ⋮ Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs ⋮ Visibility and ray shooting queries in polygonal domains ⋮ Computing the \(k\)-visibility region of a point in a polygon ⋮ Diffuse reflection radius in a simple polygon ⋮ An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem ⋮ Quickest visibility queries in polygonal domains ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane ⋮ An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries ⋮ Visibility testing and counting ⋮ Weak visibility queries of line segments in simple polygons ⋮ Weak visibility counting in simple polygons
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Visibility and intersection problems in plane geometry
- Visibility of disjoint polygons
- Corrections to Lee's visibility polygon algorithm
- An optimal visibility graph algorithm for triangulated simple polygons
- Hiding people in polygons
- A combinatorial theorem in plane geometry
- Computing the visibility polygon from an edge
- Algorithms for Reporting and Counting Geometric Intersections
- Visibility of a simple polygon
- A linear algorithm for computing the visibility polygon from a point
- A New Approach to Planar Point Location
- Optimal Search in Planar Subdivisions
- Location of a Point in a Planar Subdivision and Its Applications
- The Robot Localization Problem
This page was built for publication: Efficient visibility queries in simple polygons
