Improved Bounds for Geometric Permutations

DOI10.1137/110835918zbMath1255.52008arXiv1007.3244OpenAlexW2570601084MaRDI QIDQ2903522

Natan Rubin, Micha Sharir

Publication date: 10 August 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.3244

zbMATH Keywords

combinatorial complexitygeometric permutationsgeneral positionarrangements of great circles on a sphere

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (3) dimensions (including convex surfaces) (52A15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Combinatorial complexity of geometric structures (52C45)

Related Items

Geometric permutations of non-overlapping unit balls revisited ⋮ Unnamed Item