Determining sector visibility of a polygon

Proceedings of the Annual Symposium on Computational Geometry

Volumn Part F130124, Issue , 1989, Pages 247-254

  Bhattacharya, B ^a   Kirkpatrick, D G ^b   Toussaint, G T ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; GEOMETRY;

MONOTONICITY; SIGHT LINES; SIMPLE POLYGON;

VISIBILITY;

EID: 0346928759     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73833.73860     Document Type: Conference Paper

References (24)

1. Atallah, M. and Bajaj, C., "Efficient algorithms for common transversals, ", Injormation Processing Letters, Vol. 25, May 1987, pp. 87-91
2. Avis, D. and Wenger, R., "Algorithms for line stabbers in space, ", Proc. 8rd ACM Symposium on Computational Geometry, 1987, pp. 300-307
3. Avis, D. and Wenger, R., "Polyhedral liue transversals in space, ", Discrete and Computational Geometry, to appear
4. Avis, A. and Touasaint, G.T., "An optimal algorithm for determining the visibility of a polygon from an edge, " IEEE Transactions on Computers, Vol. C-30, No. 12, December 1981, pp. 910-914
5. Bajaj, C. and Li, M., "On the duality of intersection and closest points, " Proc. Mat Allerton Conference, 1983, pp. 459-461
6. M. Ben-Or, Lower bounds for algebraic computation trees, Proc. 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 80-86
7. Edelsbrunner, H., "Finding transversals for sets of simple geometric figures, ", Theoretical Computer Science, Vol. 35, 1985, pp 5549
8. Edelsbrunner, H., Overmarks, M.H., and Wood, D., "Graphics in flatland: A case study, " Tech. Report F79, Technical University of Gras, 1981
9. ElGindy, H., "Hierarchical decomposition of polygons with applications, " Ph.D. Thesis, School of Computer Science, McGill University, May 1985
10. Edelsbrunner, H., Maurer, H.A., Preparata; F.P., Rosenberg, A.L., Welsl, E and Wood, D., "Stabbing line segments, ", BIT, Vol. 22, 1982, pp. 274-281
11. ElGindy, H. and Toussaint, G.T., "Efficient algorithms for inserting and deleting edges from triangulations, " Proc. Intl. Conf. on Foundations of Data Organization, Kyoto, Japan, May 1985
12. Grunbaum, B., "On common transversals, " Arch. Math., Vol. 9, 1958, pp. 465469
13. Horn, A. and Valentine, F.A., "Some propertiea of L-sets in the plane, " Duke Mathematics Journal, Vol. 16, 1949, pp. 131-140
14. Ke, Y., "Detecting the weak visibility of a simple polygon and related problems, " The Johns Hopkins University, manuscript, March 1988
15. Lewis, T., "Two counterexamples concerning transversals for convex subsets of the plane, " Geometriae Dedicata, Vol. 9, 1980, pp. 461.465
16. McCallum, D. and Avis, D., "A linear time algorithm for finding the convex hull of a simple polygon, " Information Processing Letters, Vol. 8, pp. 201-205
17. Mansouri, M. and Toussaint, G.T., "On the reachability of a ladder in two convex polygons, " Ptoc. 18th IFIP Conf. on Syatem Model and Optimization, Tokyo, Japan, August 1987
18. ORourke, J., "An on-line algorithm for fitting straight lines between data ranges, " Cornmunications of the ACM, Vol. 24, No. 9, September 1981, pp. 574578
19. Reichling, M., "On the detection of a common intersection of k convex objects in the plane, " Information Processing Letters, Vol 29, September 1988, pp. 25-29
20. Rosenfeld, B.A. and Sergeeva, N.D., Stereographic Projection, Mir Publishers, Moscow, 1977
21. Sack, J.-R. and Suri, S., "An optimal algorithm for detecting weak visibility of a polygon, " Tech. Report SCS-TR114, Carleton University, Ottawa, Canada, Dec. 1986
22. Shermer, T. and Touasaint, G.T., "Characterirations of convex and star-shaped polygons, " in Snapshots of Computational and Discrete Geometry, G. Toussaint, editor, Tech. Report SOCS-88.11, School of Computer Science, McGill University, June 1988
23. Toussaint, G.T. and Avis, D., "On a convex hull algorithm for polygons and its application to triangulation problems, " Pattern Recognition, Vol. 15, No. 1, 19892, pp. 23-29
24. Toussaint, G.T., "Complexity, convexity, and unimodality, " International Journal of Computer and Information Sciences, Vol. 13, No 3, June 1984, pp. 197-217