Improved bounds for geometric permutations

Natan Rubin; Haim Kaplan; Micha Sharir

doi:10.1137/110835918

Improved bounds for geometric permutations

Natan Rubin, Haim Kaplan, Micha Sharir

School of Computer Science

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

We show that the number of geometric permutations of an arbitrary collection of n pairwise disjoint convex sets in Rd, for d = 3, is O(n2d-3 log n), improving Wenger's 20-year-old bound of O(n2d-2).

Original language	American English
Pages (from-to)	367-390
Number of pages	24
Journal	SIAM Journal on Computing
Volume	41
Issue number	2
DOIs	https://doi.org/10.1137/110835918
State	Published - 4 Jun 2012

Keywords

Combinatorial complexity
Convex sets
Geometric permutations
Line transversals
Lines in space

All Science Journal Classification (ASJC) codes

General Computer Science
General Mathematics

Access to Document

10.1137/110835918

Cite this

@article{62c25ff5b76f40e48173c825df026fad,

title = "Improved bounds for geometric permutations",

abstract = "We show that the number of geometric permutations of an arbitrary collection of n pairwise disjoint convex sets in Rd, for d = 3, is O(n2d-3 log n), improving Wenger's 20-year-old bound of O(n2d-2).",

keywords = "Combinatorial complexity, Convex sets, Geometric permutations, Line transversals, Lines in space",

author = "Natan Rubin and Haim Kaplan and Micha Sharir",

year = "2012",

month = jun,

day = "4",

doi = "10.1137/110835918",

language = "American English",

volume = "41",

pages = "367--390",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - Improved bounds for geometric permutations

AU - Rubin, Natan

AU - Kaplan, Haim

AU - Sharir, Micha

PY - 2012/6/4

Y1 - 2012/6/4

N2 - We show that the number of geometric permutations of an arbitrary collection of n pairwise disjoint convex sets in Rd, for d = 3, is O(n2d-3 log n), improving Wenger's 20-year-old bound of O(n2d-2).

AB - We show that the number of geometric permutations of an arbitrary collection of n pairwise disjoint convex sets in Rd, for d = 3, is O(n2d-3 log n), improving Wenger's 20-year-old bound of O(n2d-2).

KW - Combinatorial complexity

KW - Convex sets

KW - Geometric permutations

KW - Line transversals

KW - Lines in space

UR - http://www.scopus.com/inward/record.url?scp=84861610122&partnerID=8YFLogxK

U2 - 10.1137/110835918

DO - 10.1137/110835918

M3 - Article

SN - 0097-5397

VL - 41

SP - 367

EP - 390

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 2

ER -

Improved bounds for geometric permutations

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this