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

DOI10.1007/s00022-004-1726-2zbMath1067.52020OpenAlexW1965539747MaRDI QIDQ1775231

Dilip Sarkar, Siddhartha Brahma, Sudebkumar Prasant Pal

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

visibilitysimple polygondiffuse refletctionmultiple connectedness

Mathematics Subject Classification ID

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

Related Items (4)

Diffuse reflection diameter in simple polygons ⋮ Diffuse reflection diameter and radius for convex-quadrilateralizable polygons ⋮ Algorithms for Computing Diffuse Reflection Paths in Polygons ⋮ Diffuse reflection radius in a simple polygon

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