A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections

DOI10.1007/S00022-004-1726-2MaRDI QIDQ1775231zbMATH OpenOpenAlexFDO

Authors Siddhartha Brahma, Sudebkumar Prasant Pal, Dilip Sarkar

Publication date 6 May 2005

Published in Journal of Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00022-004-1726-2

zbMATH Keywords

diffuse refletctionmultiple connectednesssimple polygonvisibility

Mathematics Subject Classification ID

Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Combinatorial complexity of geometric structures (52C45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Visibility with multiple diffuse reflections
• Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
• The Complexity of Diffuse Reflections in a Simple Polygon
• Visibility with multiple reflections
• Visibility with multiple reflections

Cited in

(4)

• Visibility with multiple diffuse reflections
• Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
• Diffuse reflection diameter in simple polygons
• Algorithms for Computing Diffuse Reflection Paths in Polygons

This page was built for publication: A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections

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