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

M. J. Katz; K. R. Varadarajan

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

M. J. Katz
, K. R. Varadarajan

Institute for the Theory of Computing

Research output: Contribution to conference › Paper › peer-review

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

Cite this

@conference{9c2b69844e3f4ae9b1d1819a238bf621,

title = "A tight bound on the number of geometric permutations of convex fat objects in Rd",

abstract = "The maximum number of geometric permutations of a set of n pairwise-disjoint convex and fat objects in Rd 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.",

keywords = "Fat objects, Geometric permutations, Line transversals, Separating set",

author = "Katz, \{M. J.\} and Varadarajan, \{K. R.\}",

year = "2001",

month = jan,

day = "1",

language = "English",

pages = "249--251",

note = "17th Annual Symposium on Computational Geometry (SCG'01) ; Conference date: 03-06-2001 Through 05-06-2001",

}

TY - CONF

T1 - A tight bound on the number of geometric permutations of convex fat objects in Rd

AU - Katz, M. J.

AU - Varadarajan, K. R.

PY - 2001/1/1

Y1 - 2001/1/1

N2 - The maximum number of geometric permutations of a set of n pairwise-disjoint convex and fat objects in Rd 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.

AB - The maximum number of geometric permutations of a set of n pairwise-disjoint convex and fat objects in Rd 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.

KW - Fat objects

KW - Geometric permutations

KW - Line transversals

KW - Separating set

UR - https://www.scopus.com/pages/publications/0034833911

M3 - Paper

SP - 249

EP - 251

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

Y2 - 3 June 2001 through 5 June 2001

ER -