A tight bound on the number of geometric permutations of convex fat objects in ℝd

M. J. Katz, K. R. Varadarajan

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

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

Original languageEnglish
Pages (from-to)543-548
Number of pages6
JournalDiscrete and Computational Geometry
Volume26
Issue number4
DOIs
StatePublished - 1 Jan 2001

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'A tight bound on the number of geometric permutations of convex fat objects in ℝd'. Together they form a unique fingerprint.

Cite this