We continue the investigation of computational aspects of restricted-orientation convexity (O-convexity) in two dimensions. We introduce one notion of an O-halfplane, for a set O of orientations, and we investigate O-connected convexity. The O-connected convex hull of a nite set X can be computed in time O(jXj log jXj + jOj). The O-connected hull is a basis for determining the O-convex hull of a nite set X and a nite set O of orientations in time O(jXjjOj log jXj). We also consider two new problems. First, we give an algorithm to determine a minimum-area O-connected convex outer approximation of an O-polygon with n vertices when the number r of O-halfplanes forming the approximation is given. The approximation can be determined in time O(n 2 r+ jOj). Second, we give an algorithm to nd the largest orientation set for a simple polygon. This problem can be solved in time O(n log n), where n is the number of vertices of the polygon. For each of these complexity bounds we assume that O is sorted. Abstract We continue the investigation of computational aspects of restricted-orientation convexity (O-convexity) in two dimensions. We introduce one notion of an O-halfplane, for a set O of orientations, and we investigate O-connected convexity. The O-connected convex hull of a nite set X can be computed in time O(j X j log j X j + j O j). The O-connected hull is a basis for determining the O-convex hull of a nite set X and a nite set O of orientations in time O(jXjjOj log jXj). We also consider two new problems. First, we give an algorithm to determine a minimum-area O-connected convex outer approximation of an O-polygon with n vertices when the number r of O-halfplanes forming the approximation is given. The approximation can be determined in time O(n 2 r+ jOj). Second, we give an algorithm to nd the largest orientation set for a simple polygon. This problem can be solved in time O(n logn), where n is the number of vertices of the polygon. For each of these complexity bounds we assume that O is sorted.
[1]
Derick Wood,et al.
Fundamentals of Restricted-Orientation Convexity
,
1996,
Inf. Sci..
[2]
Derick Wood,et al.
Optimal Computation of Finitely Oriented Convex Hulls
,
1987,
Inf. Comput..
[3]
Derick Wood,et al.
An Isothetic View of Computational Geometry† †Work carried out under a Natural Sciences and Engineering Research Council of Canada Grant No. A-5692.
,
1985
.
[4]
Derick Wood,et al.
Ortho-Convexity and its Generalizations
,
1988
.
[5]
Derick Wood,et al.
On the Definition and Computation of Rectlinear Convex Hulls
,
1984,
Inf. Sci..
[6]
Sven Schuierer,et al.
On generalized visibility
,
1991
.
[7]
Derick Wood,et al.
Generalized halfspaces in restricted-orientation convexity
,
1998
.
[8]
Ralf Hartmut Güting,et al.
Stabbing C-Oriented Polygons
,
1983,
Inf. Process. Lett..
[9]
Derick Wood,et al.
Restricted-oriented convex sets
,
1991,
Inf. Sci..
[10]
Gregory J. E. Rawlins,et al.
A decomposition theorem for convexity spaces
,
1989
.