Diffuse reflection diameter and radius for convex-quadrilateralizable polygons

In this paper we study the diffuse reflection diameter and diffuse reflection radius problems for convex-quadrilateralizable polygons. In the usual model of diffuse reflection, a light ray incident at a point on the reflecting surface is reflected from that point in all possible inward directions. A ray reflected from a polygonal edge may graze that reflecting edge but an incident ray cannot graze the reflecting edge. The diffuse reflection diameter of a simple polygon P is the minimum number of diffuse reflections that may be needed in the worst case to illuminate any target point t from any point light source s inside P. We show that the diameter is upper bounded by 3n-104 in our usual model of diffuse reflection for convex-quadrilateralizable polygons. To the best of our knowledge, this is the first upper bound on diffuse reflection diameter within a fraction of n for such a class of polygons. We also show that the diffuse reflection radius of a convex-quadrilateralizable simple polygon with n vertices is at most 3n-108 under the usual model of diffuse reflection. In other words, there exists a point inside such a polygon from which 3n-108usual diffuse reflections are always sufficient to illuminate the entire polygon. In order to establish these bounds for the usual model, we first show that the diameter and radius are n-42 and @?n-44@? respectively, for the same class of polygons for a relaxed model of diffuse reflections; in the relaxed model an incident ray is permitted to graze a reflecting edge before turning and reflecting off the same edge at any interior point on that edge. We also show that the worst-case diameter and radius lower bounds of n-42 and @?n-44@? respectively, are sometimes attained in the usual model, as well as in the relaxed model of diffuse reflection.

[1]  Victor Klee Is Every Polygonal Region Illuminable from Some Point , 1969 .

[2]  Franz Aurenhammer,et al.  Handbook of Computational Geometry , 2000 .

[3]  Subir Kumar Ghosh,et al.  Visibility Algorithms in the Plane , 2007 .

[4]  Micha Sharir,et al.  Computing the link center of a simple polygon , 1987, SCG '87.

[5]  S. Suri A linear time algorithm with minimum link paths inside a simple polygon , 1986 .

[6]  C. Jordan Sur les assemblages de lignes. , 1869 .

[7]  Jörg-Rüdiger Sack,et al.  An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon , 1989, STACS.

[8]  Boris Aronov,et al.  The Complexity of Diffuse Reflections in a Simple Polygon , 2006, LATIN.

[9]  Boris Aronov,et al.  Visibility with Multiple Reflections , 1996, SWAT.

[10]  Dilip Sarkar,et al.  A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections , 2004 .

[11]  Tamal K. Dey,et al.  Visibility with multiple diffuse reflections , 1998, Comput. Geom..

[12]  Victor Klee,et al.  Old And New Unsolved Problems In Plane Geometry And Number Theory , 1991 .

[13]  George William Tokarsky,et al.  Polygonal Rooms Not Illuminable from Every Point , 1995 .

[14]  V. Chvátal A combinatorial theorem in plane geometry , 1975 .

[15]  Subir Kumar Ghosh Computing the Visibility Polygon from a Convex Set and Related Problems , 1991, J. Algorithms.

[16]  S. Suri Minimum link paths in polygons and related problems , 1987 .

[17]  Jörg-Rüdiger Sack,et al.  Link Distance Problems , 2000, Handbook of Computational Geometry.

[18]  J. O'Rourke Art gallery theorems and algorithms , 1987 .

[19]  J. Karle,et al.  Corrections , 2005, The Lancet Neurology.

[20]  Andrzej Lingas,et al.  AnO(n logn) algorithm for computing the link center of a simple polygon , 1992, Discret. Comput. Geom..

[21]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[22]  Boris Aronov,et al.  Visibility with One Reflection , 1998, Discret. Comput. Geom..

[23]  Anil Maheshwari,et al.  Algorithms for computing diffuse reflection paths in polygons , 2011, The Visual Computer.