scientific article; zbMATH DE number 4062042
[For the entire collection see Zbl 0642.00022.] A polygon is said to be ortho-convex if its intersection with any horizontal or vertical line is convex. The authors give characterizations of ortho-convexity in terms of appropriately defined hulls, separation properties and ``segmential convexity. Some of these concepts and results are extended to the more general setting of O-convexity, defined as the natural generalization of ortho-convexity corresponding to an arbitrary class of orientations O. A decomposition theorem for O-hulls, where \(O=O_ 1\cup O_ 2\), is proved. Finally, the authors observe that the class of all O-convex sets, for given O, defines a convexity space. Some possible directions for future reseach are also suggested.
- On a conjecture of Fink and Wood
- Restricted-oriented convex sets
- Geodesic convexity in discrete spaces
- Fundamentals of restricted-orientation convexity
- Visibility in semi-convex spaces
- On finding an empty staircase polygon of largest area (width) in a planar point-set
- On the \(\mathcal{O}_\beta\)-hull of a planar point set
- Maximal empty coboids among points and blocks
- Staircase visibility and computation of kernels
- Properties of connected ortho-convex sets in the plane
- Separating bichromatic point sets in the plane by restricted orientation convex hulls
- About convexity of polygons
- scientific article; zbMATH DE number 5139143 (Why is no real title available?)
- scientific article; zbMATH DE number 4067744 (Why is no real title available?)
- scientific article; zbMATH DE number 16594 (Why is no real title available?)
- On k-convex polygons
- scientific article; zbMATH DE number 2067040 (Why is no real title available?)
- Maximum rectilinear convex subsets
- Partial convexity
- Reconstructing orthogonal polyhedra from putative vertex sets
- The rectilinear convex hull of line segments
- Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles
- Exact solutions to the weighted region problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796310)