On neighbors in geometric permutations.

DOI10.1016/S0012-365X(03)00052-9zbMath1042.52004OpenAlexW1991624414MaRDI QIDQ1398279

Shakhar Smorodinsky, Micha Sharir

Publication date: 29 July 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00052-9

zbMATH Keywords

geometric permutationsline transversals

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other problems of combinatorial convexity (52A37) Convex sets in (2) dimensions (including convex curves) (52A10) Helly-type theorems and geometric transversal theory (52A35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Combinatorial complexity of geometric structures (52C45)

Related Items (7)

Dynamic conflict-free colorings in the plane ⋮ Graph unique-maximum and conflict-free colorings ⋮ Suballowable sequences and geometric permutations ⋮ Some Discrete Properties of the Space of Line Transversals to Disjoint Balls ⋮ Hitting sets online and unique-MAX coloring ⋮ Unnamed Item ⋮ Dynamic Conflict-Free Colorings in the Plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds on geometric permutations for convex sets
• The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
• Geometric permutations and common transversals
• The different ways of stabbing disjoint convex sets
• Quasi-planar graphs have a linear number of edges
• A constant bound for geometric permutations of disjoint unit balls
• Sharp bounds on geometric permutations of pairwise disjoint balls in \(\mathbb{R}^d\)
• Hadwiger's Transversal Theorem In Higher Dimensions
• The Partition Technique for Overlays of Envelopes
• A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{\reals^d}$}

This page was built for publication: On neighbors in geometric permutations.