Finding all weakly-visible chords of a polygon in linear time

DOI10.1007/3-540-58218-5_11zbMath1502.68310OpenAlexW1546414949MaRDI QIDQ5056171

Paul J. Heffernan, Giri Narasimhan, Gautam K. Das

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58218-5_11

Mathematics Subject Classification ID

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

Related Items

Computing a shortest watchman path in a simple polygon in polynomial-time, Characterizing LR-visibility polygons and related problems

Cites Work

• LR-visibility in polygons
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• THE TWO GUARDS PROBLEM
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Two-Guard Walkability of Simple Polygons
• An optimal algorithm for detecting weak visibility of a polygon