Given n points in R d , a hyperplane is called halving if it has at most bn=2c points on either side. How many partitions of a point set (into the points on one side, on the hyperplane, and on the other side) by halving hyperplanes can be realized by an n-point set in R d ? Consider the following algorithmic problem rst. Given n points in R d , we want to… (More)

Sorry, we couldn't extract any figures or tables for this paper.