Planar strong visibility

International Journal of Computational Geometry and Applications

Volumn 13, Issue 2, 2003, Pages 173-187

  Fink, Eugene ^a   Wood, Derick ^b  

^a UNIVERSITY OF SOUTH FLORIDA   (United States)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Convexity; Generalized visibility; Restricted orientations

Indexed keywords

EID: 0037691508     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195903001116     Document Type: Article

References (28)

1. n-sets, the Hausdorff metric, and connectedness. Proceedings of the American Mathematical Society, 13:765-767, 1962.
2. Eugene Fink and Derick Wood. Fundamentals of restricted-orientation convexity. Information Sciences, 92:175-196, 1997.
3. Eugene Fink and Derick Wood. Generalized halfspaces in restricted-orientation convexity. Journal of Geometry, 62:99-120, 1998.
4. Eugene Fink and Derick Wood. Strong restricted-orientation convexity. Geometriae Dedicata, 69:35-51, 1998.
5. Ronald L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1:132-133, 1972.
6. Branko Grünbaum, Victor Klee, M. A. Perles, and G. C. Shephard. Convex Polytopes. John Wiley and Sons, New York, NY, 1967.
7. Ralf Hartmut Güting. Conquering Contours: Efficient Algorithms for Computational Geometry. PhD thesis, Fachbereich Informatik, Universitat Dortmund, 1983.
8. Ralf Hartmut Güting. Stabbing C-oriented polygons. Information Processing Letters, 16:35-40, 1983.
9. Ralf Hartmut Güting. Dynamic C-oriented polygonal intersection searching. Information and Control, 63:143-163, 1984.
10. Der-Tsai Lee and I. M. Chen. Display of visible edges of a set of convex polygons. In Godfried T. Toussaint, editor, Computational Geometry, pages 249-265. North-Holland Publishing Co., Amsterdam, Netherlands, 1985.
11. Der-Tsai Lee and Franco P. Preparata. An optimal algorithm for finding the kernel of a polygon. Journal of the ACM, 26:415-421, 1979.
12. Witold Lipski and Christos H. Papadimitriou. A fast algorithm for testing for safety and detecting deadlock in locked transaction systems. Journal of Algorithms, 2:211-226, 1981.
13. V. Martynchik, Nikolai Metelski, and Derick Wood. O-convexity: Computing hulls, approximations, and orientation sets. In Proceedings of the Eighth Canadian Conference on Computational Geometry, pages 2-7, 1996.
14. Duncan McCallum and David Avis. A linear algorithm for finding the convex hull of a simple polygon. Information Processing Letters, 9:201-206, 1979.
15. D. Y. Montuno and Alain Fournier. Finding the x-y convex hull of a set of x-y polygons. Technical Report 148, Department of Computer Science, University of Toronto, 1982.
16. J. Ian Munro, Mark H. Overmars, and Derick Wood. Variations of visibility. In Proceedings of the Third Annual Symposium on Computational Geometry, pages 291-299, 1987.
17. Tina M. Nicholl, Der-Tsai Lee, Y. Z. Liao, and Chak-Kuen Wong. Constructing the X-Y convex hull of a set of X-Y polygons. BIT, 23:456-471, 1983.
18. Thomas Ottmann, Eljas Soisalon-Soininen, and Derick Wood. On the definition and computation of rectilinear convex hulls. Information Sciences, 33:157-171, 1984.
19. Franco P. Preparata and Michael I. Shamos. Computational Geometry. Springer-Verlag, New York, NY, 1985.
20. Gregory J. E. Rawlins. Explorations in Restricted-Orientation Geometry. PhD thesis, School of Computer Science, University of Waterloo, 1987. Technical Report cs-87-57.
21. Gregory J. E. Rawlins, Sven Schuierer, and Derick Wood. Convexity, visibility, and orthogonal polygons. In Prabir Bhattacharya, Robert A. Melter, and Azriel Rosenfeld, editors, Vision Geometry, Contemporary Mathematics 119, pages 225-237. American Mathematical Society, Providence, RI, 1991.
22. Gregory J. E. Rawlins and Derick Wood. Optimal computation of finitely oriented convex hulls. Information and Computation, 72:150-166, 1987.
23. Gregory J. E. Rawlins and Derick Wood. Ortho-convexity and its generalizations. In Godfried T. Toussaint, editor, Computational Morphology, pages 137-152. Elsevier Science Publishers B. V., North-Holland, Amsterdam, Netherlands, 1988.
24. Gregory J. E. Rawlins and Derick Wood. Restricted-orientation convex sets. Information Sciences, 54:263-281, 1991.
25. Sven Schuierer. On Generalized Visibility. PhD thesis, Institut für Informatik, Universität Freiburg, 1991.
26. Eljas Soisalon-Soininen and Derick Wood. Optimal algorithms to compute the closure of a set of iso-rectangles. Journal of Algorithms, 5:199-214, 1984.
27. n-sets. Proceedings of the American Mathematical Society, 16:1305-1310, 1965.
28. Peter Widmayer, Ying-Fung Wu, and Chak-Kuen Wong. On some distance problems in fixed orientations. SIAM Journal on Computing, 16:728-746, 1987.