Visibility with multiple reflections

DOI10.1007/3-540-61422-2_139zbMath1502.68298OpenAlexW1522497204MaRDI QIDQ5054820

D. C. Prasad, A. R. Davis, Sudebkumar Prasant Pal, Boris Aronov, Tamal Krishna Dey

Publication date: 9 December 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_139

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity and construction of many faces in arrangements of lines and of segments
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
• Some properties of \(L\) sets in the plane
• Algorithms for Reporting and Counting Geometric Intersections
• A linear algorithm for computing the visibility polygon from a point
• Polygonal Rooms Not Illuminable from Every Point
• Billiards in polygons

This page was built for publication: Visibility with multiple reflections