Visibility queries and maintenance in simple polygons

DOI10.1007/s00454-001-0089-9zbMath1008.68144OpenAlexW1494368934MaRDI QIDQ1611059

R. Smith

Publication date: 20 August 2002

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-001-0089-9

zbMATH Keywords

visibility polygonsshortest-path trees

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (19)

Visibility queries in a polygonal region ⋮ Space–Query-Time Tradeoff for Computing the Visibility Polygon ⋮ Randomized approximation algorithms for planar visibility counting problem ⋮ Near optimal line segment queries in simple polygons ⋮ Kinetic Geodesic Voronoi Diagrams in a Simple Polygon ⋮ Incremental Algorithms to Update Visibility Polygons ⋮ 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 ⋮ 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 ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane ⋮ On Romeo and Juliet Problems: Minimizing Distance-to-Sight. ⋮ Visibility testing and counting ⋮ Weak visibility queries of line segments in simple polygons

This page was built for publication: Visibility queries and maintenance in simple polygons