Computing the \(k\)-visibility region of a point in a polygon

DOI10.1007/s00224-020-09999-0zbMath1466.52002OpenAlexW3048580603MaRDI QIDQ2032289

Yeganeh Bahoo, Thomas C. Shermer, Stephane Durocher, Prosenjit Bose

Publication date: 11 June 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-020-09999-0

zbMATH Keywords

visibilitycomputational geometrycell decompositiondata structureradial decomposition

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Corrections to Lee's visibility polygon algorithm
• Recognizing polygons, or how to spy
• Triangulating a simple polygon in linear time
• Visibility queries and maintenance in simple polygons
• Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
• Modem illumination of monotone polygons
• Efficient visibility queries in simple polygons
• Coverage with \(k\)-transmitters in the presence of obstacles
• An Upper Bound on the k-Modem Illumination Problem
• Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon
• Visibility of a simple polygon
• A linear algorithm for computing the visibility polygon from a point
• Optimal Search in Planar Subdivisions
• Computational Geometry in C
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Sorting jordan sequences in linear time using level-linked search trees
• Detecting Weakly Simple Polygons