Advertisement

An optimal algorithm for computing visibility in the plane

  • Paul J. Heffernan
  • Joseph S. B. Mitchell
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 519)

Abstract

We give an algorithm to compute the visibility polygon from a point among a set of h pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm uses O(n) space and runs in optimal time Θ(n+hlog h), improving the previous upper bound of O(n log h).

Keywords

Computational Geometry Jordan Curve Simple Polygon Left Endpoint Polygonal Chain 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AM]
    E. Arkin and J.S.B. Mitchell, “An Optimal Visibility Algorithm for a Simple Polygon With Star-Shaped Holes”, Technical Report No. 746 School of Operations Research and Industrial Engineering, Cornell University, June, 1987.Google Scholar
  2. [AAGHI]
    T. Asano, T. Asano, L. Guibas, J. Hershberger, and H. Imai, “Visibility of Disjoint Polygons”, Algorithmica, Vol. 1, (1986), pp. 49–63.Google Scholar
  3. [BC]
    R. Bar-Yehuda and B. Chazelle, private communication, 1991.Google Scholar
  4. [BG]
    R. Bar-Yehuda and R. Grinwald, “An O(N+N 1+∈)-Time Algorithm to Merge H Simple Polygons”, Technical Report 657, Computer Science Dept., Technion, 1990.Google Scholar
  5. [Ch]
    B. Chazelle, “Triangulating a Simple Polygon in Linear Time”, CS-TR-264-90, Princeton Univ., May 1990.Google Scholar
  6. [CTV]
    K. Clarkson, R.E. Tarjan, C. Van Wyk, “A Fast Las Vegas Algorithm for Triangulating a Simple Polygon”, Proc. Fourth Annual ACM Symposium on Computational Geometry, pp. 18–22, 1988. Also Princeton Technical Report CS-TR-157-88.Google Scholar
  7. [EA]
    H.A. El Gindy and D. Avis, “A Linear Algorithm for Computing the Visibility Polygon From a Point”, Journal of Algorithms, Vol. 2 (1981), pp. 186–197.Google Scholar
  8. [HM]
    P.J. Heffernan and J.S.B. Mitchell, “An Optimal Algorithm for Computing Visibility in the Plane”, Technical Report No. 953, School of Operations Research and Industrial Engineering, Cornell University, 1990.Google Scholar
  9. [JS]
    B. Joe and R.B. Simpson, “Correction to Lee's Visibility Polygon Algorithm”, BIT, 27 (1987), pp. 458–473.Google Scholar
  10. [Ki]
    D.G. Kirkpatrick, “Optimal Search in Planar Subdivisions”, SIAM Journal on Computing, 12 (1983), No. 1, pp. 28–35.Google Scholar
  11. [KKT]
    D.G. Kirkpatrick, M.M. Klawe, and R.E. Tarjan, “Polygon Triangulation in O(n log log n) Time with Simple Data-Structures”, Proc. Sixth Annual ACM Symposium on Computational Geometry, Berkeley, CA, June 6–8, 1990, pp. 34–43.Google Scholar
  12. [Le1]
    D.T. Lee, “Proximity and Reachability in the Plane”, Ph.D. Thesis, Report R-831, Dept. of Electrical Engineering, University of Illinois at Urbana-Champaign, Nov. 1978.Google Scholar
  13. [Le2]
    D.T. Lee, “Visibility of a Simple Polygon”, Computer Vision, Graphics, and Image Processing, Vol. 22 (1983), pp. 207–221.Google Scholar
  14. [O'R]
    J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, 1987.Google Scholar
  15. [Se]
    R. Seidel, “A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons”, Manuscript, October, 1990.Google Scholar
  16. [Sh]
    M. Sharir, “Davenport-Schinzel Sequences and their Geometric Applications”, pp 253–278, NATO ASI Series, Vol. F40, Theoretical Foundations of Computer Graphics and CAD, R.A. Earnshaw (Ed.), Springer-Verlag Berlin Heidelberg, 1988.Google Scholar
  17. [SO]
    S. Suri and J. O'Rourke, “Worst-Case Optimal Algorithms For Constructing Visibility Polygons With Holes”, Proc. Second Annual ACM Symposium on Computational Geometry, Yorktown Heights, NY, June 1986, pp. 14–23.Google Scholar
  18. [TV]
    R.E. Tarjan and C. Van Wyk, “An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon”, SIAM Journal on Computing, 17 (1988), No. 1, pp. 143–178.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Paul J. Heffernan
    • 1
  • Joseph S. B. Mitchell
    • 1
  1. 1.School of Operations Research and Industrial Engineering Engineering & Theory CenterCornell UniversityIthaca

Personalised recommendations