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

M J Katz; K R Varadarajan

doi:10.1007/s00454-001-0044-9

Back

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

Journal article

Open access

Peer reviewed

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

M J Katz and K R Varadarajan

Discrete & computational geometry, Vol.26(4), pp.543-548

12/01/2001

DOI: 10.1007/s00454-001-0044-9

Files and links (1)

url

https://doi.org/10.1007/s00454-001-0044-9View

Published (Version of record) Open Access

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 Theta (n(d-1)) obtained by Smorodinsky et al. [5] on the number of geometric permutations of n pairwise-disjoint balls.

Computer Science

Computer Science, Theory & Methods

Mathematics

Physical Sciences

Science & Technology

Technology

Details

Title: Subtitle: A tight bound on the number of geometric permutations of convex fat objects in R-d
Creators: M J Katz - Ben-Gurion University of the Negev
K R Varadarajan - University of Iowa
Resource Type: Journal article
Publication Details: Discrete & computational geometry, Vol.26(4), pp.543-548
Publisher: Springer Nature
DOI: 10.1007/s00454-001-0044-9
ISSN: 0179-5376
eISSN: 1432-0444
Number of pages: 6
Language: English
Date published: 12/01/2001
Academic Unit: Computer Science
Record Identifier: 9984259433502771

Metrics

4 Record Views

18 Times Cited - Web of Science