volume 26, issue 4, P543-548 2001
DOI: 10.1007/s00454-001-0044-9
View full text
|
|
Share

Abstract: We show that the maximum number of geometric permutations of a set of n pairwise-disjoint convex and fat objects in R d is O(n d−1 ). This generalizes the bound of (n d−1 ) obtained by Smorodinsky et al. [5] on the number of geometric permutations of n pairwise-disjoint balls.

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
11
0

Publication Types

Select...

Relationship

0
0

Authors

Journals