Worst-case optimal algorithms for constructing visibility polygons with holes

Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986

Volumn , Issue , 1986, Pages 14-23

  Suri, Subhash ^a   O'Rourke, Joseph ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85041675959     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/10515.10517     Document Type: Conference Paper

References (12)

1. T. Asano, T. Asano, L. Guibas, J. Hershberger & H. Imai. "Visibility Polygon Search and Euclidean Shortest Paths, " Proc. S6th FOCS, 1985, pp. 155-164.
2. B. Chazelle, "Intersecting Is Easier Than Sorting, " 16th STOC (1984), pp. 125, 134.
3. B. Chazelle and L. J. Guibas. "Visibility and Intersection Problems in Plane Geometry, " Sym-poiium on Computational Geometry, pp. 135-146 (1985).
4. H. El Gindy and D. Avis. "A Linear Algorithm for Computing the Visibility Polygon from a Point, " Journal of Algorithm, g, pp. 186-197 (1981).
5. H. El Gindy. "An Efficient Algorithm for Computing the Weak Visibility Polygon from an Edge in Simple Polygons, " Technical Report, School of Computer Science, McGill University, (Jan. 1984).
6. E. Grosswald. Topic From The Theory Of Numbers, Macmillan, New York, 1966.
7. L. Guibas, J. Hersberger, D. Leven, M. Sharir, R. Tarjan, "Linear Time Algorithms for Visibility and Shortest Path Problems inside Simple Polygons, " these Proceedings, June 1986.
8. H. Imai, T. Asano & T. Asano. "Visibility of Disjoint Polygons, " Technical Report, Dept. of Math. Engineering and Instrumentation Physics, Faculty of Enginnering, University of Tokyo, Tokyo, Japan 113 (1985).
9. D. T. Lee and A. Lin. "Computing Visibility Polygon from an Edge, " Technical Report, Department of Electrical Engineering and Computer Science, Northwestern University, (Jan. 1984).
10. M. McKenna. "Worst-Case Optimal Hidden Surface Removal", Technical Report, The Johns Hopkins University, (March, 1986).
11. S. Suri and J. O'Rourke. "Worst-Case Optimal Algorithms For Constructing Visibility Polygons With Holes, " Technical Report, The Johns Hopkins University, (August 1985).
12. Emo Welzl. "Constructing The Visibility Graph For n Line Segments In O(n2) Time, " Information Processing Letters, Volume 20, Number 4, 10 May, 1985.