Bounding the number of geometric permutations induced by \(k\)-transversals

DOI10.1006/jcta.1996.0072zbMath0858.68117OpenAlexW2085034044MaRDI QIDQ1924220

Richard Pollack, Jacob E. Goodman, Rephael Wenger

Publication date: 3 November 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1996.0072

zbMATH Keywords

compact convex sets\(k\)-transversals

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

The overlay of lower envelopes and its applications ⋮ A Tverberg-type result on multicolored simplices ⋮ Refined bounds on the number of connected components of sign conditions on a variety ⋮ Multi-degree bounds on the Betti numbers of real varieties and semi-algebraic sets and applications ⋮ Slicing convex sets and measures by a hyperplane ⋮ On a real analog of Bezout inequality and the number of connected components of sign conditions

This page was built for publication: Bounding the number of geometric permutations induced by \(k\)-transversals