A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{\reals^d}$}

DOI10.1145/378583.378676zbMath1376.68151OpenAlexW2042934006MaRDI QIDQ5361584

Matthew J. Katz, Kasturi R. Varadarajan

Publication date: 29 September 2017

Published in: Proceedings of the seventeenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/378583.378676

zbMATH Keywords

separating setgeometric permutationsfat objectsline traversals

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 (2)

Geometric permutations of balls with bounded size disparity. ⋮ On neighbors in geometric permutations.

This page was built for publication: A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{\reals^d}$}