The Complexity of Diffuse Reflections in a Simple Polygon

DOI10.1007/11682462_13MaRDI QIDQ3525751zbMATH OpenOpenAlexFDO

Authors A. R. Davis, John Iacono, Albert Siu Cheong Yu, Boris Aronov

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11682462_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Visibility with multiple diffuse reflections
• Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
• Visibility with multiple reflections
• Visibility with multiple reflections

Cited in

(4)

• Algorithms for Computing Diffuse Reflection Paths in Polygons
• A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections
• Diffuse reflection diameter in simple polygons
• Diffuse reflection diameter and radius for convex-quadrilateralizable polygons

This page was built for publication: The Complexity of Diffuse Reflections in a Simple Polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525751)