---
res:
bibo_abstract:
- "LetS be a collection ofn convex, closed, and pairwise nonintersecting sets in
the Euclidean plane labeled from 1 ton. A pair of permutations\n(i1i2in−1in)(inin−1i2i1)
\nis called ageometric permutation of S if there is a line that intersects all
sets ofS in this order. We prove thatS can realize at most 2n–2 geometric permutations.
This upper bound is tight.@eng"
bibo_authorlist:
- foaf_Person:
foaf_givenName: Herbert
foaf_name: Herbert Edelsbrunner
foaf_surname: Edelsbrunner
foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-9823-6833
- foaf_Person:
foaf_givenName: Micha
foaf_name: Sharir, Micha
foaf_surname: Sharir
bibo_doi: ' 10.1007/BF02187778'
bibo_issue: '1'
bibo_volume: 5
dct_date: 1990^xs_gYear
dct_publisher: Springer@
dct_title: The maximum number of ways to stabn convex nonintersecting sets in the
plane is 2n−2@
...