Skip to main content
SpringerLink
Log in

Visibility and Ray Shooting Queries in Polygonal Domains

  • Conference paper
Book cover Algorithms and Data Structures (WADS 2013)

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

Included in the following conference series:

Abstract

Given a polygonal domain (or polygon with holes) in the plane, we study the problem of computing the visibility polygon of any query point. As a special case of visibility problems, we also study the ray-shooting problem of finding the first point on the polygon boundaries that is hit by any query ray. These are fundamental problems in computational geometry and have been studied extensively. We present new algorithms and data structures that improve the previous results.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P., Sharir, M.: Ray shooting amidst convex polygons in 2D. Journal of Algorithms 21(3), 508–519 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aronov, B., Guibas, L., Teichmann, M., Zhang, L.: Visibility queries and maintenance in simple polygons. Discrete and Computational Geometry 27(4), 461–483 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bar-Yehuda, R., Chazelle, B.: Triangulating disjoint Jordan chains. International Journal of Computational Geometry and Applications 4(4), 475–481 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bose, P., Lubiw, A., Munro, J.: Efficient visibility queries in simple polygons. Computational Geometry: Theory and Applications 23(3), 313–335 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chazelle, B., Edelsbrunner, H., Grigni, M., Gribas, L., Hershberger, J., Sharir, M., Snoeyink, J.: Ray shooting in polygons using geodesic triangulations. Algorithmica 12(1), 54–68 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chazelle, B., Guibas, L.: Visibility and intersection problems in plane geometry. Discrete and Computational Geometry 4, 551–589 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chen, D.Z., Wang, H.: A nearly optimal algorithm for finding L 1 shortest paths among polygonal obstacles in the plane. In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 481–492. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Chen, D.Z., Wang, H.: Computing the visibility polygon of an island in a polygonal domain. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 218–229. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  9. Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2(1-4), 209–233 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hershberger, J., Suri, S.: A pedestrian approach to ray shooting: Shoot a ray, take a walk. Journal of Algorithms 18(3), 403–431 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. Inkulu, R., Kapoor, S.: Planar rectilinear shortest path computation using corridors. Computational Geometry: Theory and Applications 42(9), 873–884 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Inkulu, R., Kapoor, S.: Visibility queries in a polygonal region. Computational Geometry: Theory and Applications 42(9), 852–864 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kapoor, S., Maheshwari, S., Mitchell, J.: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discrete and Computational Geometry 18(4), 377–383 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lee, D., Preparata, F.: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14(3), 393–410 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lu, L., Yang, C., Wang, J.: Point visibility computing in polygons with holes. Journal of Information and Computational Science 8(16), 4165–4173 (2011)

    Google Scholar 

  16. Nouri, M., Ghodsi, M.: Space–query-time tradeoff for computing the visibility polygon. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol. 5598, pp. 120–131. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  17. Pocchiola, M.: Graphics in flatland revisited. In: Gilbert, J.R., Karlsson, R. (eds.) SWAT 1990. LNCS, vol. 447, pp. 85–96. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  18. Pocchiola, M., Vegter, G.: Pseudo-triangulations: Theory and applications. In: Proc. of the 12th Annual Symposium on Computational Geometry, pp. 291–300 (1996)

    Google Scholar 

  19. Pocchiola, M., Vegter, G.: Topologically sweeping visibility complexes via pseudotriangulations. Discrete and Computational Geometry 16(4), 419–453 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  20. Pocchiola, M., Vegter, G.: The visibility complex. International Journal of Computational Geometry and Applications 6(3), 279–308 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  21. Zarei, A., Ghodsi, M.: Query point visibility computation in polygons with holes. Computational Geometry: Theory and Applications 39(2), 78–90 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, 46556, USA

    Danny Z. Chen

  2. Department of Computer Science, Utah State University, Logan, UT, 84322, USA

    Haitao Wang

Authors
  1. Danny Z. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haitao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Parallel Computing and Bioinformatics Laboratory, Carleton University, VISM Building, Room 6210, 1125 Colonel By Drive, K1S 5B6, Ottawa, ON, Canada

    Frank Dehne

  2. Department of Computer Science, The University of Western Ontario, N6A 5B7, London, ON, Canada

    Roberto Solis-Oba

  3. School of Computer Science, Carleton University, K1S 5B6, Ottawa, ON, Canada

    Jörg-Rüdiger Sack

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, D.Z., Wang, H. (2013). Visibility and Ray Shooting Queries in Polygonal Domains. In: Dehne, F., Solis-Oba, R., Sack, JR. (eds) Algorithms and Data Structures. WADS 2013. Lecture Notes in Computer Science, vol 8037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40104-6_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40104-6_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40103-9

  • Online ISBN: 978-3-642-40104-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation