Efficient visibility queries in simple polygons
From MaRDI portal
Publication:1862134
Recommendations
Cites work
- scientific article; zbMATH DE number 437529 (Why is no real title available?)
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 3918300 (Why is no real title available?)
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A New Approach to Planar Point Location
- A combinatorial theorem in plane geometry
- A linear algorithm for computing the visibility polygon from a point
- Algorithms for Reporting and Counting Geometric Intersections
- An optimal visibility graph algorithm for triangulated simple polygons
- Computing the visibility polygon from an edge
- Corrections to Lee's visibility polygon algorithm
- Graph theory
- Hiding people in polygons
- Location of a Point in a Planar Subdivision and Its Applications
- Optimal Search in Planar Subdivisions
- The Robot Localization Problem
- Visibility and intersection problems in plane geometry
- Visibility of a simple polygon
- Visibility of disjoint polygons
Cited in
(36)- Approximation algorithms for art gallery problems in polygons
- Weak visibility queries of line segments in simple polygons and polygonal domains
- New Results on Visibility in Simple Polygons
- Query-point visibility constrained shortest paths in simple polygons
- Planar lower envelope of monotone polygonal chains
- Efficient computation of query point visibility in polygons with holes
- Query point visibility computation in polygons with holes
- Visibility queries and maintenance in simple polygons
- Visibility queries in a polygonal region
- A space-time trade-off for computing the visibility polygon in the multi-pass model
- Space–Query-Time Tradeoff for Computing the Visibility Polygon
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
- Randomized approximation algorithms for planar visibility counting problem
- Simulation of pedestrian route choice with local view: a potential field approach
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
- Computing the \(k\)-visibility region of a point in a polygon
- Visibility testing and counting
- Convex hull of a planar set of straight and circular line segments
- Improved approximation for guarding simple galleries from the perimeter
- EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON
- Incremental algorithms to update visibility polygons
- Minimum polygons for fixed visibility VC-dimension
- Shortest path solves edge-to-edge visibility in a polygon
- Quickest visibility queries in polygonal domains
- Algorithm 966: A practical iterative algorithm for the art gallery problem using integer linear programming
- Visibility testing and counting
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
- Space/query-time tradeoff for computing the visibility polygon
- Visibility and Ray Shooting Queries in Polygonal Domains
- Weak visibility counting in simple polygons
- An exact algorithm for minimizing vertex guards on art galleries
- Dynamic algorithms for visibility polygons in simple polygons
- An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
- Flipping edge-labelled triangulations
- Visibility and ray shooting queries in polygonal domains
- Near optimal line segment queries in simple polygons
This page was built for publication: Efficient visibility queries in simple polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862134)
