Conference proceeding
A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{eals^d}$}
Proceedings of the seventeenth annual symposium on computational geometry, pp.249-251
SCG '01
06/01/2001
DOI: 10.1145/378583.378676
Abstract
We show that the maximum number of geometric permutations of a set of $n$ pairwise-disjoint convex and fat objects in $\reals^d$ is $O(n^{d-1})$. This generalizes the bound of $\Theta (n^{d-1})$ obtained by Smorodinsky et al. \cite{ssm98} on the number of geometric permutations of $n$ pairwise-disjoint balls.
Details
- Title: Subtitle
- A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{eals^d}$}
- Creators
- Matthew KatzKasturi Varadarajan
- Resource Type
- Conference proceeding
- Publication Details
- Proceedings of the seventeenth annual symposium on computational geometry, pp.249-251
- Series
- SCG '01
- DOI
- 10.1145/378583.378676
- Publisher
- ACM
- Language
- English
- Date published
- 06/01/2001
- Academic Unit
- Computer Science
- Record Identifier
- 9984410857902771
Metrics
15 Record Views