@inproceedings{32617968b53041a8a245dbb064139905,
title = "Combinatorial complexity of hyperplane transversals",
abstract = "We show that the maximum combinatorial complexity of the space of hyperplane transversals to a family of n separated and strictly convex sets in Rd is Θ(nd/2), which generalizes results of Edelsbrunner and Sharir in the plane. As a key step in the argument, we show that the space of hyperplanes tangent to k ≤ d separated and strictly convex sets in Rd is a topological (d - k)-sphere.",
author = "Cappell, {Sylvain E.} and Richard Pollack and Goodman, {Jacob E.} and Micha Sharir and Janos Pach and Rephael Wenger",
year = "1990",
doi = "10.1145/98524.98542",
language = "English (US)",
isbn = "0897913620",
series = "Proc Sixth Annu Symp Comput Geom",
publisher = "Publ by ACM",
pages = "83--91",
booktitle = "Proc Sixth Annu Symp Comput Geom",
note = "Proceedings of the Sixth Annual Symposium on Computational Geometry ; Conference date: 06-06-1990 Through 08-06-1990",
}