Paper Info
Title
A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in
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.
Year
DOI
Venue
2001
https://doi.org/10.1007/s00454-001-0044-9
Symposium on Computational Geometry 2013
Field
DocType
Volume
Discrete mathematics,Combinatorics,Permutation,Ball (bearing),Regular polygon,Mathematics
Conference
26
Issue
ISSN
Citations 
4
0179-5376
13
PageRank 
References 
Authors
0.87
7
2
Name
Order
Citations
PageRank
Matthew J. Katz122519.92
Kasturi Varadarajan2126984.78