Restricted-orientation convexity.
Convexity is generalized if the set of all lines is replaced by a smaller set of lines. The authors first treat the two-dimensional case. An orientation set \(O\) is a set of given lines through the origin, an \(O\)-line is a translate of a line in \(O\), and a set is \(O\)-convex if its intersection with every \(O\)-line is connected. Strongly \(O\)-convex sets are defined in the following manner. The \(O\)-block of two points is the intersection of all halfplanes whose boundaries are \(O\)-lines and which contain both points. A set is strongly \(O\)-convex if, for every two of its points, their \(O\)-block is contained in the set. In order to have this possibility also in higher dimensions, orientation sets are then defined in the following way: An orientation set \(O\) is a set of hyperplanes through the origin, an \(O\)-hyperplane is a translate of a hyperplane in \(O\), and an \(O\)-line is a line which is an intersection of \(O\)-hyperplanes. Many properties of \(O\)-convex and strongly \(O\)-convex sets are similar to properties of standard convex sets. For instance, a closed set with nonempty interior is strongly \(O\)-convex if and only if for every boundary point there is a strongly \(O\)-convex hyperplane through it supporting the set. But \(O\)-convex sets may be disconnected. This gives rise to the definition of \(O\)-connected sets. The presentation is elementary, except the chapter on computability where some knowledge on running time is assumed. There are references to applications, but those are not described in this booklet. It is the reviewer's impression that applications of restricted orientation convexity in three dimensions have still to be found.
- Contractibility of half-spaces of partial convexity
- On a conjecture of Fink and Wood
- Realization of abstract convex geometries by point configurations
- Restricted-oriented convex sets
- Generalized halfspaces in restricted-orientation convexity
- Fundamentals of restricted-orientation convexity
- Strong restricted-orientation convexity
- On the \(\mathcal{O}_\beta\)-hull of a planar point set
- Set-valued games and mixed-strategy equilibria in discounted supergames
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
- Properties of connected ortho-convex sets in the plane
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm
- Separating bichromatic point sets in the plane by restricted orientation convex hulls
- scientific article; zbMATH DE number 4062042 (Why is no real title available?)
- scientific article; zbMATH DE number 4067744 (Why is no real title available?)
- Integral geometry for the 1-norm
- Maximum rectilinear convex subsets
- The Non-Existence of Convex Configuration for a Given Set of Vertex-Norm in Two-Dimensional Space
- Shortcut hulls: vertex-restricted outer simplifications of polygons
- Characterization of polyhedron monotonicity
- The rectilinear convex hull of line segments
- Rectilinear convex hull of points in 3D and applications
- Orientation of convex sets
- On the Erdős-Szekeres problem for convex permutations and orthogonally convex point sets
- Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles
- An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
This page was built for publication: Restricted-orientation convexity.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428352)
