Skip to main content
SpringerLink
Log in

Weak Visibility Queries of Line Segments in Simple Polygons

  • Conference paper
Algorithms and Computation (ISAAC 2012)

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

Included in the following conference series:

Abstract

Given a simple polygon in the plane, we study the problem of computing the weak visibility polygon from any query line segment in the polygon. This is a basic problem in computational geometry and has been studied extensively before. In this paper, 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. 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 

  2. Bentley, J., Ottmann, T.: Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers 28(9), 643–647 (1979)

    Article  MATH  Google Scholar 

  3. de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry — Algorithms and Applications, 3rd edn. Springer, Berlin (2008)

    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. Bygi, M., Ghodsi, M.: Weak visibility queries in simple polygons. In: Proc. of the 23rd Canadian Conference on Computational Geometry, CCCG (2011)

    Google Scholar 

  6. Chazelle, B., Edelsbrunner, H.: An optimal algorithm for intersecting line segments in the plane. Journal of the ACM 39(1), 1–54 (1992)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Edelsbrunner, H., Guibas, L., Pach, J., Pollack, R., Seidel, R., Sharir, M.: Arrangements of curves in the plane topology, combinatorics, and algorithms. Theoretical Computer Science 92(2), 319–336 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  9. Edelsbrunner, H., Guibas, L., Stolfi, J.: Optimal point location in a monotone subdivision. SIAM Journal on Computing 15(2), 317–340 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  10. 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 

  11. Hart, S., Sharir, M.: Nonlinearity of Davenport–Schinzel sequences and of generalized path compression schemes. Combinatorica 6(2), 151–177 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hershberger, J.: An optimal visibility graph algorithm for triangulated simple polygons. Algorithmica 4, 141–155 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  13. 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 

  14. Kirkpatrick, D.: Optimal search in planar subdivisions. SIAM Journal on Computing 12(1), 28–35 (1983)

    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. Department of Computer Science and Information Engineering, National Taiwan University, 1 Roosevelt Road, Section 4, 106, Taipei, Taiwan

    Kun-Mao Chao

  2. Institute of Information Science, Academia Sinica, 128 Academia Road, Section 2, 115, Taipei, Taiwan

    Tsan-sheng Hsu

  3. Department of Computer Science and Engineering, National Chung Hsing University, 250 Kuo Kuang Road, 402, Taichung, Taiwan

    Der-Tsai Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, D.Z., Wang, H. (2012). Weak Visibility Queries of Line Segments in Simple Polygons. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35261-4_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35260-7

  • Online ISBN: 978-3-642-35261-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation