Abstract
We prove that the maximum number of geometric permutations, induced by line transversals to a collection of n pairwise disjoint balls in Rd, is Θ(nd-1). This improves substantially the upper bound of O(n2d-2) known for general convex sets. We show that the maximum number of geometric permutations of a sufficiently large collection of pair-wise disjoint unit discs in the plane is 2, improving the previous upper bound of 3 given in [5].
Original language | English |
---|---|
Pages | 400-406 |
Number of pages | 7 |
DOIs | |
State | Published - 1 Jan 1999 |
Externally published | Yes |
Event | Proceedings of the 1999 15th Annual Symposium on Computational Geometry - Miami Beach, FL, USA Duration: 13 Jun 1999 → 16 Jun 1999 |
Conference
Conference | Proceedings of the 1999 15th Annual Symposium on Computational Geometry |
---|---|
City | Miami Beach, FL, USA |
Period | 13/06/99 → 16/06/99 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Computational Mathematics