A tight bound on the number of geometric permutations of convex fat objects in \(\mathbb{R}^d\)

DOI10.1007/s00454-001-0044-9zbMath1020.52003OpenAlexW1973877592MaRDI QIDQ5955145

Matthew J. Katz, Kasturi R. Varadarajan

Publication date: 18 March 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-001-0044-9

zbMATH Keywords

convex setfat convex setgeometric permutation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other problems of combinatorial convexity (52A37) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

Geometric permutations of non-overlapping unit balls revisited ⋮ INFLATING BALLS IS NP-HARD ⋮ Geometric permutations of higher dimensional spheres ⋮ On the number of views of translates of a cube and related problems. ⋮ Geometric permutations of disjoint unit spheres ⋮ Some Discrete Properties of the Space of Line Transversals to Disjoint Balls