Fundamentals of Restricted-orientation Convexity Fundamentals of Restricted-orientation Convexity

A restricted-orientation convex set, also called an O-convex set, is a set of points whose intersection with lines from some xed set is empty or connected. The notion of O-convexity generalizes standard convexity and orthogonal convexity. We explore some of the basic properties of O-convex sets in two and higher dimensions. We also study O-connected sets, which are restricted O-convex sets with several special properties. We introduce and investigate restricted-orientation analogs of lines, ats, and hy-perplanes, and characterize O-convex and O-connected sets in terms of their intersections with hyperplanes. We then explore properties of O-connected curves; in particular, we show when replacing a segment of an O-connected curve with a new curvilinear segment yields an O-connected curve and when the catenation of several curvilinear segments forms an O-connected segment. We use these results to characterize an O-connected set in terms of O-connected segments that join pairs of its points, which are wholly contained in the set. We also identify some of the major properties of standard convex sets that hold for O-convexity. Abstract A restricted-orientation convex set, also called an O-convex set, is a set of points whose intersection with lines from some xed set is empty or connected. The notion of O-convexity generalizes standard convexity and orthogonal convexity. We explore some of the basic properties of O-convex sets in two and higher dimensions. We also study O-connected sets, which are restricted O-convex sets with several special properties. We introduce and investigate restricted-orientation analogs of lines, ats, and hyperplanes, and characterize O-convex and O-connected sets in terms of their intersections with hyperplanes. We then explore properties of O-connected curves; in particular, we show when replacing a segment of an O-connected curve with a new curvilinear segment yields an O-connected curve and when the catenation of several curvilinear segments forms an O-connected segment. We use these results to characterize an O-connected set in terms of O-connected segments that join pairs of its points, which are wholly contained in the set. We also identify some of the major properties of standard convex sets that hold for O-convexity.

[1]  Ralf Hartmut Güting,et al.  Dynamic C-Oriented Polygonal Intersections Searching , 1986, Inf. Control..

[2]  G. C. Shephard,et al.  Convex Polytopes , 1969, The Mathematical Gazette.

[3]  Sven Schuierer,et al.  On generalized visibility , 1991 .

[4]  Ralf Hartmut Güting Conquering contours - efficient algorithms for computational geometry , 1983 .

[5]  P. Kelly,et al.  Geometry and Convexity: A Study in Mathematical Methods , 1979 .

[6]  Derick Wood,et al.  Optimal Computation of Finitely Oriented Convex Hulls , 1987, Inf. Comput..

[7]  Christos H. Papadimitriou,et al.  A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems , 1981, J. Algorithms.

[8]  Derick Wood,et al.  Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles , 1984, J. Algorithms.

[9]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[10]  Ralf Hartmut Güting,et al.  Stabbing C-Oriented Polygons , 1983, Inf. Process. Lett..

[11]  Derick Wood,et al.  Ortho-Convexity and its Generalizations , 1988 .

[12]  Derick Wood,et al.  Three-dimensional strong convexity and visibility , 1995, Optics & Photonics.

[13]  Chak-Kuen Wong,et al.  On Some Distance Problems in Fixed Orientations , 1987, SIAM J. Comput..

[14]  Marvin Marcus,et al.  A Convex Set , 1993, SIAM Rev..

[15]  Gregory J. E. Rawlins,et al.  A decomposition theorem for convexity spaces , 1989 .