## Abstract

The maximum number of geometric permutations of a set of n pairwise-disjoint convex and fat objects in R^{d} is determined. The result is obtained by using the concept of a separating set of hyperplanes. The number of geometric permutations is found to be a constant independent of the number of pairwise disjoint objects n.

Original language | English |
---|---|

Pages | 249-251 |

Number of pages | 3 |

State | Published - 1 Jan 2001 |

Event | 17th Annual Symposium on Computational Geometry (SCG'01) - Medford, MA, United States Duration: 3 Jun 2001 → 5 Jun 2001 |

### Conference

Conference | 17th Annual Symposium on Computational Geometry (SCG'01) |
---|---|

Country/Territory | United States |

City | Medford, MA |

Period | 3/06/01 → 5/06/01 |

## Keywords

- Fat objects
- Geometric permutations
- Line transversals
- Separating set

## ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Computational Mathematics

## Fingerprint

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