2003/06/02 by Sudebkumar Prasant Pal, Pal, Sudebkumar Prasant, Dilip Sarkar +1
Computer Science · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Computer Graphics and Visualization Techniques #Digital Image Processing Techniques #Discrete Mathematics (cs.DM) #F2.2 #FOS: Computer and information sciences #G2.1 #Graphics (cs.GR) #cs.CG #cs.DM #cs.GR
paper · pdf · doi:10.48550/arxiv.cs/0306010
10 pages, 3 figures
arxiv created 2003/06/02 · openalex publication_date 2003/06/02 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is known that the region V(s) of a simple polygon P, directly visible (illuminable) from an internal point s, is simply connected. Aronov et al. \citeaddpp981 established that the region V1(s) of a simple polygon visible from an internal point s due to at most one diffuse reflection on the boundary of the polygon P, is also simply connected. In this paper we establish that the region V2(s), visible from s due to at most two diffuse reflections may be multiply connected; we demonstrate the construction of an n-sided simple polygon with a point s inside it so that and the region of P visible from s after at most two diffuse reflections is multiple connected.