A tight bound on the number of geometric permutations of convex fat objects in \(\mathbb{R}^d\)
From MaRDI portal
Publication:5955145
DOI10.1007/s00454-001-0044-9zbMath1020.52003MaRDI 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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52A37: Other problems of combinatorial convexity
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
Related Items
Some Discrete Properties of the Space of Line Transversals to Disjoint Balls, On the number of views of translates of a cube and related problems., Geometric permutations of disjoint unit spheres, Geometric permutations of higher dimensional spheres, INFLATING BALLS IS NP-HARD