Article,

Geometric Containment Orders: A Survey

, and .
Order, 15 (2): 167--182 (Jun 1, 1998)
DOI: 10.1023/A:1006110326269

Abstract

A partially ordered set (X, ≺) is a geometric containment order of a particular type if there is a mapping from X into similarly shaped objects in a finite-dimensional Euclidean space that preserves ≺ by proper inclusion. This survey describes most of what is presently known about geometric containment orders. Highlighted shapes include angular regions, convex polygons and circles in the plane, and spheres of all dimensions. Containment orders are also related to incidence orders for vertices, edges and faces of graphs, hypergraphs, planar graphs and convex polytopes. Three measures of poset complexity are featured: order dimension, crossing number, and degrees of freedom.

Tags

Users

  • @duerrschnabel

Comments and Reviews