Improved bounds for geometric permutations

From MaRDI portal
Publication:2903522

DOI10.1137/110835918zbMATH Open1255.52008arXiv1007.3244OpenAlexW2570601084MaRDI QIDQ2903522FDOQ2903522


Authors: Natan Rubin, Micha Sharir Edit this on Wikidata


Publication date: 10 August 2012

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

Abstract: We show that the number of geometric permutations of an arbitrary collection of n pairwise disjoint convex sets in mathbbRd, for dgeq3, is O(n2d3logn), improving Wenger's 20 years old bound of O(n2d2).


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




Recommendations





Cited In (15)





This page was built for publication: Improved bounds for geometric permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2903522)