Journal ArticleOPEN ACCESS

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

Discrete and Computational Geometry (2001) 26(4) 543-548
DOI: 10.1007/s00454-001-0044-9
17Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Katz, M. J., & Varadarajan, K. R. (2001). A tight bound on the number of geometric permutations of convex fat objects in ℝd. Discrete and Computational Geometry, 26(4), 543–548. https://doi.org/10.1007/s00454-001-0044-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free