Representing orders on the plane by translating points and lines
One of the most important problems in computational geometry is the separability problem (robot motion without collisions and screen clearing in computer science graphics are instances of the above). \textit{I. Rival} and \textit{J. Urrutia} [Order 4, No.4, 319-339 (1988; Zbl 0663.06004)] have initiated a study of this problem using the theory of ordered sets. In the mentioned paper they introduce the ``blocking relation on a collection of disjoint convex figures in the plane (each assigned to one of the m, fixed, directions), which is an order, and define the m- directional representation of a poset P. This study is dedicated to the representation of orders by ``special blocking relations (i.e.: particular convex figures - points, lines, segments, and limited - one or two - directions). Four theorems are proved, from which we mention here only one: Every interval order is a line blocking relation requiring at most two directions.
- Representing orders on the plane by translating convex figures
- Line directionality of orders
- On the directionality of interval orders
- Obituary: Ivan Rival
- Motion Planning,Two-Directional Point Representation, and Ordered Sets
- scientific article; zbMATH DE number 1163414 (Why is no real title available?)
- scientific article; zbMATH DE number 221692 (Why is no real title available?)
- Separability, boxicity, and partial orders
- Representing orders by moving figures in space
- Convex blocking and partial orders on the plane
This page was built for publication: Representing orders on the plane by translating points and lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q921023)
