Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
暂无分享,去创建一个
Sudebkumar Prasant Pal | Subhas C. Nandy | Arijit Bishnu | Arindam Khan | Mridul Aanjaneya | Mridul Aanjaneya | A. Khan | Arijit Bishnu | S. P. Pal | S. Nandy
[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.