Fundamentals of restricted-orientation convexity

Information Sciences

Volumn 92, Issue 1-4, 1996, Pages 175-196

  Fink, Eugene ^a   Wood, Derick ^b  

^a Carnegie Mellon University ^*  (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; SET THEORY;

CONNECTED CURVES; CURVILINEAR SEGMENT; ORTHOGONAL CONVEXITY; RESTRICTED ORIENTATION ANALOGS; RESTRICTED ORIENTATION CONVEX SET; STANDARD CONVEXITY;

COMPUTATIONAL GEOMETRY;

EID: 0030192694     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0255(96)00056-4     Document Type: Article

References (24)

1. n-sets, the Hausdorff metric, and connectedness, Proc. Amer. Math. Soc., 13:765-767 (1962).
2. E. Fink and D. Wood, Generalized halfspaces in restricted-orientation convexity, unpublished, 1995.
3. E. Fink and D. Wood, Strong restricted-orientation convexity, unpublished, 1995.
4. E. Fink and D. Wood, Three-dimensional strong convexity and visibility, in Proceedings of the Vision Geometry IV Conference, 1995.
5. B. Grünbaum, V. Klee, M. A. Perles, and G. C. Shephard, Convex Polytopes, Wiley & Sons, New York, 1967.
6. R. H. Güting, Conquering contours: Efficient algorithms for computational geometry, Ph.D. thesis, Universitat Dortmund, Germany, 1983.
7. R. H. Güting, Stabbing C-oriented polygons, Inform. Process. Lett. 16:35-40 (1983).
8. R. H. Güting, Dynamic C-oriented polygonal intersection searching, Inform. and Control 63:143-163 (1984).
9. P. J. Kelly and M. L. Weiss, Geometry and Convexity: A Study in Mathematical Methods, Wiley & Sons, New York, 1978.
10. V. Klee, What is a convex set?, Amer. Math. Monthly 78:616-631 (1971).
11. W. Lipski and C. H. Papadimitriou, A fast algorithm for testing for safety and detecting deadlock in locked transaction systems, J. Algorithms 2:211-226 (1981).
12. D. Y. Montuno and A. Fournier, Finding the x-y convex hull of a set of x-y polygons, Tech. Rep. 148, University of Toronto, Toronto, Ontario, 1982.
13. T. M. Nicholl, D. T. Lee, Y. Z. Liao, and C. K. Wong, Constructing the X-Y convex hull of a set of X-Y polygons, BIT 23:456-471 (1983).
14. T. Ottmann, E. Soisalon-Soininen, and D. Wood, On the definition and computation of rectilinear convex hulls, Inform. Sci. 33:157-171 (1984).
15. F. P. Preparata and M. I. Shamos, Computational Geometry, Springer-Verlag, New York, 1985.
16. G. J. E. Rawlins, Explorations in restricted-orientation geometry. Ph.D. thesis. University of Waterloo, 1987; Tech. Rep. CS-89-48.
17. G. J. E. Rawlins and D. Wood, Optimal computation of finitely oriented convex hulls, Inform. and Comput. 72:150-166 (1987).
18. G. J. E. Rawlins and D. Wood, Ortho-convexity and its generalizations, in G. T. Toussaint, ed., Computational Morphology, Elsevier Science Publishers B.V., North-Holland, 1988, pp. 137-152.
19. G. J. E. Rawlins and D. Wood, A decomposition theory for convexity spaces, J. Geom. 36:143-159 (1989).
20. G. J. E. Rawlins and D. Wood, Restricted-orientation convex sets, Inform. Sci. 54:263-281 (1991).
21. S. Schuierer, On generalized visibility, Ph.D. thesis, Universität Freiburg, Germany, 1991.
22. E. Soisalon-Soininen and D. Wood, Optimal algorithms to compute the closure of a set of iso-rectangles, J. Algorithms 5:199-214 (1984).
23. n-sets, Proc. Amer. Math. Soc. 16:1305-1310 (1965).
24. P. Widmayer, Y. F. Wu, and C. K. Wong, On some distance problems in fixed orientations, SIAM J. Comput. 16:728-746 (1987).