Skip to main content
Springer Nature Link
Log in

The Complexity of Diffuse Reflections in a Simple Polygon

  • Conference paper
LATIN 2006: Theoretical Informatics (LATIN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3887))

Included in the following conference series:

Abstract

The complexity of the visibility region formed by a point light source after k diffuse reflections in a simple n-sided polygon is O(n 9), which is the first result polynomial in n, with no dependence on k. This bound is an exponential improvement over the previous bound of O(n \(^{\rm 2\lceil ({\it k}+1)/2 \rceil +1}\)) due to Prasad et al.[8].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aronov, B., Davis, A.R., Dey, T.K., Pal, S.P., Prasad, D.C.: Visibility with multiple reflections. Discrete Comput. Geom. 20, 61–78 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aronov, B., Davis, A.R., Dey, T.K., Pal, S.P., Prasad, D.C.: Visibility with one reflection. Discrete Comput. Geom. 19, 553–574 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Asano, T., Ghosh, S.K., Shermer, T.C.: Visibility in the plane. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 829–876. Elsevier Science Publishers B.V. North-Holland, Amsterdam (2000)

    Chapter  Google Scholar 

  4. Davis, A.R.: Visibility with reflection in triangulated surfaces. PhD thesis, Polytechnic University (1998)

    Google Scholar 

  5. ElGindy, H.: An efficient algorithm for computing the weak visibility polygon from an edge in simple polygons. School Comput. Sci., McGill Univ., Montreal, PQ (1984) (manuscript)

    Google Scholar 

  6. O’Rourke, J.: Visibility. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, ch. 25, pp. 467–480. CRC Press LLC, Boca Raton (1997)

    Google Scholar 

  7. Pal, S.P., Sarkar, D.: On multiple connectedness of regions visible due to multiple diffuse reflections, arXiv/cs.CG/0306010

    Google Scholar 

  8. Prasad, D.C., Pal, S.P., Dey, T.K.: Visibility with multiple diffuse reflections. Computational Geometry 10(3), 187–196 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Urrutia, J.: Art gallery and illumination problems. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 973–1027. North-Holland, Amsterdam (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Polytecnic University, 5 MetroTech Center, Brooklyn, NY, 11201, USA

    Boris Aronov, Alan R. Davis, John Iacono & Albert Siu Cheong Yu

Authors
  1. Boris Aronov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan R. Davis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. John Iacono
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Albert Siu Cheong Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Business, Universidad Adolfo Ibáñez, Chile

    José R. Correa

  2. Dept. of Computer Science, University of Chile, Blanco Encalada 2120, 3er piso, Santiago, Chile

    Alejandro Hevia

  3. Dept. Ing. Matemática & Ctr. de Modelamiento Matemático, UMI 2807 U. Chile–CNRS, Chile

    Marcos Kiwi

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aronov, B., Davis, A.R., Iacono, J., Yu, A.S.C. (2006). The Complexity of Diffuse Reflections in a Simple Polygon. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_13

Download citation

  • DOI: https://doi.org/10.1007/11682462_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32755-4

  • Online ISBN: 978-3-540-32756-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics