The combinatorial encoding of disjoint convex sets in the plane

DOI10.1007/s00493-008-2239-7zbMath1174.52001OpenAlexW1994263951MaRDI QIDQ949781

Jacob E. Goodman, Richard Pollack

Publication date: 21 October 2008

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-008-2239-7

zbMATH Keywords

geometric permutationpseudoline arrangementdouble-permutation sequenceplanar convex sets

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Helly-type theorems and geometric transversal theory (52A35) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items

Realization spaces of arrangements of convex bodies ⋮ LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies ⋮ Allowable interval sequences and line transversals in the plane ⋮ A farewell to Ricky Pollack ⋮ Allowable interval sequences and separating convex sets in the plane ⋮ Arrangements of pseudocircles and circles ⋮ On the number of directions determined by the common tangents to a family of pairwise disjoint convex sets in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
• Proof of a conjecture of Burr, Grünbaum, and Sloane
• On the combinatorial classification of nondegenerate configurations in the plane
• Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines
• Geometric permutations for convex sets
• Oriented Matroids
• Arrangements and Topological Planes
• On the number of balanced lines